IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i8p1842-d1122189.html
   My bibliography  Save this article

An Improved Convergence Condition of the MMS Iteration Method for Horizontal LCP of H + -Matrices

Author

Listed:
  • Cuixia Li

    (School of Mathematics, Yunnan Normal University, Kunming 650500, China)

  • Shiliang Wu

    (School of Mathematics, Yunnan Normal University, Kunming 650500, China)

Abstract

In this paper, inspired by the previous work in (Appl. Math. Comput., 369 (2020) 124890), we focus on the convergence condition of the modulus-based matrix splitting (MMS) iteration method for solving the horizontal linear complementarity problem (HLCP) with H + -matrices. An improved convergence condition of the MMS iteration method is given to improve the range of its applications, in a way which is better than that in the above published article.

Suggested Citation

  • Cuixia Li & Shiliang Wu, 2023. "An Improved Convergence Condition of the MMS Iteration Method for Horizontal LCP of H + -Matrices," Mathematics, MDPI, vol. 11(8), pages 1-6, April.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:8:p:1842-:d:1122189
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/8/1842/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/8/1842/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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).
    2. Yinyu Ye, 1993. "A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 18(2), pages 334-345, May.
    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. 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).
    2. J. Z. Zhang & N. H. Xiu, 1999. "Local Uniqueness of Solutions to the Extended Linear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 103(3), pages 715-726, December.
    3. Joaquim Júdice, 2012. "Algorithms for linear programming with linear complementarity constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 4-25, April.
    4. Mezzadri, Francesco & Galligani, Emanuele, 2020. "On the convergence of modulus-based matrix splitting methods for horizontal linear complementarity problems in hydrodynamic lubrication," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 176(C), pages 226-242.
    5. 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).
    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).

    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:gam:jmathe:v:11:y:2023:i:8:p:1842-:d:1122189. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.