A Comparison of Algorithms for Large Scale Mixed Complementarity Problems

摘要: This paper provides a means for comparing various computer codes solving large scale mixed complementarity problems. We discuss inadequacies in how algorithms are currently compared, and present testing environment that partially solves these inadequacies. consists of library test problems, along with GAMS MATLAB interfaces allow problems to be easily accessed. Eight different algorithm implementations briefly described tested default parameter settings using the new environment.