IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v180y2019i3d10.1007_s10957-018-1393-3.html
   My bibliography  Save this article

An Efficient Barzilai–Borwein Conjugate Gradient Method for Unconstrained Optimization

Author

Listed:
  • Hongwei Liu

    (Xidian University)

  • Zexian Liu

    (Xidian University
    Hezhou University)

Abstract

The Barzilai–Borwein conjugate gradient methods, which were first proposed by Dai and Kou (Sci China Math 59(8):1511–1524, 2016), are very interesting and very efficient for strictly convex quadratic minimization. In this paper, we present an efficient Barzilai–Borwein conjugate gradient method for unconstrained optimization. Motivated by the Barzilai–Borwein method and the linear conjugate gradient method, we derive a new search direction satisfying the sufficient descent condition based on a quadratic model in a two-dimensional subspace, and design a new strategy for the choice of initial stepsize. A generalized Wolfe line search is also proposed, which is nonmonotone and can avoid a numerical drawback of the original Wolfe line search. Under mild conditions, we establish the global convergence and the R-linear convergence of the proposed method. In particular, we also analyze the convergence for convex functions. Numerical results show that, for the CUTEr library and the test problem collection given by Andrei, the proposed method is superior to two famous conjugate gradient methods, which were proposed by Dai and Kou (SIAM J Optim 23(1):296–320, 2013) and Hager and Zhang (SIAM J Optim 16(1):170–192, 2005), respectively.

Suggested Citation

  • Hongwei Liu & Zexian Liu, 2019. "An Efficient Barzilai–Borwein Conjugate Gradient Method for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 879-906, March.
    • Handle: RePEc:spr:joptap:v:180:y:2019:i:3:d:10.1007_s10957-018-1393-3
    DOI: 10.1007/s10957-018-1393-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1393-3
    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-018-1393-3?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. Neculai Andrei, 2013. "Another Conjugate Gradient Algorithm with Guaranteed Descent and Conjugacy Conditions for Large-scale Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 159-182, October.
    2. 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.
    3. Fahimeh Biglari & Maghsud Solimanpur, 2013. "Scaling on the Spectral Gradient Method," Journal of Optimization Theory and Applications, Springer, vol. 158(2), pages 626-635, August.
    4. XiaoLiang Dong & Hongwei Liu & Yubo He, 2015. "A Self-Adjusting Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 225-241, April.
    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. Zhu, Zhibin & Zhang, Dongdong & Wang, Shuo, 2020. "Two modified DY conjugate gradient methods for unconstrained optimization problems," Applied Mathematics and Computation, Elsevier, vol. 373(C).
    2. Zhang, Zemian & Chen, Xuesong, 2021. "A conjugate gradient method for distributed optimal control problems with nonhomogeneous Helmholtz equation," Applied Mathematics and Computation, Elsevier, vol. 402(C).

    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. 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.
    2. Zhifeng Dai, 2017. "Comments on Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 286-291, October.
    3. 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.
    4. XiaoLiang Dong & Hongwei Liu & Yubo He, 2015. "A Self-Adjusting Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 225-241, April.
    5. Branislav Ivanov & Gradimir V. Milovanović & Predrag S. Stanimirović, 2023. "Accelerated Dai-Liao projection method for solving systems of monotone nonlinear equations with application to image deblurring," Journal of Global Optimization, Springer, vol. 85(2), pages 377-420, February.
    6. Hassan Mohammad & Mohammed Yusuf Waziri, 2019. "Structured Two-Point Stepsize Gradient Methods for Nonlinear Least Squares," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 298-317, April.
    7. 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.
    8. Zohre Aminifard & Saman Babaie-Kafaki, 2019. "An optimal parameter choice for the Dai–Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix," 4OR, Springer, vol. 17(3), pages 317-330, September.
    9. Xiaoyu Wu & Hu Shao & Pengjie Liu & Yue Zhuo, 2023. "An Inertial Spectral CG Projection Method Based on the Memoryless BFGS Update," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1130-1155, September.
    10. Jose Giovany Babativa-Márquez & José Luis Vicente-Villardón, 2021. "Logistic Biplot by Conjugate Gradient Algorithms and Iterated SVD," Mathematics, MDPI, vol. 9(16), pages 1-19, August.
    11. Zexian Liu & Hongwei Liu, 2019. "An Efficient Gradient Method with Approximately Optimal Stepsize Based on Tensor Model for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 608-633, May.
    12. Yu, Caiyang & Cai, Zhennao & Ye, Xiaojia & Wang, Mingjing & Zhao, Xuehua & Liang, Guoxi & Chen, Huiling & Li, Chengye, 2020. "Quantum-like mutation-induced dragonfly-inspired optimization approach," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 178(C), pages 259-289.
    13. Gao, Peiting & He, Chuanjiang & Liu, Yang, 2019. "An adaptive family of projection methods for constrained monotone nonlinear equations with applications," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 1-16.
    14. Saman Babaie-Kafaki & Reza Ghanbari, 2017. "A class of adaptive Dai–Liao conjugate gradient methods based on the scaled memoryless BFGS update," 4OR, Springer, vol. 15(1), pages 85-92, 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:spr:joptap:v:180:y:2019:i:3:d:10.1007_s10957-018-1393-3. 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.