A globally convergent gradient-like method based on the Armijo line search
From MaRDI portal
Publication:5080090
DOI10.22124/jmm.2021.18854.1612zbMath1499.65220arXiv1904.06321MaRDI QIDQ5080090
Publication date: 31 May 2022
Full work available at URL: https://arxiv.org/abs/1904.06321
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A conjugate gradient method with sufficient descent property
- Efficient generalized conjugate gradient algorithms. I: Theory
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- An improved Perry conjugate gradient method with adaptive parameter choice
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Optimization Methods for Large-Scale Machine Learning
- Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
