deposit_your_work

Pattern search algorithms for mixed variable general constrained optimization problems

Files in this item

Files Size Format View
3090119.PDF 6.927Mb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Pattern search algorithms for mixed variable general constrained optimization problems
Author: Abramson, Mark Aaron
Advisor: Dennis, John E., Jr.; Audet, Charles
Degree: Doctor of Philosophy thesis
Abstract: A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented. The Audet-Dennis Generalized Pattern Search (GPS) algorithm for bound constrained mixed variable optimization problems is extended to problems with general nonlinear constraints by incorporating a filter, in which new iterates are accepted whenever they decrease the incumbent objective function value or constraint violation function value. Additionally, the algorithm can exploit any available derivative information (or rough approximation thereof) to speed convergence without sacrificing the flexibility often employed by GPS methods to find better local optima. In generalizing existing GPS algorithms, the new theoretical convergence results presented here reduce seamlessly to existing results for more specific classes of problems. While no local continuity or smoothness assumptions are made, a hierarchy of theoretical convergence results is given, in which the assumptions dictate what can be proved about certain limit points of the algorithm. A new Matlab(c) software package was developed to implement these algorithms. Numerical results are provided for several nonlinear optimization problems from the CUTE test set, as well as a difficult nonlinearly constrained mixed variable optimization problem in the design of a load-bearing thermal insulation system used in cryogenic applications.
Citation: Abramson, Mark Aaron. (2003) "Pattern search algorithms for mixed variable general constrained optimization problems." Doctoral Thesis, Rice University. http://hdl.handle.net/1911/18502.
URI: http://hdl.handle.net/1911/18502
Date: 2003

This item appears in the following Collection(s)