Comparison of two sets of first-order conditions as bases of interior-point Newton methods for optimization with simple bounds

Authors:
D. C. Jamrog;R. A. Tapia;Y. Zhang
Affiliations:
Graduate Student, Department of Computational and Applied Mathematics, Rice University, Houston, Texas;Professor, Department of Computational and Applied Mathematics, Rice University, Houston, Texas;Associate Professor, Department of Computational and Applied Mathematics, Rice University, Houston, Texas
Venue:
Journal of Optimization Theory and Applications
Year:
2002

Citing 4
Cited 0

On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds

Mathematical Programming: Series A and B
Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming

Computational Optimization and Applications
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on some of the Variables

SIAM Journal on Optimization
Local behavior of the Newton method on two equivalent systems from linear programming

Journal of Optimization Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we compare the behavior of two Newton interior-point methods derived from two different first-order necessary conditions for the same nonlinear optimization problem with simple bounds. One set of conditions was proposed by Coleman and Li; the other is the standard KKT set of conditions. We discuss a perturbation of the CL conditions for problems with one-sided bounds and the difficulties involved in extending this to problems with general bounds. We study the numerical behavior of the Newton method applied to the systems of equations associated with the unperturbed and perturbed necessary conditions. Preliminary numerical results for convex quadratic objective functions indicate that, for this class of problems, the Newton method based on the perturbed KKT formulation appears to be the more robust.