Personal tools
You are here: Home Publications Mesh Adaptive Direct Search Algorithms for Constrained Optimization
Document Actions

Charles Audet and Jr J Dennis (2004)

Mesh Adaptive Direct Search Algorithms for Constrained Optimization

Les Journées de l'optimisation 2004.

We introduce the Mesh Adaptive Direct Search (MADS) class of algorithms for nonlinear optimization. MADS extends the Generalized Pattern Search (GPS) class by allowing local exploration, called polling, in a dense set of directions in the space of optimization variables. This means that under certain hypotheses, including a weak constraint qualification due to Rockafellar, MADS can treat constraints by the extreme barrier approach of setting the objective to infinity for infeasible points and treating the problem as unconstrained. The main GPS convergence result is to identify limit points where the Clarke generalized derivatives are nonnegative in a finite set of directions, called refining directions. Although in the unconstrained case, nonnegative combinations of these directions spans the whole space, the fact that there can only be finitely many GPS refining directions limits rigorous justification of the barrier approach to finitely many constraints for GPS. The MADS class of algorithms extend this result; the set of refining directions may even be dense in R^n, although we give an example where it is not.

Also available as a Rice University, Department of Computational and Applied Mathematics Technical Report (TR04-02). http://www.caam.rice.edu/caam/trs/2004/TR04-02.pdf
by admin last modified 2007-12-10 21:05
« September 2010 »
Su Mo Tu We Th Fr Sa
1234
567891011
12131415161718
19202122232425
2627282930
 

Powered by Plone

LACSI Collaborators include:

Rice University LANL UH UNM UIUC UNC UTK