A class of improved conjugate gradient methods for nonconvex unconstrained optimization

DOI10.1002/NLA.2482MaRDI QIDQ6133054zbMATH OpenOpenAlexFDO

Authors Qingjie Hu, Hongrun Zhang, Yu Chen

Publication date 17 August 2023

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2482

zbMATH Keywords

Armijo line searchglobal convergencenonconvex unconstrained optimizationsufficient descent conditionWolfe line search

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

Cited in

(8)

• An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
• An efficient hybrid conjugate gradient method with an adaptive strategy and applications in image restoration problems
• Hybrid Hu-Storey type methods for large-scale nonlinear monotone systems and signal recovery
• A conjugate gradient algorithmic framework for unconstrained optimization with applications: convergence and rate analyses
• An inertial three-term derivative-free projection algorithm for nonlinear equations without pseudo-monotonicity
• An improved Dai-Liao-style hybrid conjugate gradient-based method for solving unconstrained nonconvex optimization and extension to constrained nonlinear monotone equations
• An accelerated spectral CG based algorithm for optimization techniques on Riemannian manifolds and its comparative evaluation
• Complexity guarantees of a class of three-term conjugate gradient algorithms for large-scale non-convex problems and applications

This page was built for publication: A class of improved conjugate gradient methods for nonconvex unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133054)