On the superlinear local convergence of a filter-SQP method

Mathematical Programming

Volumn 100, Issue 1, 2004, Pages 217-245

  Ulbrich, Stefan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Filter; Global convergence; Nonlinear programming; SQP; Superlinear convergence

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING; VECTORS;

FILTER; GLOBAL CONVERGENCE; SQP; SUPERLINEAR CONVERGENCE;

NONLINEAR PROGRAMMING;

EID: 19844381859     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0491-6     Document Type: Review

References (16)

1. Bertsekas, D.P.: Constrained optimization and Lagrange multiplier methods. Computer Science and Applied Mathematics, Academic Press Inc., New York, 1982
2. Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. In: Acta numerica, Acta Numer., Cambridge Univ. Press, Cambridge, 1995, pp. 1-51
3. Chin, C.M, Fletcher, R.: Numerical results for SLPSQP. Filter-SQP and LANCELOT on selected Cute test problems, Tech. Report NA/203, Department of Mathematics, Dundee University, Dundee, Scotland, 2001
4. Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-region methods. MPS/SIAM Series on Optimization, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2000
5. Facchinei, F., Lucidi, S.: Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems. J. Optim. Theory Appl. 85, 265-289 (1995)
6. Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, P.L., Wächter, A.: Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM J. Optim. 13, 635-659 (2002)
7. Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239-269 (2002)
8. Fletcher, R., Leyffer, S., Toint, P.L.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13, 44-59 (2002)
9. Glad, T., Polak, E.: A multiplier method with automatic limitation of penalty growth. Math. Program. 17, 140-155 (1979)
10. Gonzaga, C.C., Karas, E., Vanti, M.: A globally convergent filter method for nonlinear programming. Technical Report, Department of Mathematics, Federal University of Santa Catalina, Brazil, 2001 (Revised 2002)
11. Lucidi, S.: New results on a continuously differentiable exact penalty function. SIAM J. Optim. 2, 558-574 (1992)
12. Nocedal, J., Wright, S.J.: Numerical optimization. Springer Series in Operations Research, Springer-Verlag, New York, 1999
13. Toint, P.L.: Non-monotone filter methods. Presentation at the SIAM Conference on Optimization, Toronto, Canada, May 20-22, 2002
14. Ulbrich, M., Ulbrich, S.: Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function. Math. Program. 95, 103-135 (2003)
15. Ulbrich, M., Ulbrich, S., Vicente, L.N.: A globally convergent primal-dual interior-point filter method for nonconvex nonlinear programming. Technical Report TR00-12, Department of Computational and Applied Mathematics, Rice University, Houston, Texas 77005-1892, 2000 (Revised 2002)
16. Wächter, A., Biegler, L.T.: Global and local convergence of line search filter methods for nonlinear programming. CAPD Technical Report B-01-09, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, 2001 (Revised 2002)