An improved direct search numerical optimization procedure
Document Type
Article
Publication Date
1-1-1980
Abstract
An improved, nonlinear, constrained mathematical programming optimization algorithm is presented in this report. It couples a rotating coordinate pattern search with a feasible direction finding procedure used at points of pattern search termination. The procedure is compared with nineteen algorithms, including most of the popular methods, on ten test problems. These problems are such that the majority of codes failed to solve more than half of them. The new method proved superior to all others in the overall generality and efficiency rating, being the only one solving all problems. It was particularly effective on constrained problems where it was best in all rating categories. © 1980.
Identifier
0019024329 (Scopus)
Publication Title
Computers and Structures
External Full Text Location
https://doi.org/10.1016/0045-7949(80)90060-7
ISSN
00457949
First Page
539
Last Page
557
Issue
6
Volume
11
Grant
NOOOW754X987
Recommended Citation
Pappas, Michael, "An improved direct search numerical optimization procedure" (1980). Faculty Publications. 21413.
https://digitalcommons.njit.edu/fac_pubs/21413
