Skip to main content
SpringerLink
Log in

A Comparison of Large Scale Mixed Complementarity Problem Solvers

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

This paper provides a means for comparing various computercodes for solving large scale mixed complementarity problems. Wediscuss inadequacies in how solvers are currently compared, andpresent a testing environment that addresses these inadequacies. Thistesting environment consists of a library of test problems, along withGAMS and MATLAB interfaces that allow these problems to be easilyaccessed. The environment is intended for use as a tool byother researchers to better understand both their algorithms and theirimplementations, and to direct research toward problem classes thatare currently the most challenging. As an initial benchmark, eightdifferent algorithm implementations for large scale mixedcomplementarity problems are briefly described and tested with defaultparameter settings using the new testing environment.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. C. Billups. Algorithms for Complementarity Problems and Generalized Equations. PhD thesis, University of Wisconsin-Madison, Madison, Wisconsin, August 1995.

    Google Scholar 

  2. S. C. Billups and M. C. Ferris. QPCOMP: A quadratic program based solver for mixed complementarity problems. Mathematical Programmingforthcoming, 1996.

  3. A. Brooke, D. Kendrick, and A. Meeraus. GAMS: A User's Guide. The Scientific Press, South San Francisco, CA, 1988.

    Google Scholar 

  4. Chunhui Chen and O. L. Mangasarian. A class of smoothing functions for nonlinear and mixed complementarity problems. Computational Optimization and Applications, 5:97–138, 1996.

    Google Scholar 

  5. R. W. Cottle. Nonlinear programs with positively bounded Jacobians. PhD thesis, Department of Mathematics, University of California, Berkeley, California, 1964.

    Google Scholar 

  6. T. De Luca, F. Facchinei, and C. Kanzow. A semismooth equation approach to the solution of nonlinear complementarity problems. Preprint 93, Institute of Applied Mathematics, University of Hamburg, Hamburg, January 1995.

    Google Scholar 

  7. S. P. Dirkse and M. C. Ferris. MCPLIB: A collection of nonlinear mixed complementarity problems. Optimization Methods and Software, 5:319–345, 1995.

    Google Scholar 

  8. S. P. Dirkse and M. C. Ferris. The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optimization Methods and Software, 5:123–156, 1995.

    Google Scholar 

  9. S. P. Dirkse, M. C. Ferris, P.V. Preckel, and T. Rutherford. The GAMS callable program library for variational and complementarity solvers. Mathematical Programming Technical Report 94-07, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1994. Available from ftp://ftp.cs.wisc.edu/mathprog/ tech-reports/.

    Google Scholar 

  10. F. Facchinei and J. Soares. A new merit function for nonlinear complementarity problems and a related algorithm. SIAM Journal on Optimization, forthcoming 1996.

  11. F. Facchinei and J. Soares. Testing a new class of algorithms for nonlinear complementarity problems. In F. Giannessi and A. Maugeri, editors, Variational Inequalities and Network Equilibrium Problems, pages 69–83. Plenum Press, New York, 1995.

    Google Scholar 

  12. M.C. Ferris and J. S. Pang. Engineering and economic applications of complementarity problems. Discussion Papers in Economics 95-4, Department of Economics, University of Colorado, Boulder, Colorado, 1995. Available from ftp://ftp.cs.wisc.edu/math-prog/tech-reports/.

    Google Scholar 

  13. M. C. Ferris and D. Ralph. Projected gradient methods for nonlinear complementarity problems via normal maps. In D. Du, L. Qi, and R. Womersley, editors, Recent Advances in Nonsmooth Optimization, pages 57–87. World Scientific Publishers, 1995.

  14. M. C. Ferris and T. F. Rutherford. Accessing realistic complementarity problems within Matlab. In G. Di Pillo and F. Giannessi, editors, Proceedings of Nonlinear Optimization and Applications Workshop, Erice June 1995, Plenum Press, New York, 1996.

    Google Scholar 

  15. A. Fischer. A special Newton-type optimization method. Optimization, 24:269–284, 1992.

    Google Scholar 

  16. A. Fischer and C. Kanzow. On finite termination of an iterative method for linear complementarity problems. Preprint MATH-NM-10-1994, Institute for Numerical Mathematics, Technical University of Dresden, Dresden, Germany, 1994.

    Google Scholar 

  17. R. Fourer, D. Gay, and B. Kernighan. AMPL. The Scientific Press, South San Francisco, California, 1993.

    Google Scholar 

  18. C. B. Garcia and W. I. Zangwill. Pathways to Solutions, Fixed Points, and Equilibria. Prentice-Hall, Inc, Englewood Cliffs, New Jersey, 1981.

    Google Scholar 

  19. C. Geiger and C. Kanzow. On the resolution of monotone complementarity problems. Computational Optimization and Applications, 5:155–173, 1996.

    Google Scholar 

  20. S.-P. Han, J. S. Pang, and N. Rangaraj. Globally convergent Newton methods for nonsmooth equations. Mathematics of Operations Research, 17:586–607, 1992.

    Google Scholar 

  21. P. T. Harker and B. Xiao. Newton's method for the nonlinear complementarity problem: A B-differentiable equation approach. Mathematical Programming, 48:339–358, 1990.

    Google Scholar 

  22. Lars Mathiesen. Computation of economic equilibria by a sequence of linear complementarity problems. Mathematical Programming Study, 23:144–162, 1985.

    Google Scholar 

  23. J. J. Moré. Global methods for nonlinear complementarity problems. Technical Report MCS-P429-0494, Argonne National Laboratory, Argonne, Illinois, April 1994.

    Google Scholar 

  24. J. S. Pang. Newton's method for B-differentiable equations. Mathematics of Operations Research, 15:311–341, 1990.

    Google Scholar 

  25. J. S. Pang. A B-differentiable equation based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. Mathematical Programming, 51:101–132, 1991.

    Google Scholar 

  26. J. S. Pang and S. A. Gabriel. NE/SQP: A robust algorithm for the nonlinear complementarity problem. Mathematical Programming, 60:295–338, 1993.

    Google Scholar 

  27. D. Ralph. Global convergence of damped Newton's method for nonsmooth equations, via the path search. Mathematics of Operations Research, 19:352–389, 1994.

    Google Scholar 

  28. S. M. Robinson. Generalized equations. In A. Bachem, M. Grötchel, and B. Korte, editors, Mathematical Programming: The State of the Art, Bonn 1982, pages 346–367. Springer Verlag, Berlin, 1983.

    Google Scholar 

  29. S. M. Robinson. Normal maps induced by linear transformations. Mathematics of Operations Research, 17:691–714, 1992.

    Google Scholar 

  30. T. F. Rutherford. MILES: A mixed inequality and nonlinear equation solver. Working Paper, Department of Economics, University of Colorado, Boulder, 1993.

    Google Scholar 

  31. T. F. Rutherford. Extensions of GAMS for complementarity problems arising in applied economic analysis. Journal of Economic Dynamics and Control, forthcoming, 1996.

  32. H. E. Scarf. The approximation of fixed points of a continuous mapping. SIAM Journal on Applied Mathematics, 15:1328-1343, 1967.

    Google Scholar 

  33. M. J. Todd. Computation of Fixed Points and Applications, volume 124 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Heidelberg, 1976.

    Google Scholar 

  34. B. Xiao and P. T. Harker. A nonsmooth Newton method for variational inequalities: I: Theory. Mathematical Programming, 65:151–194, 1994.

    Google Scholar 

  35. B. Xiao and P. T. Harker. A nonsmooth Newton method for variational inequalities: II: Numerical results. Mathematical Programming, 65:195–216, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, University of Colorado, Denver, Colorado, 80217

    Stephen C. Billups

  2. GAMS Development Corporation, Washington, DC, 20007

    Steven P. Dirkse

  3. Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 53706

    Michael C. Ferris

Authors
  1. Stephen C. Billups
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven P. Dirkse
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael C. Ferris
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Billups, S.C., Dirkse, S.P. & Ferris, M.C. A Comparison of Large Scale Mixed Complementarity Problem Solvers. Computational Optimization and Applications 7, 3–25 (1997). https://doi.org/10.1023/A:1008632215341

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008632215341

Search

Navigation