IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v203y2024i1d10.1007_s10957-024-02529-9.html
   My bibliography  Save this article

Scalable Relaxation Two-Sweep Modulus-Based Matrix Splitting Methods for Vertical LCP

Author

Listed:
  • Dongmei Yu

    (Liaoning Technical University)

  • Huiling Wei

    (Liaoning Technical University)

  • Cairong Chen

    (Fujian Normal University)

  • Deren Han

    (Beihang University)

Abstract

Based on a new equivalent reformulation, a scalable modulus-based matrix splitting (SMMS) method is proposed to solve the vertical linear complementarity problem (VLCP). By introducing a relaxation parameter and employing the two-sweep technique, we further enhance the scalability of the method, leading to a framework of the scalable relaxation two-sweep modulus-based matrix splitting (SRTMMS) method. To theoretically demonstrate the acceleration of the convergence provided by the SMMS method, we present a comparison theorem for the case of $$s=2$$ s = 2 . Furthermore, we establish the convergence of the SRTMMS method for arbitrary s. Preliminary numerical results indicate promising performance of the SRTMMS method.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:203:y:2024:i:1:d:10.1007_s10957-024-02529-9
    DOI: 10.1007/s10957-024-02529-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02529-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-024-02529-9?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.

    References listed on IDEAS

    as
    1. Dai, Ping-Fan & Li, Jicheng & Bai, Jianchao & Qiu, Jinming, 2019. "A preconditioned two-step modulus-based matrix splitting iteration method for linear complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 348(C), pages 542-551.
    2. M. Seetharama Gowda & Jong-Shi Pang, 1992. "On Solution Stability of the Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 77-83, February.
    3. 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.
    4. Nagae, Takeshi & Akamatsu, Takashi, 2008. "A generalized complementarity approach to solving real option problems," Journal of Economic Dynamics and Control, Elsevier, vol. 32(6), pages 1754-1779, June.
    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. 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).
    2. Ping-Fan Dai & Shi-Liang Wu, 2022. "The GUS-Property and Modulus-Based Methods for Tensor Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 976-1006, December.
    3. 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.
    4. 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.
    5. Zhang, Li-Li, 2021. "A modulus-based multigrid method for nonlinear complementarity problems with application to free boundary problems with nonlinear source terms," Applied Mathematics and Computation, Elsevier, vol. 399(C).
    6. Ali, Rashid & Akgul, Ali, 2024. "A new matrix splitting generalized iteration method for linear complementarity problems," Applied Mathematics and Computation, Elsevier, vol. 464(C).
    7. Karan N. Chadha & Ankur A. Kulkarni, 2022. "On independent cliques and linear complementarity problems," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(4), pages 1036-1057, December.
    8. Hoang Ngoc Tuan, 2015. "Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 234-245, January.
    9. Xiao Wang & Xinzhen Zhang & Guangming Zhou, 2020. "SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection," Computational Optimization and Applications, Springer, vol. 75(3), pages 739-752, April.
    10. Guo-qiang Wang & Yu-jing Yue & Xin-zhong Cai, 2009. "Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem," Fuzzy Information and Engineering, Springer, vol. 1(4), pages 435-445, December.
    11. van der Laan, Gerard & Talman, Dolf & Yang, Zaifu, 2011. "Solving discrete systems of nonlinear equations," European Journal of Operational Research, Elsevier, vol. 214(3), pages 493-500, November.
    12. Zheng-Hai Huang & Yu-Fan Li & Yong Wang, 2023. "A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors," Journal of Global Optimization, Springer, vol. 86(2), pages 495-520, June.
    13. Christoph Böhringer & Thomas F. Rutherford, 2017. "Paris after Trump: An Inconvenient Insight," CESifo Working Paper Series 6531, CESifo.
    14. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    15. A. K. Das, 2016. "Properties of some matrix classes based on principal pivot transform," Annals of Operations Research, Springer, vol. 243(1), pages 375-382, August.
    16. Meijuan Shang & Chao Zhang & Naihua Xiu, 2014. "Minimal Zero Norm Solutions of Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 795-814, December.
    17. Ali Naef Mohammad, 2016. "Valuation Tools for Determining the Value of Assets: A Literature Review," International Journal of Academic Research in Accounting, Finance and Management Sciences, Human Resource Management Academic Research Society, International Journal of Academic Research in Accounting, Finance and Management Sciences, vol. 6(4), pages 63-72, October.
    18. Massol, Olivier & Rifaat, Omer, 2018. "Phasing out the U.S. Federal Helium Reserve: Policy insights from a world helium model," Resource and Energy Economics, Elsevier, vol. 54(C), pages 186-211.
    19. S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
    20. Thiruvankatachari Parthasarathy & Gomatam Ravindran & Sunil Kumar, 2022. "On Semimonotone Matrices, $$R_0$$ R 0 -Matrices and Q-Matrices," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 131-147, October.

    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:spr:joptap:v:203:y:2024:i:1:d:10.1007_s10957-024-02529-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.