Groupe d’études et de recherche en analyse des décisions


Mesh-based Nelder-Mead algorithm for inequality constrained optimization


Despite the lack of theoretical and practical convergence support, the Nelder-Mead (NM) algorithm is widely used to solve unconstrained optimization problems. It is a derivative-free algorithm, that attempts iteratively to replace the worst point of a simplex by a better one. The present paper proposes a search step of the Mesh Adaptive Direct Search (Mads) algorithm for inequality constrained optimization, inspired by the NM algorithm. The proposed algorithm does not suffer from the NM lack of convergence, but instead inherits from the totality of the Mads convergence analysis. Numerical experiments show an important improvement in the quality of the solutions produced using this search step.

, 20 pages