Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption

Mathematical Programming, Series B

Volumn 86, Issue 3, 1999, Pages 615-635

  Heinkenschloss, Matthias ^a   Ulbrich, Michael ^b   Ulbrich, Stefan ^b  

^a Rice University   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Affine scaling; Bound constraints; Degeneracy; Interior point algorithms; Nonlinear programming; Optimality conditions; Superlinear convergence

Indexed keywords

EID: 0000860416     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050107     Document Type: Article

References (28)

1. Bertsekas, D.P. (1982): Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20, 221-246
2. Bonnans, J.F., Pola, C. (1997): A trust region interior point algorithm for linearly constrained optimization. SIAM J. Optim. 7, 717-731
3. Coleman, T.F., Li, Y. (1994): On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Program. 67, 189-224
4. Coleman, T.F., Li, Y. (1996): An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418-445.
5. Coleman, T.F., Li, Y. (1997): A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints. CORNELLCS TR97-1642, Department of Computer Science, Cornell University, Ithaca, NY 14853-3801
6. Conn, A.R., Gould, N.I.M., Toint, Ph.L. (1988): Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433-460. See [7]
7. Conn, A.R., Gould, N.I.M., Toint, Ph.L. (1989): Correction to the paper on global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 26, 764-767
8. Dennis, J.E., Heinkenschloss, M., Vicente, L.N. (1998): Trust-region interior-point algorithms fora class of nonlinear programming problems. SIAM J. Control Optim. 36, 1750-1794
9. Dennis, J.E., Vicente, L.N. (1996): Trust-region interior-point algorithms for minimization methods with simple bounds. In: Fischer, H., Riedmüller, B., Schäffler, S., eds., Applied Mathematics and Parallel Computing, Festschrift for Klaus Ritter, pp. 97-107. Physica-Verlag, Heidelberg
10. El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y. (1996): On the formulation and theory of the primal-dual Newton interior-point method for nonlinear programming. J. Optim. Theory Appl. 89, 507-541
11. El-Bakry, A.S., Tapia, R.A., Zhang, Y. (1996): On the convergence rate of Newton interior-point methods in the absence of strict complementarity. Comput. Optim. Appl. 6, 157-167
12. Facchinei, F., Kanzow, C. (1997): A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Math. Program. 76, 493-512
13. Fiacco, A.V. (1983): Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Mathematics in Science and Engineering, Vol. 165. Academic Press, New York
14. Fiacco, A.V., McCormick, G.P. (1968): Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley & Sons, Chichester, New York, Brisbane, Toronto, Singapore
15. Fischer, A. (1992): A special Newton-type optimization method. Optimization 24, 269-284
16. Fischer, A. (1997): Solution of monotone complementarity problems with locally Lipschitzian functions. Math. Program. 76, 513-532
17. Gonzaga, C.C., Tapia, R.A. (1997): On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set. SIAM J. Optim. 7, 47-65
18. Lescrenier, M. (1991): Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold. SIAM J. Numer. Anal. 28, 476-495
19. Lin, C.-J., Moré, J.J. (1998): Newton's method for large bound-constrained optimization problems. Technical Report ANL/MCS-P724-0898, Mathematics and Computer Sciences Division, Argonne National Laboratories, 9700 South Cass Avenue, Argonne, Ill. 60439
20. Monteiro, R.D.C., Wright, S.J. (1994): Local convergence of interior point algorithms for degenerate monotone LCP. Comput. Optim. Appl. 3, 131-155
21. Robinson, S.M. (1980): Strongly regular generalized equations. Math. Oper. Res. 5, 43-62
22. Sun, J. (1993): A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions. Math. Program. 60, 69-79
23. Ulbrich, M., Ulbrich, S. (1997): Superlinear convergence of affine-scaling interior-point newton methods for infinite-dimensional nonlinear problems with pointwise bounds. TR97-05, Department of Computational and Applied Mathematics, Rice University, Houston, Texas. Accepted subject to revisions for publication in SIAM J. Control Optim.
24. Ulbrich, M., Ulbrich, S., Heinkenschloss, M. (1999): Global convergence of affine-scaling interior-point Newton methods for infinite-dimensional nonlinear problems with pointwise bounds. SIAM J. Control Optimization 37, 731-764
25. Vicente, L.N. (1998): On interior-point Newton algorithms for discretized optimal control problems with state constraints. Optim. Methods Softw. 8, 249-275
26. Wright, M.H. (1992): Interior point methods for constrained optimization. In: Iserles, A., ed., Acta Numerica 1992, pp. 341-407. Cambridge University Press, Cambridge, London, New York
27. Wright, S.J. (1996): Primal-Dual Interior-Point Methods. SIAM, Philadelphia, PA
28. Yamashita, H., Yabe, H. (1996): Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization. Math. Program. 75, 377-397