Nonlinear conjugate gradient for smooth convex functions

DOI10.1007/S12532-024-00254-YMaRDI QIDQ6590465zbMATH OpenFDO

Authors Sahar Karimi, Stephen A. Vavasis

Publication date 21 August 2024

Published in Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12532-024-00254-Y

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
• A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
• Conjugate gradient algorithms in nonconvex optimization
• Gradient methods for minimizing composite functions

Cites work

• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• Adaptive restart for accelerated gradient schemes
• Alternative proofs of the convergence properties of the conjugate- gradient method
• An efficient hybrid conjugate gradient method for unconstrained optimization
• Convergence properties of the Beale-Powell restart algorithm
• First-order methods in optimization
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• Rate of Convergence of Several Conjugate Gradient Algorithms
• Restart procedures for the conjugate gradient method
• Robust regression: Asymptotics, conjectures and Monte Carlo
• Solving the Trust-Region Subproblem using the Lanczos Method
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations

Cited in

(2)

• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression
• Iteration complexity of fixed-step methods by Nesterov and Polyak for convex quadratic functions

This page was built for publication: Nonlinear conjugate gradient for smooth convex functions

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