Robustness, generality and efficiency of optimization algorithms in practical applications

Abstract

The theoretical foundations of two approaches, sequential quadratic programming (SQP) and optimality criteria (OC), are analyzed and compared, with emphasis on the critical importance of parameters such as accuracy, generality, robustness, efficiency, and ease of use in large scale structural optimization. A simplified fighter wing and active control of space structures are considered with other example problems. When applied to general system identification problems, the OC methods are shown to lose simplicity and demonstrate lack of generality, accuracy and robustness. It is concluded that the SQP method with a potential constraint strategy is a better choice as compared to the currently prevalent mathematical programming and OC approaches.