WorksMathematics
Projection-Based and Modulus-Based Equivalent Reformulations of the Linear Complementarity Problem and Corresponding Iterative Methods: A Review
Abstract
The Linear Complementarity Problem (LCP) is a fundamental mathematical model arising in optimization, equilibrium theory, and various scientific and engineering applications. Its complementarity structure admits several equivalent mathematical representations, which provide a foundation for developing a wide range of iterative solution methods. This review presents a systematic and critical analysis of the principal reformulations of the LCP, with particular emphasis on minimum-function, projection-based, positive-negative part, and modulus-based formulations. The mathematical equivalence of these representations to the standard LCP is examined, highlighting their underlying relationships and the preservation of the complementarity conditions. Building upon these formulations, the review surveys the corresponding iterative methods developed in the existing literature, focusing on their mathematical foundations, algorithmic structures, and convergence requirements. A comparative perspective is developed to discuss the relative advantages and limitations of the different approaches, emphasizing that the suitability of an iterative method depends on the structural properties of the underlying LCP and the specific algorithm employed. In addition, relevant performance measures, including iteration count, CPU time, complementarity residual, memory requirements, and parameter sensitivity, are discussed as criteria for numerical evaluation. Finally, the review identifies important challenges and potential research directions, particularly in adaptive parameter selection, effective matrix-splitting strategies, scalable implementations, and reproducible numerical benchmarking, with the aim of supporting the development of reliable and computationally efficient methods for solving LCPs