A modified limited memory steepest descent method motivated by an inexact super-linear convergence rate analysis

DOI10.1093/IMANUM/DRZ059zbMATH Open1460.65078OpenAlexW3016810085WikidataQ126433677 ScholiaQ126433677MaRDI QIDQ4964085FDOQ4964085

Authors: Ran Gu, Qiang Du 

Publication date: 24 February 2021

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

Full work available at URL: https://doi.org/10.1093/imanum/drz059

Recommendations

• \(R\)-linear convergence of limited memory steepest descent
• A limited memory steepest descent method
• A new stepsize for the steepest descent method
• Step-sizes for the gradient method
• A novel of step size selection procedures for steepest descent method

zbMATH Keywords

Barzilai-Borwein methodgradient descentR-linear convergencelimited memory method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)

Cited In (4)

• A limited memory steepest descent method
• Cyclic gradient methods for unconstrained optimization
• Handling nonpositive curvature in a limited memory steepest descent method
• \(R\)-linear convergence of limited memory steepest descent

This page was built for publication: A modified limited memory steepest descent method motivated by an inexact super-linear convergence rate analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4964085)