IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2014y2014i1n519017.html

A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem

Author

Listed:
  • Cuiyu Liu
  • Chen-liang Li

Abstract

The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the classical iterative methods to solve linear systems. In this paper, we extend this preconditioner to solve linear complementarity problems whose coefficient matrix is M‐matrix or H‐matrix and present a multisplitting and Schwarz method. The convergence theorems are given. The numerical experiments show that the methods are efficient.

Suggested Citation

  • Cuiyu Liu & Chen-liang Li, 2014. "A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
  • Handle: RePEc:wly:jnljam:v:2014:y:2014:i:1:n:519017
    DOI: 10.1155/2014/519017
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/519017
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/519017?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    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. Bhaskar Ray Chaudhury & Jugal Garg & Peter McGlaughlin & Ruta Mehta, 2023. "A Complementary Pivot Algorithm for Competitive Allocation of a Mixed Manna," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1630-1656, August.
    2. 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.
    3. 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.
    4. Parthasarathy T & Ravindran G & Sunil Kumar, 2025. "On Q-tensors," Journal of Optimization Theory and Applications, Springer, vol. 207(2), pages 1-13, November.
    5. 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.
    6. 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).
    7. 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.
    8. E. Demidenko, 2008. "Criteria for Unconstrained Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 375-395, March.
    9. R. B. Bapat & S. K. Neogy, 2016. "On a quadratic programming problem involving distances in trees," Annals of Operations Research, Springer, vol. 243(1), pages 365-373, August.
    10. 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.
    11. 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.
    12. G. Isac & S. Z. Németh, 2008. "REFE-Acceptable Mappings: Necessary and Sufficient Condition for the Nonexistence of a Regular Exceptional Family of Elements," Journal of Optimization Theory and Applications, Springer, vol. 137(3), pages 507-520, June.
    13. Dan Wang & Jicheng Li, 2025. "The Existence and Uniqueness of Solution of the Vertical Tensor Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 206(3), pages 1-23, September.
    14. Songfeng Zheng, 2021. "KLERC: kernel Lagrangian expectile regression calculator," Computational Statistics, Springer, vol. 36(1), pages 283-311, March.
    15. S A Gabriel & Y Shim & A J Conejo & S de la Torre & R García-Bertrand, 2010. "A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1404-1419, September.
    16. 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.
    17. 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.
    18. Jugal Garg & Martin Hoefer & Kurt Mehlhorn, 2024. "Satiation in Fisher Markets and Approximation of Nash Social Welfare," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 1109-1139, May.
    19. Xi-Ming Fang & Zhi-Jun Qiao & Heng-Jun Zhao, 2019. "The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M‐Matrix," Advances in Mathematical Physics, John Wiley & Sons, vol. 2019(1).
    20. C. Zhang & Q. J. Wei, 2009. "Global and Finite Convergence of a Generalized Newton Method for Absolute Value Equations," Journal of Optimization Theory and Applications, Springer, vol. 143(2), pages 391-403, November.

    More about this item

    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:wly:jnljam:v:2014:y:2014:i:1:n:519017. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.