Feasible descent algorithms for mixed complementarity problems

Mathematical Programming, Series B

Volumn 86, Issue 3, 1999, Pages 475-497

  Ferris, Michael C ^a   Kanzow, Christian ^b   Munson, Todd S ^a  

^a University of Wisconsin Madison   (United States)

^b UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Feasible descent methods; Global convergence; Mixed complementarity problems; Superlinear convergence

Indexed keywords

EID: 0000203179     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050101     Document Type: Article

References (35)

1. Bertsekas, D.P. (1995): Nonlinear Programming. Athena Scientific, Belmont, MA
2. Billups, S.C. (1995): Algorithms for complementarity problems and generalized equations. Ph.D. Thesis. Computer Sciences Department, University of Wisconsin, Madison, WI
3. Billups, S.C. (1998): A homotopy based algorithm for mixed complementarity problems. Technical Report. Department of Mathematics, University of Colorado, Denver, CO
4. Billups, S.C., Ferris, M.C. (1997): QPCOMP: A quadratic program based solver for mixed complementarity problems. Math. Program. 76, 533-562
5. Brooke, A., Kendrick, D., Meeraus, A. (1988): GAMS: A User's Guide. The Scientific Press, South San Francisco, CA
6. Chen, B., Chen, X., Kanzow, C. (1997): A penalized Fischer-Burmeister NCP-function: Theoretical investigation and numerical results. Preprint 126, Institute of Applied Mathematics, University of Hamburg, Hamburg (revised May 1998)
7. Chen, B., Harker, P.T. (1993): A noninterior continuation method for quadratic and linear programming. SIAM J. Optim. 3, 503-515
8. Clarke, F.H. (1983): Optimization and Nonsmooth Analysis. John Wiley & Sons, New York, NY (reprinted by SIAM, Philadelphia, PA, 1990)
9. De Luca, T., Facchinei, F., Kanzow, C. (1996): A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 407-439
10. Dirkse, S.P., Ferris, M.C. (1995): The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optim. Methods Software 5, 123-156
11. Dirkse, S.P., Ferris, M.C. (1995): MCPLIB: A collection of nonlinear mixed complementarity problems. Optim. Methods Software 5, 319-345
12. Dirkse, S.P., Ferris, M.C. (1997): Crash techniques for large-scale complementarity problems. In: Ferris, M.C., Pang, J.-S., eds., Complementarity and Variational Problems: State of the Art, pp. 40-61. SIAM, Philadelphia, PA
13. Facchinei, F., Fischer, A., Kanzow, C. (1997): A semismooth Newton method for variational inequalities: The case of box constraints. In: Ferris, M.C., Pang, J.-S., eds., Complementarity and Variational Problems: State of the Art, pp. 76-90. SIAM, Philadelphia
14. Facchinei, F., Soares:, J. (1997): A new merit function for nonlinear complementarity problems and a related algorithm. SIAM J. Optim. 7, 225-247
15. Ferris, M.C., Munson, T.S. (1999): Interfaces to PATH 3.0: Design, implementation and usage. Comput. Optim. Appl. 12, 207-227
16. Ferris, M.C., Ralph, D. (1995): Projected gradient methods for nonlinear complementarity problems via normal maps. In: Du, D., Qi, L., Womersley, R., eds., Recent Advances in Nonsmooth Optimization, pp. 57-87. World Scientific Publishers
17. Fischer, A. (1992): A special Newton-type optimization method. Optim. 24, 269-284
18. Fischer, A. (1998): A new constrained optimization reformulation for complementarity problems. J. Optim. Theory Appl. 97, 105-117
19. 0- and P-properties; extended vertical and horizontal LCPs. Lin. Alg. Appl. 223/224, 695-715
20. Josephy, N.H. (1979): Newton's method for generalized equations. Technical Summary Report 1965. Mathematics Research Center, University of Wisconsin, Madison, WI
21. Kanzow, C.: An inexact QP-based method for nonlinear complementarity problems. Numer. Math., to appear
22. Kanzow, C., Kleinmichel, H. (1998): A new class of semismooth Newton-type methods for nonlinear complementarity problems. Comput. Optim. Appl. 11, 227-251
23. Kanzow, C., Qi, H.-D.: A QP-free constrained Newton-type method for variational inequality problems. Math. Program., to appear [doi: 10.1007/s10107980007a]
24. Liu, J. (1995): Strong stability in variational inequalities. SIAM J. Control Optim. 33, 725-749
25. Luo, Z.-Q., Tseng, P. (1992): Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2, 43-54
26. Mathiesen, L. (1987): An algorithm based on a sequence of linear complementarity problems applied to a Walrasian equilibrium model: an example. Math. Program. 37, 1-18
27. Moré, J.J., Sorensen, D.C. (1983): Computing a trust region step. SIAM J. Scientific Stat. Comput. 4, 553-572
28. Pang, J.-S., Gabriel, S.A. (1993): NE/SQP: A robust algorithm for the nonlinear complementarity problem. Math. Program. 60, 295-337
29. Qi:, L. (1997): Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems. Applied Mathematics Report AMR 97/14. School of Mathematics, University of New South Wales, Sydney, Australia (revised September 1997)
30. Ralph, D. (1994): Global convergence of Newton's method for nonsmooth equations via the path search. Math. Oper. Res. 19, 352-389
31. Robinson, S.M. (1980): Strongly regular generalized equations. Math. Oper. Res. 5, 43-62
32. Robinson, S.M. (1992): Normal maps induced by linear transformations. Math. Oper. Res. 17, 691-714
33. Rutherford, T.F. (1995): Extensions of GAMS for complementarity problems arising in applied economic analysis. J. Econ. Dyn. Control 19, 1299-1324
34. Rutherford, T.F. (1997): Applied general equilibrium modeling with MPSGE as a GAMS subsystem: An overview of the modeling framework and syntax. Comput. Econ., to appear
35. Sun, D., Womersley, R.S.: A new unconstrained differentiable merit function for box constrained variational inequality problems and a damped Gauss-Newton method. SIAM J. Optim., to appear