Nonlinear programming without a penalty function or a filter

Mathematical Programming

Volumn 122, Issue 1, 2010, Pages 155-196

  Gould, N I M ^a   Toint, Ph L ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Equality constraints; Global convergence; Nonlinear optimization; Numerical algorithms

Indexed keywords

CONSTRAINED NONLINEAR OPTIMIZATION; EQUALITY CONSTRAINTS; FIRST-ORDER; GLOBAL CONVERGENCE; GLOBALLY CONVERGENT; JACOBIANS; NON-LINEARITY; NONLINEAR OPTIMIZATION; NUMERICAL ALGORITHMS; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; PENALTY FUNCTION; STATIONARY POINTS;

CONSTRAINED OPTIMIZATION; LARGE SCALE SYSTEMS; NONLINEAR PROGRAMMING;

CONVERGENCE OF NUMERICAL METHODS;

EID: 68449102019     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0244-7     Document Type: Article

References (27)

1. L.T. Biegler J. Nocedal C. Schmid 1995 A reduced Hessian method for large-scale constrained optimization SIAM J. Optim. 5 2 314 347
2. Bielschowsky, R.H., Gomes, F.A.M.: Dynamical control of infeasibility in nonlinearly constrained optimization. Technical Report 23/06, Department of Applied Mathematics, IMECC-UNICAMP, Campinas, Brazil. SIAM J. Optim. (2006, to appear)
3. R.H. Byrd F.E. Curtis J. Nocedal 2008 An inexact SQP method for equality constrained optimization SIAM J. Optim. 19 1 351 369
4. R.H. Byrd J.Ch. Gilbert J. Nocedal 2000 A trust region method based on interior point techniques for nonlinear programming Math. Program. Ser. A 89 1 149 186
5. R.H. Byrd N.I.M. Gould J. Nocedal R.A. Waltz 2004 An algorithm for nonlinear optimization using linear programming and equality constrained subproblems Math. Program. Ser. B 100 1 27 48
6. R.H. Byrd M.E. Hribar J. Nocedal 2000 An interior point algorithm for large scale nonlinear programming SIAM J. Optim. 9 4 877 900
7. T.F. Coleman A.R. Conn 1982 Nonlinear programming via an exact penalty function method: asymptotic analysis Math. Program. 24 3 123 136
8. Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. Number 01. In: MPS-SIAM Series on Optimization. SIAM, Philadelphia, USA (2000)
9. M. El-Alem 1995 Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization J. Optim. Theory Appl. 87 3 563 577
10. M. El-Alem 1999 A global convergence theory for a general class of trust-region-based algorithms for constrained optimization without assuming regularity SIAM J. Optim. 9 4 965 990
11. R. Fletcher S. Leyffer 2002 Nonlinear programming without a penalty function Math. Program. 91 2 239 269
12. R. Fletcher N.I.M. Gould S. Leyffer Ph.L. Toint A. Wächter 2002 Global convergence of trust-region SQP-filter algorithms for nonlinear programming SIAM J. Optim. 13 3 635 659
13. R. Fletcher S. Leyffer Ph.L. Toint 2002 On the global convergence of a filter-SQP algorithm SIAM J. Optim. 13 1 44 59
14. Gould, N.I.M., Toint, Ph.L.: Nonlinear programming without a penalty function or a filter. Technical Report 07/2, Department of Mathematics, FUNDP-University of Namur, Namur, Belgium (2007)
15. N.I.M. Gould S. Leyffer Ph.L. Toint 2005 A multidimensional filter algorithm for nonlinear equations and nonlinear least-squares SIAM J. Optim. 15 1 17 38
16. M. Heinkenschloss L.N. Vicente 2001 Analysis of inexact trust region SQP algorithms SIAM J. Optim. 12 2 283 302
17. Himmelblau D.M.: Applied Nonlinear Programming. McGraw-Hill, New York (1972)
18. M. Lalee J. Nocedal T.D. Plantenga 1998 On the implementation of an algorithm for large-scale equality constrained optimization SIAM J. Optim. 8 3 682 706
19. X. Liu Y. Yuan 2000 A robust trust-region algorithm for solving general nonlinear programming problems SIAM J. Scientific Comput. 22 517 534
20. D.Q. Mayne E. Polak 1982 A superlinearly convergent algorithm for constrained optimization problems Math. Program. Stud. 16 45 61
21. Omojokun, E.O.: Trust region algorithms for optimization with nonlinear equality and inequality constraints. PhD thesis, University of Colorado, Boulder, Colorado, USA (1989)
22. T. Steihaug 1983 The conjugate gradient method and trust regions in large scale optimization SIAM J. Numer. Anal. 20 3 626 637
23. Toint Ph.L.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I.S. (eds) Sparse Matrices and Their Uses, pp. 57-88. Academic Press, London (1981)
24. S. Ulbrich M. Ulbrich 2003 Nonmonotone trust region methods for nonlinear equality constrained optimization without a penalty function Math. Program. Ser. B 95 1 103 105
25. Yamashita, H., Yabe, H.: A globally convergent trust-region SQP method without a penalty function for nonlinearly constrained optimization. Technical report, Mathematical Systems, Inc., Sinjuku-ku, Tokyo, Japan (2003)
26. Yamashita, N.: A globally convergent qusi-newton method for equality constrained optimization that does not use a penalty function. Technical report, Mathematical Systems, Inc., Sinjuku-ku, Tokyo, Japan, 1979. Revised in (1982)
27. Zoppke-Donaldson, C.: A tolerance-tube approach to sequential quadratic programming with applications. PhD thesis, Department of Mathematics and Computer Science, University of Dundee, Dundee, Scotland, UK (1995)