Nonlinear conjugate gradient for smooth convex functions

DOI10.1007/s12532-024-00254-yzbMATH Open1545.65244MaRDI QIDQ6590465

Sahar Karimi, Stephen A. Vavasis

Publication date: 21 August 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of the Beale-Powell restart algorithm
• Robust regression: Asymptotics, conjectures and Monte Carlo
• Adaptive restart for accelerated gradient schemes
• Alternative proofs of the convergence properties of the conjugate- gradient method
• Restart procedures for the conjugate gradient method
• First-Order Methods in Optimization
• Solving the Trust-Region Subproblem using the Lanczos Method
• Rate of Convergence of Several Conjugate Gradient Algorithms
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
• 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
• The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
• Methods of conjugate gradients for solving linear systems
• An efficient hybrid conjugate gradient method for unconstrained optimization

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