An extension of the simplex method to constrained nonlinear optimization (Q1106727)

The simplex algorithm of \textit{J. A. Nelder} and \textit{R. Mead} [Computer J. 7, 308-313 (1965; Zbl 0229.65053)] is extended to handle nonlinear optimization problems with constraints. To prevent the simplex from collapsing into a subspace near the constraints, a delayed reflection is introduced for those points moving into the infeasible region. Numerical experience indicates that the proposed algorithm yields good results in the presence of both inequality and equality constraints, even when the constraint region is narrow. We note that it may be possible to modify and improve the algorithm by trying out variants.