Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
From MaRDI portal
Publication:2181673
DOI10.1007/s11075-019-00771-1OpenAlexW3149909666WikidataQ127530630 ScholiaQ127530630MaRDI QIDQ2181673
Xiuyun Zheng, Wei Yang, Jiarong Shi, Xiao Liang Dong
Publication date: 19 May 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00771-1
Cites Work
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Two nonparametric approaches to mean absolute deviation portfolio selection model
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Comments on ``Another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
- Sufficient descent conjugate gradient methods for large-scale optimization problems
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- The Limited Memory Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Further comment on another hybrid conjugate gradient algorithm for unconstrained optimization by Andrei
