Adaptive Complex Method for Efficient Design Optimization
2007 (English)In: Proceedings of ASME 33rd Design Automation Conference, September 4-7, Las Vegas, USA, 2007, 265-272 p.Conference paper (Other academic)
Box’s Complex method for direct search has shown promise when applied to simulation based optimization. In direct search methods, like Box’s Complex method, the search starts with a set of points, where each point is a solution to the optimization problem. In the Complex method the number of points must be at least one plus the number of variables. However, in order to avoid premature termination and increase the likelihood of finding the global optimum more points are often used at the expense of the required number of evaluations. The idea in this paper is to gradually remove points during the optimization in order to achieve an adaptive Complex method for more efficient design optimization. The proposed method shows encouraging results when compared to the Complex method with fix number of points and a quasi-Newton method.
Place, publisher, year, edition, pages
2007. 265-272 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-13233DOI: 10.1115/DETC2007-34773ISBN: 0-7918-3806-4 (online)ISBN: 0-7918-4807-8 (print)OAI: oai:DiVA.org:liu-13233DiVA: diva2:18088
ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference