Computer Sciences Dept.

Superlinearly Convergent Quasi-Newton Algorithms for Nonlinearly Constrained Optimization Problems

Garcia Palomares, Olvi Mangasarian

A class of algorithms for nonlinearly constrained optimization problems is proposed. The subproblems of the algorithms are linearly constrained quadratic minimization problems which contain an updated estimate of the Hessian of the Lagrangian. Under suitable conditions and updating schemes local convergence and a super1inear rate of convergence are established. The convergence proofs require among other things twice differentiable objective and constraint functions, while the calculations use only first derivative data. Rapid convergence has been obtained in a number of test problems by using a program based on the algorithms proposed here.

Download this report (PDF)

Return to tech report index

Computer Science | UW Home