The Semismooth Algorithm for Large Scale Complementarity Problems
- 1 November 2001
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 13 (4) , 294-311
Abstract
Complementarity solvers are continually being challenged by modelers demanding improved reliability and scalability. Building upon a strong theoretical background, the semismooth algorithm has the potential to meet both of these requirements. We discuss relevant theory associated with the algorithm and then describe a sophisticated implementation in detail. Particular emphasis is given to the use of preconditioned iterative methods to solve the (nonsymmetric) systems of linear equations generated at each iteration and robust methods for dealing with singularity. Results on the MCPLIB test suite indicate that the code is reliable and efficient and scales well to very large problems.Keywords
This publication has 26 references indexed in Scilit:
- NEOS and CondorACM Transactions on Mathematical Software, 2000
- Feasible descent algorithms for mixed complementarity problemsMathematical Programming, 1999
- Quantifying the Uruguay RoundThe Economic Journal, 1997
- Mcplib: a collection of nonlinear mixed complementarity problemsOptimization Methods and Software, 1995
- The path solver: a nommonotone stabilization scheme for mixed complementarity problemsOptimization Methods and Software, 1995
- A special newton-type optimization methodOptimization, 1992
- A class of nonmonotone stabilization methods in unconstrained optimizationNumerische Mathematik, 1991
- Maintaining LU factors of a general sparse matrixLinear Algebra and its Applications, 1987
- Computation of economic equilibria by a sequence of linear complementarity problems1985
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982