When solving the general smooth nonlinear and possibly nonconvex optimization problem involving equality and/or inequality constraints, an approximate first-order critical point of accuracy ϵ can be ...
This paper develops a new algorithm for solving the general nonlinear programming problem that melds the flexible simplex search of Nelder and Mead with various additional rules to take care of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback