Two classes of spectral conjugate gradient methods for unconstrained optimizations

DOI10.1007/s12190-022-01713-2zbMath1499.65218OpenAlexW4212885595MaRDI QIDQ2103158

Pengjie Liu, Chen Zhang, Jin-Bao Jian, Xian-Zhen Jiang

Publication date: 13 December 2022

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-022-01713-2

zbMATH Keywords

unconstrained optimizationglobal convergencespectral conjugate gradient methodstrong Wolfe line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Uses Software

• CUTEr
• SifDec
• minpack
• SCALCG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hybrid conjugate gradient method for unconstrained optimization
• Two modified three-term conjugate gradient methods with sufficient descent property
• A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
• A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
• Hybrid conjugate gradient algorithm for unconstrained optimization
• An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
• Global convergence result for conjugate gradient methods
• Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
• Least-squares-based three-term conjugate gradient methods
• Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
• A spectral conjugate gradient method for solving large-scale unconstrained optimization
• An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
• Two modified DY conjugate gradient methods for unconstrained optimization problems
• Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
• A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A new spectral conjugate gradient method for large-scale unconstrained optimization
• 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
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• CUTEr and SifDec
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: Two classes of spectral conjugate gradient methods for unconstrained optimizations