A nonlinear conjugate gradient method using inexact first-order information

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
First-order methods of smooth convex optimization with inexact oracle
Lectures on convex optimization
Global convergence result for conjugate gradient methods
An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
Conjugate gradient type methods for the nondifferentiable convex minimization
A frequency-domain analysis of inexact gradient methods
Nonlinear conjugate gradient methods for unconstrained optimization
Optimization theory and methods. Nonlinear programming
A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
Introduction to Derivative-Free Optimization
Global Convergence Properties of Conjugate Gradient Methods for Optimization
Optimization Methods for Large-Scale Machine Learning
A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints
Derivative-free optimization methods
Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
Function minimization by conjugate gradients
A Two-Term PRP-Based Descent Method
The conjugate gradient method in extremal problems
Methods of conjugate gradients for solving linear systems