A Two-Step Levenberg-Marquardt Type Method for Solving Weighted Linear Complementarity Problems

Li Dong *

College of Mathematics and Statistics, Xinyang Normal University, Xinyang 464000, China.

Ping Zhang

College of Mathematics and Statistics, Xinyang Normal University, Xinyang 464000, China.

*Author to whom correspondence should be addressed.


Abstract

The weighted linear complementarity problem (WLCP) is important for modeling a variety of economic equilibrium problems. However, most existing numerical methods for WLCP either require the problem to be monotone or rely on nonsingularity conditions to ensure fast convergence. To overcome these limitations, this paper proposes a two-step Levenberg-Marquardt type method (TS-LMM) for solving WLCPs. By incorporating a smooth weighted complementarity function, the WLCP is reformulated as a system of smooth nonlinear equations, which is then solved using the proposed algorithm. The method is proved to be globally convergent without the need for monotonicity. Furthermore, under a local error bound condition, the proposed method achieves a cubic convergence rate, which is faster than the quadratic convergence of existing Levenberg-Marquardt methods. Numerical results demonstrate that the proposed method outperforms existing Levenberg-Marquardt methods in both iteration count and CPU time.

Keywords: Weighted linear complementarity problems, Levenberg-Marquardt method, Cubic convergence


How to Cite

Dong, Li, and Ping Zhang. 2026. “A Two-Step Levenberg-Marquardt Type Method for Solving Weighted Linear Complementarity Problems”. Asian Journal of Mathematics and Computer Research 33 (1):110-24. https://doi.org/10.56557/ajomcor/2026/v33i110385.

Downloads

Download data is not yet available.