Handling nonpositive curvature in a limited memory steepest descent method
From MaRDI portal
(Redirected from Publication:4684979)
Recommendations
- R-linear convergence of limited memory steepest descent
- A limited memory steepest descent method
- A modified limited memory steepest descent method motivated by an inexact super-linear convergence rate analysis
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- Global convergence of a modified limited memory BFGS method for non-convex minimization
Cited in
(9)- Hybrid limited memory gradient projection methods for box-constrained optimization problems
- Ritz-like values in steplength selections for stochastic gradient methods
- Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces
- Structured two-point stepsize gradient methods for nonlinear least squares
- R-linear convergence of limited memory steepest descent
- A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Delayed gradient methods for symmetric and positive definite linear systems
- Limited memory gradient methods for unconstrained optimization
This page was built for publication: Handling nonpositive curvature in a limited memory steepest descent method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4684979)
