Improved Fletcher–Reeves and Dai–Yuan conjugate gradient methods with an efficient restart mechanism and their iterative complexity guarantees
- 24 July 2025
- journal article
- research article
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 71 (S2) , 1761-1802
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- An Inertial-type CG Projection Method with Restart for Pseudo-monotone Costs with Application to Traffic AssignmentNetworks and Spatial Economics, 2024
- An Inertial Spectral CG Projection Method Based on the Memoryless BFGS UpdateJournal of Optimization Theory and Applications, 2023
- New Hybrid Conjugate Gradient Method As A Convex Combination of Ls and Fr MethodsActa Mathematica Scientia, 2019
- A Modified Self-Scaling Memoryless Broyden–Fletcher–Goldfarb–Shanno Method for Unconstrained OptimizationJournal of Optimization Theory and Applications, 2014
- A sufficient descent Dai–Yuan type nonlinear conjugate gradient method for unconstrained optimization problemsNonlinear Dynamics, 2012
- A Quadratic Hybridization of Polak–Ribière–Polyak and Fletcher–Reeves Conjugate Gradient MethodsJournal of Optimization Theory and Applications, 2012
- Minimization of an Edge-Preserving Regularization Functional by Conjugate Gradient Type Methods2007
- Global convergence of a modified Fletcher–Reeves conjugate gradient method with Armijo-type line searchNumerische Mathematik, 2006
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Restart procedures for the conjugate gradient methodMathematical Programming, 1977