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

A Modified Self-Adaptive Conjugate Gradient Method for Solving Convex Constrained Monotone Nonlinear Equations for Signal Recovery Problems

Author

Listed:
  • Auwal Bala Abubakar

    (KMUTTFixed Point Research Laboratory, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand
    Department of Mathematical Sciences, Faculty of Physical Sciences, Bayero University, Kano 700241, Nigeria)

  • Poom Kumam

    (KMUTTFixed Point Research Laboratory, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand
    Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan
    Center of Excellence in Theoretical and Computational Science (TaCS-CoE), Science Laboratory Building, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand)

  • Aliyu Muhammed Awwal

    (KMUTTFixed Point Research Laboratory, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi (KMUTT), 126 Pracha-Uthit Road, Bang Mod, Thrung Khru, Bangkok 10140, Thailand
    Department of Mathematics, Faculty of Science, Gombe State University, Gombe 760214, Nigeria)

  • Phatiphat Thounthong

    (Renewable Energy Research Centre, Department of Teacher Training in Electrical Engineering, Faculty of Technical Education, King Mongkut’s University of Technology North Bangkok, 1518 Pracharat 1 Road, Bangsue, Bangkok 10800, Thailand)

Abstract

In this article, we propose a modified self-adaptive conjugate gradient algorithm for handling nonlinear monotone equations with the constraints being convex. Under some nice conditions, the global convergence of the method was established. Numerical examples reported show that the method is promising and efficient for solving monotone nonlinear equations. In addition, we applied the proposed algorithm to solve sparse signal reconstruction problems.

Suggested Citation

  • Auwal Bala Abubakar & Poom Kumam & Aliyu Muhammed Awwal & Phatiphat Thounthong, 2019. "A Modified Self-Adaptive Conjugate Gradient Method for Solving Convex Constrained Monotone Nonlinear Equations for Signal Recovery Problems," Mathematics, MDPI, vol. 7(8), pages 1-24, August.
  • Handle: RePEc:gam:jmathe:v:7:y:2019:i:8:p:693-:d:253969
    as

    Download full text from publisher

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

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

    References listed on IDEAS

    as
    1. Kaori Sugiki & Yasushi Narushima & Hiroshi Yabe, 2012. "Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 733-757, June.
    2. Chuanwei Wang & Yiju Wang & Chuanliang Xu, 2007. "A projection method for a system of nonlinear monotone equations with convex constraints," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 33-46, August.
    3. Mehiddin Al-Baali & Yasushi Narushima & Hiroshi Yabe, 2015. "A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 60(1), pages 89-110, January.
    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. Aliyu Yusuf & Nibron Haggai Manjak & Maggie Aphane, 2024. "A Modified Three-Term Conjugate Descent Derivative-Free Method for Constrained Nonlinear Monotone Equations and Signal Reconstruction Problems," Mathematics, MDPI, vol. 12(11), pages 1-21, May.

    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. Yasushi Narushima & Shummin Nakayama & Masashi Takemura & Hiroshi Yabe, 2023. "Memoryless Quasi-Newton Methods Based on the Spectral-Scaling Broyden Family for Riemannian Optimization," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 639-664, May.
    2. XiaoLiang Dong & Deren Han & Zhifeng Dai & Lixiang Li & Jianguang Zhu, 2018. "An Accelerated Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 944-961, December.
    3. Bakhtawar Baluch & Zabidin Salleh & Ahmad Alhawarat & U. A. M. Roslan, 2017. "A New Modified Three-Term Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence," Journal of Mathematics, Hindawi, vol. 2017, pages 1-12, September.
    4. Babaie-Kafaki, Saman & Ghanbari, Reza, 2014. "The Dai–Liao nonlinear conjugate gradient method with optimal parameter choices," European Journal of Operational Research, Elsevier, vol. 234(3), pages 625-630.
    5. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    6. Qi Tian & Xiaoliang Wang & Liping Pang & Mingkun Zhang & Fanyun Meng, 2021. "A New Hybrid Three-Term Conjugate Gradient Algorithm for Large-Scale Unconstrained Problems," Mathematics, MDPI, vol. 9(12), pages 1-13, June.
    7. Mina Torabi & Mohammad-Mehdi Hosseini, 2018. "A New Descent Algorithm Using the Three-Step Discretization Method for Solving Unconstrained Optimization Problems," Mathematics, MDPI, vol. 6(4), pages 1-18, April.
    8. Mehiddin Al-Baali & Yasushi Narushima & Hiroshi Yabe, 2015. "A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization," Computational Optimization and Applications, Springer, vol. 60(1), pages 89-110, January.
    9. Saman Babaie-Kafaki & Reza Ghanbari, 2016. "Descent Symmetrization of the Dai–Liao Conjugate Gradient Method," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(02), pages 1-10, April.
    10. Dong, Xiao Liang & Liu, Hong Wei & He, Yu Bo, 2015. "New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 606-617.
    11. Gonglin Yuan & Xiaoliang Wang & Zhou Sheng, 2020. "The Projection Technique for Two Open Problems of Unconstrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 590-619, August.
    12. Gonglin Yuan & Zehong Meng & Yong Li, 2016. "A Modified Hestenes and Stiefel Conjugate Gradient Algorithm for Large-Scale Nonsmooth Minimizations and Nonlinear Equations," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 129-152, January.
    13. Najib Ullah & Abdullah Shah & Jamilu Sabi’u & Xiangmin Jiao & Aliyu Muhammed Awwal & Nuttapol Pakkaranang & Said Karim Shah & Bancha Panyanak, 2023. "A One-Parameter Memoryless DFP Algorithm for Solving System of Monotone Nonlinear Equations with Application in Image Processing," Mathematics, MDPI, vol. 11(5), pages 1-26, March.
    14. Halilu, Abubakar Sani & Majumder, Arunava & Waziri, Mohammed Yusuf & Ahmed, Kabiru, 2021. "Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 187(C), pages 520-539.

    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:7:y:2019:i:8:p:693-:d:253969. 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.