A Newton-Type Algorithm for the Solution of Inequality Constrained Minimization Problems
We describe a new Newton-type algorithm for the solution of inequality constrained minimization problems. The algorithm is based on an active-set strategy and, at each iteration, only requires the solution of one linear system. Under mild assuptions, and without requiring strict complementarity, we prove q-quadratic convergence of the primal variables towards the solution.
Unable to display preview. Download preview PDF.
- F. Facchinei and S. Lucidi. Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems. Journal of Optimization Theory and Applications, (to appear), 1994.Google Scholar
- W. Murray and M.H. Wright. Projected Lagrangian methods based on the trajectories of penalty and barrier functions. Tech. Rep. SOL 78–23, Stanford University, California, 1978.Google Scholar