Global convergence of a spectral conjugate gradient method for unconstrained optimization
Author:
- 24 February 2025
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 101 (2) , 1049-1072
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of Shandong Province (ZR2022QA016)
This publication has 27 references indexed in Scilit:
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restorationJournal of Applied Mathematics and Computing, 2024
- Some improved Dai–Yuan conjugate gradient methods for large-scale unconstrained optimization problemsJournal of Applied Mathematics and Computing, 2023
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functionsNumerical Algorithms, 2022
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functionsNumerical Algorithms, 2019
- New Hybrid Conjugate Gradient and Broyden–Fletcher–Goldfarb–Shanno Conjugate Gradient MethodsJournal of Optimization Theory and Applications, 2018
- A sufficient descent Dai–Yuan type nonlinear conjugate gradient method for unconstrained optimization problemsNonlinear Dynamics, 2012
- Conjugate gradient methods using value of objective function for unconstrained optimizationOptimization Letters, 2011
- Two modified Dai-Yuan nonlinear conjugate gradient methodsNumerical Algorithms, 2008
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Efficient generalized conjugate gradient algorithms, part 1: TheoryJournal of Optimization Theory and Applications, 1991