Convergence to second-order stationary points of a primal-dual algorithm model for nonlinear programming

Mathematics of Operations Research

Volumn 30, Issue 4, 2005, Pages 897-915

  Pillo, Gianni Di ^a   Lucidi, Stefano ^a   Palagi, Laura ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Augmented Lagrangian function; Nonlinear programming; Primal dual algorithm; Second order stationary point

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; OPTIMIZATION;

AUGMENTED LAGRANGIAN FUNCTION; CURVILINEAR LINE SEARCH TECHNIQUE; PRIMAL-DUAL ALGORITHM; SECOND-ORDER STATIONARY POINT;

NONLINEAR PROGRAMMING;

EID: 31144460048     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1050.0150     Document Type: Article

References (32)

1. Auslender, A. 1979. Penalty methods for computing points that satisfy second order necessary conditions. Math. Programming 17 229-238.
2. Byrd, R. H., M. E. Hribar, J. Nocedal. 1999. An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9 877-900.
3. Byrd, R. H., R. B. Schnabel, G. A. Shultz. 1987. A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal. 24 1152-1170.
4. Clarke, F. H. 1983. Optimization and Nonsmooth Analysis. John Wiley and Sons, New York.
5. Coleman, T. F., J. Liu, W. Yuan. 2002. A new trust-region algorithm for equality constrained optimization, Comput. Optim. Appl. 21 177-199.
6. Conn, A. R., N. I. M. Gould, D. Orban, Ph. L. Toint. 2000. A primal-dual trust region algorithm for non-convex nonlinear programming. Math. Programming Ser. B 87 215-249.
7. Dennis J. E., L. N. Vicente. 1997. On the convergence theory of trust-region-based algorithms for equality-constrained optimization. SIAM J. Optim. 7 527-550.
8. Dennis, J. E., M. Heinkenschloss, L. N. Vicente. 1998. Trust-region interior-point SQP algorithms for a class of nonlinear programming problems. SIAM J. Control Optim. 36 1750-1794.
9. Di Pillo, G., L. Grippo. 1989. Exact penalty functions in constrained optimization. SIAM J. Control Optim. 27 1333-1360.
10. Di Pillo G., S. Lucidi. 1996. On exact augmented Lagrangian functions in nonlinear programming. G. Di Pillo, F. Giannessi, eds. Nonlinear Optimization and Applications. Plenum Press, New York, 85-100.
11. Di Pillo G., S. Lucidi. 2001. An augmented Lagrangian function with improved exactness properties. SIAM J. Optim. 12 376-406.
12. Di Pillo, G., G. Liuzzi, S. Lucidi, L. Palagi. 2002. Use of a truncated Newton direction in an augmented Lagrangian framework. Technical Report 18-02, Dipartimento di Informatica e Sistemistica, Università di Roma, "La Sapienza," Rome, Italy, http://www.dis.uniromal.it/~palagi.
13. El-Alem, M. 1996. Convergence to a second-order point for a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization. J. Optim. Theory Appl. 91 61-79.
14. Facchinei, F., S. Lucidi. 1995. Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems. J. Optim. Theory Appl. 85 265-289.
15. Facchinei, F., S. Lucidi. 1998. Convergence to second order stationary points in inequality constrained optimization. Math. Oper. Res. 23 746-766.
16. Facchinei, F., A. Fischer, C. Kanzow. 1998. On the accurate identification of active constraints. SIAM J. Optim. 9 14-32.
17. Ferris, M. C., S. Lucidi, M. Roma. 1996. Nonmonotone curvilinear line search methods for unconstrained optimization. Comput. Optim. Appl. 6 117-136.
18. Forsgren, A., W. Murray. 1997. Newton methods for large-scale linear inequality constrained minimization. SIAM J. Optim. 7 162-176.
19. Glad, T., E. Polak. 1979. A multiplier method with automatic limitation of penalty growth. Math. Programming 17 140-155.
20. Grippo, L., F. Lampariello, S. Lucidi. 1989. A truncated Newton method with nonmonotone linesearch for unconstrained optimization. J. Optim. Theory Appl. 60 401-419.
21. 1.1 data. Appl. Math. Optim. 11 43-56.
22. Lucidi, S. 1992. New results on a continuosly differentiable exact penalty function. SIAM J. Optim. 2 558-574.
23. Lucidi, S., F. Rochetich, M. Roma. 1998. Curvilinear stabilization techniques for truncated Newton methods in large scale unconstrained optimization: The complete results. SIAM J. Optim. 8 916-939.
24. McCormick, G. P. 1977. A modification of Armijo's step-size rule for negative curvature. Math. Programming 13 111-115.
25. McCormick, G. P. 1983. Nonlinear Programming: Theory, Algorithms and Applications. John Wiley and Sons, New York.
26. Moguerza J. M., F. J. Prieto. 2003. An augmented Lagrangian interior point method using directions of negative curvature. Math. Programming 95 573-616.
27. More, J. J., D. C. Sorensen. 1979. On the use of directions of negative curvature in a modified Newton method. Math. Programming 16 1-20.
28. Moré, J. J., D. C. Sorensen. 1983. Computing a trust region step. SIAM J. Sci. Statist. Comput. 4 553-572.
29. Mukai, H., E. Polak. 1978. A second-order method for the general nonlinear programming problem. J. Optim. Theory Appl. 26 515-532.
30. Qi, L., J. Sun. 1993. A nonsmooth version of Newton's method, Math. Programming 58 353-367.
31. Sorensen, D. C. 1982. Newton's method with a model trust region modification. SIAM J. Numer. Anal. 19 409-426.
32. Tseng, P. 2002. A convergent infeasible interior-point trust-region methods for constrained optimization. SIAM J. Optim. 13 432-469.