Mesh Adaptive Direct Search Algorithms for Mixed Variable Optimization
This paper introduces a new derivative-free class of mesh adaptive direct search (MADS) algorithms for solving constrained mixed variable optimization problems, in which the variables may be continuous or categorical. This new class of algorithms, called mixed variable MADS (MV-MADS), generalizes both mixed variable pattern search (MVPS) algorithms for linearly constrained mixed variable problems and MADS algorithms for general constrained problems with only continuous variables. The convergence analysis, which makes use of the Clarke nonsmooth calculus, similarly generalizes the existing theory for both MVPS and MADS algorithms, and reasonable conditions are established for ensuring convergence of a subsequence of iterates to a suitably defined stationary point in the nonsmooth and mixed variable sense.
Abramson, M.A., Audet, C., Chrissis, J.W. et al. Mesh adaptive direct search algorithms for mixed variable optimization. Optim Lett 3, 35 (2009). https://doi.org/10.1007/s11590-008-0089-2
Copyright statement: © Springer-Verlag 2008.
The "Link to Full Text" button on this page loads the journal article hosted at the publisher’s website. Provided by the Springer Nature SharedIt content sharing program. Please attribute the work using the citation indicated below.