A feasible semismooth asymptotically Newton method for mixed complementarity problems

Mathematical Programming, Series B

Volumn 94, Issue 1, 2002, Pages 167-187

  Sun, Defeng ^a   Womersley, Robert S ^b   Qi, Houduo ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Convergence; Mixed complementarity problems; Projected Newton method; Semismooth equations

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

MIXED COMPLEMENTARITY PROBLEMS (MCP); PROJECTED NEWTON METHODS; SEMISMOOTH EQUATIONS;

MATHEMATICAL PROGRAMMING;

EID: 2442590125     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0305-2     Document Type: Article

References (31)

1. D.P. Bertsekas, "On the Goldstein-Levitin-Polyak gradient projection method", IEEE Transactions on Automatic Control, 21 (1976), 174-184.
2. (2] S.C. Billups, "Improving the robustness of descent-based methods for semismooth equations using proximal perturbations", Mathematical Programming, 87 (2000), 153-175.
3. S.C. Billups, S.P. Dirkse and M.C. Ferris, "A comparison of algorithms for large-scale mixed complementarity problems", Computational Optimization and Applications, 7 (1997), 3-25.
4. P.H. Calamai and J.J. More, "Projected gradient methods for linearly constrained problems". Mathematical Programming, 39 (1987), 93-116.
5. B. Chen, X. Chen and C. Kanzow, "A penalized Fischer-Burmeister NCP-function", Mathematical Programming, 88 (2000), 211-216.
6. F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1983.
7. T. De Luca, F. Facchinei and C. Kanzow, "A semismooth equation approach to the solution of nonlinear complementarity problems", Mathematical Programming, 75 (1996), 407-439.
8. S.P. Dirkse and M.C. Ferris, "MCPLIB: A collection of nonlinear mixed complementarity problems", Optimization Methods and Software, 5 (1995), 319-345.
9. F. Facchinei and J. Soares, "A new merit function for nonlinear complementarity problems and a related algorithm", SIAM Journal on Optimization, 7 (1997), 225-247.
10. M.C. Ferris, C. Kanzow and T.S. Munson, "Feasible descent algorithms for mixed complementarity problems". Mathematical Programming, 86 (1999), 475-497.
11. M.C. Ferris and J.-S. Pang, "Engineering and economic applications of complementarity problems", SIAM Review, 39 (1997), 669-713.
12. A. Fischer, "A special Newton-type optimization method", Optimization, 24 (1992), 269-284.
13. A. Fischer, "A new constrained optimization reformulation for complementarity problems", Journal of Optimization Theory and Applications, 97(1998), 105-117.
14. E.H. Gafni and D.P. Bertsekas, "Two-metric projection methods for constrained optimization", SIAM Journal on Control and Optimization, 22 (1984), 936-964.
15. L. Grippo, F.L. Lampariello and S. Lucidi, "A nonmonotone linesearch technique for Newton's method", SIAM Journal on Numerical Analysis, 23 ( 1986), 707-716.
16. P.T. Harker and J.-S. Pang, "Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications", Mathematical Programming, 48 (1990), 161-220.
17. C. Kanzow, "Strictly feasible equation-based methods for mixed complementarity problems", Numerische Mathematik, 59(2001), 135-160.
18. C. Kanzow and H.-D. Qi, "A QP-free constrained Newton-type method for variational inequality problems", Mathematical Programming, 85 (1999), 81-106.
19. R. Mifflin, "Semismooth and semiconvex functions in constrained optimization", SIAM Journal on Control and Optimization, 15 ( 1977), 957-972.
20. T.S. Munson, F. Facchinei, M.C. Ferris, A. Fischer and C. Kanzow, "The semismooth algorithm for large scale complementarity problems", INFORMS Journal on Computing, 13 (2001), 294-311.
21. J.-S. Pang and L. Qi, "Nonsmooth equations: Motivation and algorithms", SIAM Journal on Optimization, 3 (1993), 443-465.
22. L. Qi, "Convergence analysis of some algorithms for solving nonsmooth equations", Mathematics of Operations Research, 18 (1993), 227-244.
23. L. Qi, "Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems", Mathematics of Operations Research, 24 (1999), 440-471.
24. L. Qi and J. Sun, "A nonsmooth version of Newton's method", Mathematical Programming, 58 (1993), 353-367.
25. S.M. Robinson, Generalized equations, in Mathematical Programming: The State of the Art, A. Bachern, M. Grötschel and B. Korte, eds., Springer-Verlag, Berlin, 1983, 346-367.
26. D. Sun, "Projected Newton-type methods for constrained nonsmooth equations", Talk presented at the "Workshop on Nonsmooth and Smoothing Methods" in Hong Kong City University, Hong Kong, China, December 1998.
27. D. Sun and L. Qi, "On NCP-functions", Computational Optimization and Applications, 13 (1999), 201-220.
28. D. Sun and R.S. Womersley, "A new unconstrained differentiable merit function for box constrained variational inequality problems and a damped Gauss-Newton method", SIAM Journal on Optimization, 9 (1999), 388-413.
29. M. Ulbrich, "Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems", SIAM Journal on Optimization, 11 (2001), 889-917.
30. N. Yamashita and M. Fukushima, "A new merit function and a descent method for semi-definite programming problems", in Reformulations: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer Academic Publishers B.V., 1999, 381-404.
31. E.H. Zarantonello, "Projections on convex sets in Hilbert space and spectral theory", in E.H. Zarantonello, ed., Contributions to Nonlinear Functional Analysis, Academic Press, New York, 1971, 343-424.