A local convergence property of primal-dual methods for nonlinear programming

Mathematical Programming

Volumn 115, Issue 2, 2008, Pages 199-222

  Armand, Paul ^a   Benoist, Joël ^a  

^a UNIVERSITY OF LIMOGES   (France)

Author keywords

Barrier methods; Constrained optimization; Interior point methods; Nonlinear programming; Primal dual methods

Indexed keywords

AEROSPACE APPLICATIONS; COMPUTER NETWORKS; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; NEWTON-RAPHSON METHOD; NONLINEAR PROGRAMMING; PERTURBATION TECHNIQUES; STANDARDS;

(001) PARAMETER; (I ,J) CONDITIONS; APPLIED (CO); CONVERGENCE (MATHEMATICS); INTERIOR POINT; LOCAL CONVERGENCE; NEIGHBOURHOOD; NEWTON METHODS; NON-LINEAR OPTIMIZATION PROBLEMS; NONNEGATIVITY CONSTRAINTS; ORIGINAL SYSTEMS; PERTURBATION PARAMETERS; PERTURBED SYSTEMS; PRIMAL DUAL METHODS; PRIMAL-DUAL; PROPERTY (S); RATE OF CONVERGENCE; SPRINGER (CO); SUPERLINEAR;

CONVERGENCE OF NUMERICAL METHODS;

EID: 45149089405     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0136-2     Document Type: Article

References (23)

1. Armand, P., Benoist, J., Orban, D.: Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming. Comput. Optim. Appl. (2007)(to appear)
2. Byrd R.H., Liu G. and Nocedal J. (1997). On the local behaviour of an interior point method for nonlinear programming. In: Griffiths, D.F., Higham, D.J., and Watson, G.A. (eds) Numerical Analysis 1997., pp 37-56. Addison-Welsey, Harlow
3. Coleman T.F. and Li Y. (1994). On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds. Math. Prog. 67: 189-224
4. Dussault J.P. (1995). Numerical stability and efficiency of penalty algorithms. SIAM J. Numer. Anal. 32: 296-317
5. Dussault J.P. and Elafia A. (2001). On the superlinear convergence order of the logarithmic barrier algorithm. Comput. Optim. Appl. 19: 31-53
6. El-Bakry A.S., Tapia R.A., Tsuchiya T. and Zhang Y. (1996). On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theory Appl. 89: 507-541
7. Fiacco A.V. and McCormick G.P. (1968). Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York
8. Gay D.M., Overton M.L. and Wright M.H. (1998). A primal-dual interior method for nonconvex nonlinear programming. In: Yuan, Y (eds) Advances in Nonlinear Programming (Beijing, 1996)., pp 31-56. Kluwer, Dordrecht
9. Gould N.I.M., Orban D., Sartenaer A. and Toint P.L. (2001). Superlinear convergence of primal-dual interior point algorithms for nonlinear programming. SIAM J. Optim. 11: 974-1002
10. Gould N.I.M., Orban D., Sartenaer A. and Toint P.L. (2002). Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Prog. 92: 481-508
11. Heinkenschloss M., Ulbrich M. and Ulbrich S. (1999). Superlinear and quadratic convergence of affine- scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. Math. Prog. 86: 615-635
12. Martinez H.J., Parada Z. and Tapia R.A. (1995). On the characterization of Q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming. Bol. Soc. Mat. Mexicana 1: 137-148
13. Nocedal, J., Wächter, A., Waltz, R.A.: Adaptive barrier strategies for nonlinear interior methods. Technical Report, Northwestern Univeristy, IL, USA (2005)
14. Tits A.L., Wächter A., Bakhtiari S., Urban T.J. and Lawrence C.T. (2003). A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties. SIAM J. Optim. 14: 173-199
15. Ulbrich M., Ulbrich S. and Vicente L.N. (2004). A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Prog. 100: 379-410
16. Vanderbei R.J. and Shanno D.F. (1999). An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13: 231-252
17. Vicente L.N. (2000). Local convergence of the affine-scaling interior-point algorithm for nonlinear programming. Comput. Optim. Appl. 17: 23-35
18. Vicente L.N. and Wright S.J. (2002). Local convergence of a primal-dual method for degenerate nonlinear programming. Comput. Optim. Appl. 22: 311-328
19. Wächter A. and Biegler L.T. (2006). On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Prog. 106: 25-57
20. Waltz R.A., Morales J.L., Nocedal J. and Orban D. (2006). An interior algorithm for nonlinear optimization that combines line search and trust region steps. Math. Prog. 107: 391-408
21. Yabe H. and Yamashita H. (1997). Q-superlinear convergence of primal-dual interior point quasi-Newton methods for constrained optimization. J. Oper. Res. Soc. Jpn 40: 415-436
22. Yamashita H. and Yabe H. (1996). Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization. Math. Prog. 75: 377-397
23. Yamashita H., Yabe H. and Tanabe T. (2005). A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization. Math. Prog. 102: 111-151