A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653): Difference between revisions

A new globally convergent algorithm for minimizing an objective function subject to equality and inequality constraints is presented. The algorithm determines a search direction by first solving a linear program and using the information gained thereby to define a quadratic approximation, with a guaranteed solution, to the original problem; the solution of the quadratic problem is the desired search direction. The algorithm incorporates a new method for choosing the penalty parameter. Numerical results illustrate the performance of the algorithm.