The semismooth algorithm for large scale complementarity problems

The semismooth algorithm for large scale complementarity problems

0.00 Avg rating0 Votes
Article ID: iaor20032987
Country: United States
Volume: 13
Issue: 4
Start Page Number: 294
End Page Number: 311
Publication Date: Oct 2001
Journal: INFORMS Journal On Computing
Authors: , , , ,
Keywords: complementarity
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.

Reviews

Required fields are marked *. Your email address will not be published.