Abstract
AbstractVarious mathematical programming methods for structural optimization are studied. In a companion paper, these methods have been studied based on certain theoretical considerations. In this paper, the methods are studied based on solving a set of test problems. The methods that are studied include recursive QP, feasible directions, gradient projection, SUMT and multiplier methods. Various computer codes have been developed, and are studied together with some existing programs such as CONMIN and OPTDYN. The test problems considered have 3–47 design variables and 3–252 constraints. The evaluation criteria consist of studying the accuracy, reliability and efficiency of a code. It turns out that globally convergent algorithms (multiplier methods, in particular) are very reliable but not efficient. Primal algorithms (like CONMIN), which are not proved to be globally convergent, are efficient but not reliable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal for Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
