On Affine-Scaling Interior-Point Newton Methods for Nonlinear Minimization with Bound Constraints
- First Online:
- 130 Downloads
A class of new affine-scaling interior-point Newton-type methods are considered for the solution of optimization problems with bound constraints. The methods are shown to be locally quadratically convergent under the strong second order sufficiency condition without assuming strict complementarity of the solution. The new methods differ from previous ones by Coleman and Li [Mathematical Programming, 67 (1994), pp. 189–224] and Heinkenschloss, Ulbrich, and Ulbrich [Mathematical Programming, 86 (1999), pp. 615–635] mainly in the choice of the scaling matrix. The scaling matrices used here have stronger smoothness properties and allow the application of standard results from non smooth analysis in order to obtain a relatively short and elegant local convergence result. An important tool for the definition of the new scaling matrices is the correct identification of the degenerate indices. Some illustrative numerical results with a comparison of the different scaling techniques are also included.
KeywordsNewton’s method affine scaling interior-point method quadratic convergence identification of active constraints
Unable to display preview. Download preview PDF.
- 3.S. Bellavia and B. Morini, “An interior global method for nonlinear systems with simple bounds,” Optimization Methods and Software, to appear.Google Scholar
- 9.A.R. Conn, N.I.M. Gould, and Ph.L. Toint, “Global convergence of a class of trust region algorithms for optimization with simple bounds,” SIAM Journal on Numerical Analysis, vol. 25, pp. 433–460 1988. (Correction in: SIAM Journal on Numerical Analysis, vol. 26, pp. 764–767 1989).Google Scholar
- 11.J.E. Dennis and L.N. Vicente, “Trust-region interior-point algorithms for minimization problems with simple bounds,” in H. Fischer, B. Riedmüller, and S. Schäffler (eds.), Applied Mathematics and Parallel Computing. Festschrift for Klaus Ritter. Physica, Heidelberg, 1996, pp. 97–107.Google Scholar
- 12.G. Di Pillo, “Exact penalty methods,” in: E. Spedicato (ed.), Algorithms for Continuous Optimization, The State of the Art. Kluwer, pp. 209–254, 1994.Google Scholar
- 17.F. Facchinei and J.-S. Pang, “Finite-Dimensional Variational Inequalities and Complementarity Problems, Volume I,” Springer, New York-Berlin-Heidelberg, 2003.Google Scholar
- 18.F. Facchinei and J.-S. Pang, Finite-Dimensional Variational Inequalities and Complementarity Problems, Volume II. Springer, New York-Berlin-Heidelberg, 2003.Google Scholar