Handling nonpositive curvature in a limited memory steepest descent method

DOI10.1093/imanum/drv034zbMath1433.90123OpenAlexW2182853125MaRDI QIDQ4684979

Wei Guo, Frank E. Curtis

Publication date: 26 September 2018

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/041606bbb3c1cbcc0a43bbab4cb4d5bf6acb3db1

zbMATH Keywords

unconstrained optimizationnonconvex optimizationsteepest descent methodslimited memory methodsBarzilai-Borwein methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)

Related Items (7)

Ritz-like values in steplength selections for stochastic gradient methods ⋮ Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ Analysis of the Barzilai-Borwein step-sizes for problems in Hilbert spaces ⋮ Structured two-point stepsize gradient methods for nonlinear least squares ⋮ 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 ⋮ Hybrid limited memory gradient projection methods for box-constrained optimization problems

This page was built for publication: Handling nonpositive curvature in a limited memory steepest descent method