A truncated Newton method for the solution of large-scale inequality constrained minimization problems

Computational Optimization and Applications

Volumn 25, Issue 1-3, 2003, Pages 85-122

  Facchinei, Francisco ^a   Liuzzi, Giampaolo ^a   Lucidi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Active set; Constrained optimization; Exact penalty function; Newton type method; Strict complementarity

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; LARGE SCALE SYSTEMS;

MINIMIZATION PROBLEMS;

PROBLEM SOLVING;

EID: 0037394754     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022901020289     Document Type: Article

References (38)

1. R. Bellman, Introduction to Matrix Analysis. McGraw-Hill: New York, 1970.
2. H.Y. Benson, D.F. Shanno, and R.J. Vanderbei, "Interior-point methods for nonconvex nonlinear programming: Jamming and comparative numerical testing," Tech. Rep. ORFE-00-02, Operations Research and Financial Engineering, Princeton University, Princeton, NJ, USA, 2000.
3. O.P. Bertsekas, Constrained Optimization and Lagrange Multipliers Methods. Academic Press: New York, 1982.
4. I. Bongartz, A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "CUTE: Constrained and unconstrained testing environment," ACM Transaction on Mathematical Software, vol. 21, pp. 123-160, 1995.
5. I. Bongartz, A.R. Conn, N.I.M. Gould, M. Saunders, and Ph.L. Toint, "A numerical comparison between the LANCELOT and MINOS packages for large-scale nonlinear optimization," Tech. Rep. 97/13, Department of Mathematics, FUNDP, Namur, Belgium, 1997.
6. I. Bongartz, A.R. Conn, N.I.M. Gould, M. Saunders, and Ph.L. Toint, "A numerical comparison between the LANCELOT and MINOS packages for large-scale nonlinear optimization: The complete results," Tech. Rep. 97/14, Department of Mathematics, FUNDP, Namur, Belgium, 1997.
7. R.H. Byrd, M.E. Hribar, and J. Nocedal, "An interior point algorithm for large-scale nonlinear programming," SIAM J. Optimization, vol. 9, pp. 877-900, 1999.
8. R.H. Byrd, J.Ch. Gilbert, and J. Nocedal, "A trust region method based on interior point techniques for nonlinear programming," Math. Programming, vol. 89, pp. 149-185, 2000.
9. R.H. Byrd, J. Nocedal, and R.A. Waltz, "Feasible interior methods using slacks for nonlinear optimization," Tech. Rep. OTC 2000/11, Optimization Technology Center, Evanston, IL, USA, 2000.
10. A.R. Conn, N.I.M. Gould, and P.L. Toint, "LANCELOT: A Fortran package for large-scale nonlinear optimization," vol. 17 of Springer Series in Computational Mathematics, Springer Verlag, Heidelberg, New York, 1992.
11. G. Contaldi, G. Di Pillo, and S. Lucidi, "A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set," Operations Research Letters, vol. 14, pp. 153-161, 1993.
12. R.S. Dembo and T. Steihaug, "Truncated-Newton algorithms for large-scale unconstrained optimization," Math. Programming, vol. 26, pp. 190-212, 1983.
13. G. Di Pillo, F. Facchinei, and L. Grippo, "An RQP algorithm using a differentiable exact penalty function for inequality constrained problems," Math. Programming, vol. 55, pp. 49-68, 1992.
14. G. Di Pillo and L. Grippo, "An augmented lagrangian for inequality constraints in nonlinear programming problems," J. Optim. Theory and Appl., vol. 36, pp. 495-519, 1982.
15. G. Di Pillo and L. Grippo, "A continuously differentiable exact penalty function for nonlinear programming problems with inequality constraints," SIAM J. Control and Optimization, vol. 23, pp. 72-84, 1985.
16. G. Di Pillo and L. Grippo, "Exact penalty functions in constrained optimization," SIAM J. Control and Optimization, vol. 27, pp. 1333-1360, 1989.
17. G. Di Pillo, G. Liuzzi, S. Lucidi, and L. Palagi, "Use of a truncated newton direction in an augmented lagrangian framework," TR 8-02, Department of Computer and Systems Science, University of Rome "La Sapienza," Rome, Italy, 2002.
18. 1 functions and the maratos effect," Operations Research Letters, vol. 17, pp. 131-137, 1995.
19. F. Facchinei, "Robust recursive quadratic programming algorithm model with global and superlinear convergence properties," J. Optim. Theory and Appl., vol. 92, pp. 543-579, 1997.
20. F. Facchinei and S. Lucidi, "Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems," J. Optim. Theory and Appl., vol. 85, pp. 265-289, 1995.
21. R. Fletcher, N.I.M. Gould, S. Leyffer, and Ph.L. Toint, "Global convergence of trust-region SQP-filter algorithms for nonlinear programming," Tech. Rep. 99/03, Department of Mathematics, University of Namur, 61 rue de Bruxelles, B-5000, Namur, Belgium, 1999.
22. R. Fletcher and S. Leyffer, "Nonlinear programming without a penalty function," Math. Programming, vol. 91, pp. 239-270, 2002.
23. P.E. Gill, W. Murray, and M.A. Saunders, "SNOPT: An SQP algorithm for large-scale constrained optimization," SIAM J. Optimization, vol. 12, no. 4, pp. 976-1006, 2002.
24. T. Glad and E. Polak, "A multiplier method with automatic limitation of penalty growth," Math. Programming, vol. 17, pp. 140-155, 1979.
25. L. Grippo, F. Lampariello, and S. Lucidi, "A truncated newton method with non-monotone line search for unconstrained optimization," J. Optim. Theory and Appl., vol. 60, pp. 401-419, 1989.
26. L. Grippo, F. Lampariello, and S. Lucidi, "A class of nonmonotone stabilization methods in unconstrained optimization," Numerische Mathematik, vol. 59, pp. 779-805, 1991.
27. Harwell Subroutine Library, "A Catalogue of Subroutines" (Release 12), AEA Technology, Harwell, Oxfordshire, England, 1995.
28. S. Lucidi, "New results on a class of exact augmented lagrangians," J. Optim. Theory and Appl., vol. 58, pp. 259-282, 1988.
29. S. Lucidi, "New results on a continuously differentiable exact penalty function," SIAM J. Optimization, vol. 2, pp. 558-574, 1992.
30. O.L. Mangasarian and S. Fromowitz, "The Fritz-John necessary optimality conditions in the presence of equality constraints," J. Math. Analysis and Appl., vol. 17, pp. 34-47, 1967.
31. J.L. Morales, J. Nocedal, R.A. Waltz, G. Liu, and J.P. Goux, "Assessing the potential of interior methods for nonlinear optimization," Tech. Rep. OTC 2001/6, Optimization Technology Center, Evanston, IL, USA, 2001.
32. J.M. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press: New York, 1970.
33. L. Qi and Y. Yang, "Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization," J. Optim. Theory and Appl., vol. 113, pp. 297-323, 2001.
34. L. Qi and Y. Yang, "A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization," Journal of Global Optim., vol. 21, pp. 157-184, 2001.
35. D.F. Shanno and R.J. Vanderbei, "An interior point algorithm for nonconvex nonlinear programming," Computational Optimization and Applications, vol. 13, pp. 231-252, 1999.
36. P. Spellucci, "A new technique for inconsistent QP problems in the SQP methods," Math. Methods of Operations Research, vol. 47, pp. 355-400, 1998.
37. A. Wachter and L.T. Biegler, "Failure of global convergence for a class of interior point methods for nonlinear programming," Math. Programming, vol. 88, pp. 565-574, 2000.
38. A. Wachter and L.T. Biegler, "Global and local convergence of line search filter methods for nonlinear programming," Tech. Rep. B-01-09, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, USA, 2001.