Abstract
<p style='text-indent:20px;'>An interior point modified Nelder Mead method for nonlinearly constrained optimization is described. This method neither uses nor estimates objective function or constraint gradients. A modified logarithmic barrier function is used. The method generates a sequence of points which converges to KKT point(s) under mild conditions including existence of a Slater point. Numerical results are presented that show the algorithm performs well in practice.</p>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have