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 search for a different version of it.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.