Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei

In Dai and Wen (Numer. Algor. 69 , 337–341 2015 ), some improvements have been presented in the proof of Theorem 2 and Theorem 4 in Andrei (Numer. Algor. 47 , 143–156 2008 ). However, due to incorrect inequalities used, the reasoning proof of Theorem 2.1 in Dai and Wen (Numer. Algor. 69 , 337–341 2015 ) is incorrect. Moreover, the assumption on 0 < c 1 ≤ 𝜃 k < 1 of Theorem 2.1 cannot be deleted in Dai and Wen (Numer. Algor. 69 , 337–341 2015 ). In this paper, the necessary corrections are made. Finally, another version of the proof process of Theorem 3.1 in (Numer. Algor. 69 , 337–341 2015 ) is given. Throughout, we use the same notations and equation numbers as in Dai and Wen (Numer. Algor. 69 , 337–341 2015 ), Andrei (Numer. Algor. 47 , 143–156 2008 ).

[1]  Yu-Hong Dai,et al.  A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search , 2013, SIAM J. Optim..

[2]  Hongwei Liu,et al.  A Self-Adjusting Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition , 2015, J. Optim. Theory Appl..

[3]  Ya-Xiang Yuan,et al.  A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property , 1999, SIAM J. Optim..

[4]  Hiroshi Yabe,et al.  A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization , 2015, Comput. Optim. Appl..

[5]  Lixiang Li,et al.  An Accelerated Three-Term Conjugate Gradient Method with Sufficient Descent Condition and Conjugacy Condition , 2018, J. Optim. Theory Appl..

[6]  William W. Hager,et al.  A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search , 2005, SIAM J. Optim..

[7]  Jiarong Shi,et al.  A Modified Sufficient Descent Polak-Ribiére-Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems , 2018, Algorithms.

[8]  M. Al-Baali.  Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search , 1985 .

[9]  Zhifeng Dai,et al.  Comments on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei , 2014, Numerical Algorithms.

[10]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[11]  Zhifeng Dai,et al.  Two nonparametric approaches to mean absolute deviation portfolio selection model , 2020 .

[12]  Neculai Andrei,et al.  Another hybrid conjugate gradient algorithm for unconstrained optimization , 2008, Numerical Algorithms.

[13]  William W. Hager,et al.  The Limited Memory Conjugate Gradient Method , 2013, SIAM J. Optim..

[14]  Hongwei Liu,et al.  Sufficient descent conjugate gradient methods for large-scale optimization problems , 2011, Int. J. Comput. Math..

[15]  Li Zhang,et al.  Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line search , 2006, Numerische Mathematik.