Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems

Optimization Methods and Software

Volumn 22, Issue 5, 2007, Pages 713-735

  Kanzow, Christian ^a   Petra, Stefania ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

Cauchy step; Complementarity problems; Filter method; Global convergence; Nonlinear least squares reformulation; Quadratic convergence; Semismooth functions; Trust region methods

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; NONLINEAR SYSTEMS; PROBLEM SOLVING;

CAUCHY STEP; COMPLEMENTARITY PROBLEMS; FILTER METHOD; NONLINEAR LEAST SQUARES REFORMULATION; SEMISMOOTH FUNCTIONS; TRUST REGION METHODS;

LEAST SQUARES APPROXIMATIONS;

EID: 34548120747     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780701296455     Document Type: Article

References (40)

1. Kanzow, C. and Petra, S., 2004, On a semismooth least squares formulation of complementarity problems with gap reduction. Optimization Methods and Software, 19, 507-525.
2. Billups, S.C., 1995, Algorithms for complementarity problems and generalized equations. PhD thesis, Computer Sciences Department, University of Wisconsin, Madison.
3. Chen, B., Chen, X. and Kanzow, C., 2000, A penalized Fischer-Burmeister NCP-function. Mathematical Programming, 88, 211-216.
4. De Luca, T., Facchinei, F. and Kanzow, C., 1996, A semismooth equation approach to the solution of nonlinear complementarity problems. Mathematical Programming, 75, 407-439.
5. Facchinei, F. and Soares, J., 1997, A new merit function for nonlinear complementarity problems and a related algorithm. SIAM Journal of Optimization, 7, 225-247.
6. Ferris, M.C., Kanzow, C. and Munson, T.S., 1999, Feasible descent algorithms for mixed complementarity problems. Mathematical Programming, 86, 475-497.
7. Jiang, H., 1999, Global convergence analysis of the generalized Newton and Gauss-Newton methods of the Fischer-Burmeister equation for the complementarity problem. Mathematics of Operations Research, 24, 529-543.
8. Jiang, H., Fukushima, M., Qi, L. and Sun, D., 1998, A trust region method for solving generalized complementarity problems. SIAM Journal of Optimization, 8, 140-157.
9. Kanzow, C., 2001, Strictly feasible equation-based methods for mixed complementarity problems. Numerische Mathematik, 89, 135-160.
10. Sun, D. and Qi, L., 1999, On NCP-functions. Computational Optimization and Applications, 13, 201-230.
11. Ulbrich, M., 2001, Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems. SIAM Journal of Optimization, 11, 889-916.
12. Dennis, J.E. and Schnabel, R.B., 1983, Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Englewood Cliffs, NJ: Prentice Hall).
13. Björck, Å., 1996, Numerical Methods for Least Squares Problems (Philadelphia, PA: SIMA).
14. Clarke, F.H., 1983, Optimization and Nonsmooth Analysis (New York: John Wiley & Sons) (reprinted by SIAM, Philadelphia, 1990).
15. Qi1 L. and Sun, J., 1993, A nonsmooth version of Newton's method. Mathematical Programming, 58, 353-367.
16. Qi, L., 1993, Convergence analysis of some algorithms for solving nonsmooth equations. Mathematics of Operations Research, 18, 227-244.
17. Pang, J.-S. and Qi, L., 1993, Nonsmooth equations: motivation and algorithms. SIAM Journal of Optimization, 3, 443-465.
18. Facchinei, F. and Pang, J.-S., 2003, Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. II (New York: Springer).
19. Kanzow, C., Yamashita, N. and Fukushima, M., 2004, Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints. Journal of Computational and Applied Mathematics, 172, 375-397.
20. Coleman, T.F. and Li, Y., 1996, An interior trust region approach for nonlinear minimization, subject to bounds. SIAM Journal of Optimization, 6, 418-445.
21. Kanzow, C. and Klug, A., 2006, On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints. Computational Optimization and Applications, 35, 177-197.
22. Ulbrich, M., Ulbrich, S. and Heinkenschloss, M., 1999, Global convergence of trust-region interior-point algorithms for infinite-dimensional nonconvex minimization subject to pointwise bounds. SIAM Journal on Control and Optimization, 37, 731-764.
23. Kanzow, C. and Zupke, M., 1999, Inexact trust-region methods for nonlinear complementarity problems. In: M. Fukushima and L. Qi (Eds) Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods (Dordrecht, The Netherlands: Kluwer Academic Press), pp. 211-233.
24. Conn, A.R., Gould, N.I.M. and Toint, Ph.L., 2000, Trust-Region Methods (Philadelphia, PA: SIAM).
25. Moré, J. and Sorensen, D.C, 1983, Computing a trust region step. SIAM Journal on Scientific and Statistical Computing, 4, 553-572.
26. Fletcher, R. and Leyffer, S., 2002, Nonlinear programming without a penalty function. Mathematical Programming, 91, 239-269.
27. Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, Ph.L. and Wächter, A., 2002, Global convergence of trust-region SQP-filter algorithms for nonlinear programming. SIAM Journal of Optimization, 13, 635-659.
28. Gould, N.I.M., Leyffer, S. and Toint, Ph.L., 2004, A multidimensional filter algorithm for nonlinear equations and nonlinear least squares. SIAM Journal of Optimization, 15, 17-38.
29. Ulbrich, S., 2004, On the superlinear local convergence of a filter-SQP method. Mathematical Programming, 100, 217-245.
30. Ulbrich, M., Ulbrich, S. and Vicente, L.N., 2004, A globally convergent primal-dual interior-point filter method for nonlinear programming. Mathematical Programming, 100, 379-410.
31. Fletcher, R. and Leyffer, S., 2003, Filter-type algorithms for solving systems of algebraic equations and inequalities. In: G. Di Pillo and A. Murli (Eds) High-Performance Algorithms and Software, in Nonlinear Optimization (Dordrecht, The Netherlands: Kluwer), pp. 259-278.
32. Facchinei, F. and Pang, J.-S., 2003, Finite-Dimensional Variational Inequalities and Complementarity Problems, Vol. I (New York: Springer).
33. Fischer, A., 1992, A special Newton-type optimization method. Optimization, 24, 269-284.
34. Kanzow, C. and Kleinmichel, H., 1998, A new class of semismooth Newton-type methods for nonlinear complementarity problems. Computational Optimization and Applications, 11, 227-251.
35. Dirkse, S.P. and Ferris, M.C., 1995, MCPLIB: a collection of nonlinear mixed complementarity problems. Optimization Methods and Software, 5, 319-345.
36. Neumaier, A., 1998, MINQ-General definite and bound constrained indefinite quadratic programming. Available online at: www.mat.univie.ac.at/ ~neum/software/minq/.
37. Dirkse, S.P. and Ferris, M.C., 1995, The PATH solver: a non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software, 5, 123-156.
38. Fischer, A., 1997, Solution of monotone complementarity problems with locally Lipschitzian functions. Mathematical Programming, 76, 513-532.
39. Fletcher, R., Leyffer, S. and Toint, Ph.L., 2002, On the global convergence of a filter-SQP algorithm. SIAM Journal of Optimization, 13, 44-59.
40. Robinson, S.M., 1980, Strongly regular generalized equations. Mathematics of Operations Research, 5, 43-62.