Efficient progressive polynomial approximate optimization

This study proposes efficient progressive polynomial approximate optimization (ePPAO) which is a new function-based sequential approximate optimization algorithm. ePPAO finds an improved design than an initial design in a short amount of time and at low-cost. The proposed method adopts a screening m...

Full description

Saved in:
Bibliographic Details
Published in:Structural and multidisciplinary optimization 2018-10, Vol.58 (4), p.1783-1803
Main Authors: Ryu, Dong-Heum, Lee, Yongbin, Choi, Dong-Hoon
Format: Article
Language:English
Subjects:
Algorithms
Computational Mathematics and Numerical Analysis
Design engineering
Engineering
Engineering Design
Industrial design
Optimization
Polynomials
Research Paper
Theoretical and Applied Mechanics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This study proposes efficient progressive polynomial approximate optimization (ePPAO) which is a new function-based sequential approximate optimization algorithm. ePPAO finds an improved design than an initial design in a short amount of time and at low-cost. The proposed method adopts a screening method in every iteration to improve efficiency for large-scale problems. A new move limit strategy as a region management technique was developed based on the concept of the trust region method. To evaluate the proposed method, we solved well-known unconstrained and constrained problems and compared the results with two different algorithms from commercial software similar to the ePPAO concepts.. In addition, the proposed method is applied to an industrial design problem.
ISSN:1615-147X
1615-1488
DOI:10.1007/s00158-018-1997-0