On the global convergence of a filter-SQP algorithm

SIAM Journal on Optimization

Volumn 13, Issue 1, 2003, Pages 44-59

  Fletcher, Roger ^a   Leyffer, Sven ^a   Toint, Philippe L ^b  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

^b UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Filter; Global convergence; Multiobjective optimization; Nonlinear programming; SQP

Indexed keywords

EID: 0037288670     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262340038081X     Document Type: Article

References (15)

1. A.R. CONN, N.I.M. GOULD, AND PH.L. TOINT, Trust Region Methods, MPS/SIAM Ser. Optim. MP01, SIAM, Philadelphia, 2000.
2. C.M. CHIN AND R. FLETCHER, On the Global Convergence of an SLP-Filter Algorithm That Takes EQP Steps, Report NA/199, Department of Mathematics, Dundee University, Dundee, Scotland, 2001.
3. C.M. CHIN AND R. FLETCHER, Numerical Results of SLPSQP, FilterSQP and LANCELOT on Selected Cute Test Problems, Report NA/203, Department of Mathematics, Dundee University, Dundee, Scotland, 2001.
4. R. FLETCHER, N.I.M. GOULD, S. LEYFFER, AND PH-.L. TOINT, Global Convergence of Trust-Region SQP-Filter Algorithms for Nonlinear Programming, Technical report 99/03, Department of Mathematics, University of Namur, Namur, Belgium, 1999 (revised, 2001).
5. R. FLETCHER AND S. LEYFFER, Nonlinear programming without a penalty function, Math. Program., 91 (2002), pp. 239-269.
6. R. FLETCHER, S. LEYFFER, AND PH-.L. TONIT, On the Global Convergence of an SLP-Filter Algorithm, Report NA/183, Department of Mathematics, Dundee University, Dundee, Scotland, 1999.
7. R. FLETCHER AND E. SAINZ DE LA MAZA, Nonlinear programming and nonsmooth optimization by successive linear programming, Math. Programming, 43 (1989), pp. 235-256.
8. J. GAUVIN, A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming, Math. Programming, 12 (1977), pp. 136-138.
9. O.L. MANGASARIAN, Nonlinear Programming, McGraw-Hill, New York, 1969.
10. H. JIANG, M. FUKUSHIMA, L. QI, AND D. SUN, A trust region method for solving generalized complementarity problems, SIAM J. Optim., 8 (1998), pp. 140-157.
11. CH. KANZOW AND M. ZUPKE, Inexact trust-region methods for nonlinear complementarity problems, in Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi, eds., Keuwer Academic Publishers, Dordrecht, The Netherlands, 1999, pp. 211-233.
12. K. MADSEN, An algorithm for minimax solution of overdetermined systems of nonlinear equations, J. Inst. Math. Appl., 16 (1975), pp. 321-328.
13. M. ULBRICH AND S. ULBRICH, Non-monotone Trust Region Methods for Nonlinear Equality Constrained Optimization without a Penalty Function, Technical report, Zentrum Mathematik, Technische Universität München, Munich, Germany, 2000.
14. M. ULBRICH, S. ULBRICH, AND L.N. VICENTE, 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, TX, 2000.
15. A. WÄCHTER AND L.T. BIEGLER, 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, PA, 2001.