A modified SQP-filter method for nonlinear complementarity problem

Applied Mathematical Modelling

Volumn 33, Issue 6, 2009, Pages 2890-2896

  Su, Ke ^a,b   Cai, Hui ping ^c  

^a HEBEI UNIVERSITY   (China)

^b TONGJI UNIVERSITY   (China)

^c Shijiazhuang College   (China)

Author keywords

Filter method; Global convergence; Nonlinear complementarity problems; Sequential quadratic programming

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DYNAMIC PROGRAMMING; NONLINEAR PROGRAMMING;

FILTER METHOD; GLOBAL CONVERGENCE; INITIAL POINTS; NON-LINEAR PROGRAMMING PROBLEMS; NONLINEAR COMPLEMENTARITY PROBLEMS; NUMERICAL RESULTS; SEQUENTIAL QUADRATIC PROGRAMMING; TRADITIONAL FILTERS; TYPE METHODS;

OPTIMIZATION;

EID: 60249100703     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2008.10.019     Document Type: Article

References (18)

1. Fischer A. Solution of monotone complementarity problems with locally Lipschitzan functions. Math. Program. 76 (1997) 513-532
2. Jiang H.Y., and Qi L.Q. A new nonsmooth equations approach to nonlinear complementarity problems. SAIM J. Control. Optim. 35 (1997) 178-193
3. Ma C.F. A new smoothing quasi-Newton method for nonlinear complementarity problems. Appl. Math. Comput. 171 (2005) 807-823
4. More J.J. Global methods for nonlinear complementarity problems. Math. Oper. Res. 21 (1996) 589-614
5. Nie P.Y. A filter method for solving nonlinear complementarity problems. Appl. Math. Comput. 167 (2005) 677-694
6. Zhou G.L. A modified SQP method and its global convergecne. J. Global Optim. 11 (1997) 193-205
7. Fletcher R., and Leyffer S. Nonlinear programming without a penalty function. Math. Program. 91 2 (2002) 239-269
8. Nie P.Y., and Ma C.F. A trust region filter method for general nonlinear programming. Appl. Math. Comput. 172 (2006) 1000-1017
9. Ulbrich M., and Ulbrich S. Nonmonotone trust region method for nonlinear equality constrained optimization without a penalty function. Math. Program. Ser. B (2003) 103-113
10. R. Fletcher, S. Leyffer, A Boundle Filter Method for Nonsmooth Nonlinear Optimization, Technical Report NA/195, Department of Mathematics, University of Dundee, Scotland, December 1999.
11. Beson H.Y., Shanno D.F., and Vanderbei R. Interior point method for nonconvex nonlinear programming jamming and numerical test. Math. Program. 99 (2004) 35-48
12. Liu X.W., and Sun J. Global convergence analysis of line search interior-point methods for nonlinear programming without reqularity assumptions. J. Optim. Theory Appl. 125 (2005) 609-628
13. Liu V., and Sun J. A robust primal-dual interior point algorithm for nonlinear programs. SIAM J. Optim. 14 (2004) 1163-1186
14. Ulbrich M., Ulbrich S., and Vicente L.N. A global convergent primal-dual interior filter method for nonconvex nonlinear programming. Math. Program. 100 (2004) 379-410
15. Audet C., and Dennis J.E. A pattern search filter method for nonlinear programming without derivatives. SIAM J. Control. Optim. 14 (2004) 980-1010
16. Fletcher R., Gould N.I.M., Leyffer S., Toint P.L., and Wachter A. A global convergence of a trust region SQP-filter algorithm for general nonlinear programming. SIAM J. Optim. 13 (2002) 635-660
17. Fletcher R., Leyffer S., and Toint P.L. On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13 (2002) 44-59
18. Ulbrich S. On the superlinear local convergence of a filter-SQP methods. Math. Program. 100 (2004) 217-245