IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v495y2025ics0096300325000402.html
   My bibliography  Save this article

A modulus-based framework for weighted horizontal linear complementarity problems

Author

Listed:
  • Mezzadri, Francesco

Abstract

We develop a modulus-based framework to solve weighted horizontal linear complementarity problems (WHLCPs). First, we reformulate the WHLCP as a modulus-based system whose solution, in general, is not unique. We characterize the solutions by discussing their sign pattern and how they are linked to one another. After this analysis, we exploit the modulus-based formulation to develop new solution methods. In particular, we present a non-smooth Newton iteration and a matrix splitting method for solving WHLCPs. We prove the local convergence of both methods under some assumptions. Finally, we solve numerical experiments involving symmetric and non-symmetric matrices. In this context, we compare our approaches with a recently proposed smoothing Newton's method. The experiments include problems taken from the literature. We also provide numerical insights on relevant parts of the algorithms, such as convergence, attraction basin, and starting iterate.

Suggested Citation

  • Mezzadri, Francesco, 2025. "A modulus-based framework for weighted horizontal linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 495(C).
    • Handle: RePEc:eee:apmaco:v:495:y:2025:i:c:s0096300325000402
    DOI: 10.1016/j.amc.2025.129313
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325000402
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2025.129313?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Behrouz Kheirfam, 2024. "Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 133-145, July.
    2. Soodabeh Asadi & Zsolt Darvay & Goran Lesaja & Nezam Mahdavi-Amiri & Florian Potra, 2020. "A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 864-878, September.
    3. Xiaoni Chi & M. Seetharama Gowda & Jiyuan Tao, 2019. "The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra," Journal of Global Optimization, Springer, vol. 73(1), pages 153-169, January.
    4. Xia, Zechen & Li, Chenliang, 2015. "Modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 34-42.
    5. Zhang, Yongxiong & Zheng, Hua & Lu, Xiaoping & Vong, Seakweng, 2023. "Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    6. Zheng, Hua & Vong, Seakweng, 2020. "On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of H+-matrices," Applied Mathematics and Computation, Elsevier, vol. 369(C).
    7. Masakazu Kojima & Shinji Mizuno & Toshihito Noma, 1990. "Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 15(4), pages 662-675, November.
    8. Jingyong Tang & Hongchao Zhang, 2021. "A Nonmonotone Smoothing Newton Algorithm for Weighted Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 679-715, June.
    9. Cuiyu Liu & Chenliang Li, 2016. "Synchronous and Asynchronous Multisplitting Iteration Schemes for Solving Mixed Linear Complementarity Problems with H-Matrices," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 169-185, October.
    10. Florian A. Potra, 2016. "Sufficient weighted complementarity problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 467-488, June.
    11. Xiaoni Chi & Guoqiang Wang, 2021. "A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 108-129, July.
    12. Zhang, Jian-Jun, 2015. "The relaxed nonlinear PHSS-like iteration method for absolute value equations," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 266-274.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaoni Chi & Guoqiang Wang & Goran Lesaja, 2024. "Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for $$P_{*}(\kappa )$$ P ∗ ( κ ) -Weighted Linear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 108-132, July.
    2. Jingyong Tang & Jinchuan Zhou & Hongchao Zhang, 2023. "An Accelerated Smoothing Newton Method with Cubic Convergence for Weighted Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 196(2), pages 641-665, February.
    3. Jingyong Tang & Jinchuan Zhou, 2021. "Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem," Computational Optimization and Applications, Springer, vol. 80(1), pages 213-244, September.
    4. Xiaoni Chi & Guoqiang Wang, 2021. "A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 108-129, July.
    5. Behrouz Kheirfam, 2024. "Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 133-145, July.
    6. Zhang, Yongxiong & Zheng, Hua & Vong, Seakweng & Lu, Xiaoping, 2023. "A two-step parallel iteration method for large sparse horizontal linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    7. Jingyong Tang & Jinchuan Zhou & Zhongfeng Sun, 2023. "A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI," Annals of Operations Research, Springer, vol. 321(1), pages 541-564, February.
    8. Zhang, Yongxiong & Zheng, Hua & Lu, Xiaoping & Vong, Seakweng, 2023. "Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 458(C).
    9. Jingyong Tang & Hongchao Zhang, 2021. "A Nonmonotone Smoothing Newton Algorithm for Weighted Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 679-715, June.
    10. Xiaoni Chi & M. Seetharama Gowda & Jiyuan Tao, 2019. "The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra," Journal of Global Optimization, Springer, vol. 73(1), pages 153-169, January.
    11. M. Seetharama Gowda, 2019. "Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras," Journal of Global Optimization, Springer, vol. 74(2), pages 285-295, June.
    12. Baohua Huang & Wen Li, 2023. "A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems," Computational Optimization and Applications, Springer, vol. 86(1), pages 345-381, September.
    13. Zheng, Hua & Vong, Seakweng & Liu, Ling, 2019. "A direct preconditioned modulus-based iteration method for solving nonlinear complementarity problems of H-matrices," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 396-405.
    14. Zheng, Hua & Vong, Seakweng, 2021. "On the modulus-based successive overrelaxation iteration method for horizontal linear complementarity problems arising from hydrodynamic lubrication," Applied Mathematics and Computation, Elsevier, vol. 402(C).
    15. Dongmei Yu & Huiling Wei & Cairong Chen & Deren Han, 2024. "Scalable Relaxation Two-Sweep Modulus-Based Matrix Splitting Methods for Vertical LCP," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 714-744, October.
    16. Cui-Xia Li, 2016. "A Modified Generalized Newton Method for Absolute Value Equations," Journal of Optimization Theory and Applications, Springer, vol. 170(3), pages 1055-1059, September.
    17. Hua Zheng & Ling Liu, 2019. "The Sign-Based Methods for Solving a Class of Nonlinear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 180(2), pages 480-499, February.
    18. Bharat Kumar & Deepmala & A. Dutta & A. K. Das, 2023. "More on matrix splitting modulus-based iterative methods for solving linear complementarity problem," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 1003-1020, June.
    19. Yun-Bin Zhao & Duan Li, 2001. "On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 26(1), pages 119-146, February.
    20. Guo, Wenxiu & Zheng, Hua & Lu, Xiaoping & Zhang, Yongxiong, 2024. "On the two-stage multisplitting iteration methods for linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 475(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:495:y:2025:i:c:s0096300325000402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.