A sufficient descent HS conjugate gradient method and its global convergence for unconstrained optimization
Chunling Xu, Zhongbo Sun
Abstract
Chunling Xu, Zhongbo Sun
Abstract
In this paper, a modified descent HS conjugate gradient method is proposed for solving unconstrained optimization problems and a new sufficient descent direction is proposed. Under some suitable conditions, theoretical analysis shows that the algorithm is global convergence. Numerical results show that this method is effective in unconstrained minimizing optimization problems.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a modified descent HS conjugate gradient method is proposed for solving unconstrained optimization problems and a new sufficient descent direction is proposed. Under some suitable conditions, theoretical analysis shows that the algorithm is global convergence. Numerical results show that this method is effective in unconstrained minimizing optimization problems.
Key concepts: Conjugate gradient method, Convergence (economics), Descent (aeronautics), Nonlinear conjugate gradient method, Gradient descent, Gradient method, Mathematical optimization, Derivation of the conjugate gradient method