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

Modified Picard-like Method for Solving Absolute Value Equations

Author

Listed:
  • Yuan Liang

    (School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650504, China)

  • Chaoqian Li

    (School of Mathematics and Statistics, Yunnan University, Kunming 650504, China)

Abstract

We present a modified Picard-like method to solve absolute value equations by equivalently expressing the implicit fixed-point equation form of the absolute value equations as a two-by-two block nonlinear equation. This unifies some existing matrix splitting algorithms and improves the efficiency of the algorithm by introducing the parameter ω . For the choice of ω in the new method, we give a way to determine the quasi-optimal values. Numerical examples are given to show the feasibility of the proposed method. It is also shown that the new method is better than those proposed by Ke and Ma in 2017 and Dehghan and Shirilord in 2020.

Suggested Citation

  • Yuan Liang & Chaoqian Li, 2023. "Modified Picard-like Method for Solving Absolute Value Equations," Mathematics, MDPI, vol. 11(4), pages 1-18, February.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:4:p:848-:d:1060582
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/4/848/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/4/848/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Muhammad Aslam Noor & Javed Iqbal & Khalida Inayat Noor & E. Al-Said, 2012. "Generalized AOR Method for Solving Absolute Complementarity Problems," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-14, April.
    2. J. Y. Bello Cruz & O. P. Ferreira & L. F. Prudente, 2016. "On the global convergence of the inexact semi-smooth Newton method for absolute value equation," Computational Optimization and Applications, Springer, vol. 65(1), pages 93-108, September.
    3. Muhammad Aslam Noor & Javed Iqbal & Eisa Al-Said, 2012. "Residual Iterative Method for Solving Absolute Value Equations," Abstract and Applied Analysis, Hindawi, vol. 2012, pages 1-9, March.
    4. Moosaei, H. & Ketabchi, S. & Noor, M.A. & Iqbal, J. & Hooshyarbakhsh, V., 2015. "Some techniques for solving absolute value equations," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 696-705.
    5. Ke, Yi-Fen & Ma, Chang-Feng, 2017. "SOR-like iteration method for solving absolute value equations," Applied Mathematics and Computation, Elsevier, vol. 311(C), pages 195-202.
    6. 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.
    7. Javed Iqbal & Muhammad Arif, 2013. "Symmetric SOR Method for Absolute Complementarity Problems," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-6, September.
    8. Shi-Liang Wu & Peng Guo, 2016. "On the Unique Solvability of the Absolute Value Equation," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 705-712, May.
    9. An Wang & Yang Cao & Jing-Xian Chen, 2019. "Modified Newton-Type Iteration Methods for Generalized Absolute Value Equations," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 216-230, April.
    10. Saeed Ketabchi & Hossein Moosaei, 2012. "Minimum Norm Solution to the Absolute Value Equation in the Convex Case," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 1080-1087, September.
    11. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lei Shi & Javed Iqbal & Faiqa Riaz & Muhammad Arif, 2023. "Gauss Quadrature Method for System of Absolute Value Equations," Mathematics, MDPI, vol. 11(9), pages 1-8, April.

    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. Hossein Moosaei & Saeed Ketabchi & Milan Hladík, 2021. "Optimal correction of the absolute value equations," Journal of Global Optimization, Springer, vol. 79(3), pages 645-667, March.
    2. An Wang & Yang Cao & Jing-Xian Chen, 2019. "Modified Newton-Type Iteration Methods for Generalized Absolute Value Equations," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 216-230, April.
    3. Yuan Li & Hai-Shan Han & Dan-Dan Yang, 2014. "A Penalized-Equation-Based Generalized Newton Method for Solving Absolute-Value Linear Complementarity Problems," Journal of Mathematics, Hindawi, vol. 2014, pages 1-10, September.
    4. Milan Hladík, 2018. "Bounds for the solutions of absolute value equations," Computational Optimization and Applications, Springer, vol. 69(1), pages 243-266, January.
    5. Ke, Yi-Fen & Ma, Chang-Feng, 2017. "SOR-like iteration method for solving absolute value equations," Applied Mathematics and Computation, Elsevier, vol. 311(C), pages 195-202.
    6. Peng Guo & Javed Iqbal & Syed Muhammad Ghufran & Muhammad Arif & Reem K. Alhefthi & Lei Shi, 2023. "A New Efficient Method for Absolute Value Equations," Mathematics, MDPI, vol. 11(15), pages 1-9, July.
    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. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Other publications TiSEM b8e0c74e-2219-4ab0-99a2-0, Tilburg University, School of Economics and Management.
    9. 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.
    10. 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.
    11. 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).
    12. 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.
    13. 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.
    14. E. Demidenko, 2008. "Criteria for Unconstrained Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 136(3), pages 375-395, March.
    15. 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.
    16. 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.
    17. 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.
    18. 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.
    19. Christoph Böhringer & Thomas F. Rutherford, 2017. "Paris after Trump: An Inconvenient Insight," CESifo Working Paper Series 6531, CESifo.
    20. Songfeng Zheng, 2021. "KLERC: kernel Lagrangian expectile regression calculator," Computational Statistics, Springer, vol. 36(1), pages 283-311, March.

    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:4:p:848-:d:1060582. 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.