Stepsizes for the gradient method based on subspace approximations

DOI10.12286/JSSX.J2026-1387MaRDI QIDQ7320109zbMATH OpenFDO

Authors Yaxiang Yuan

Publication date 27 August 2026

Published in Mathematica Numerica Sinica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12286/JSSX.J2026-1387

Mathematics Subject Classification ID

Numerical analysis (65-XX) Nonlinear programming (90C30)

Cites work

• R-linear convergence of the Barzilai and Borwein gradient method
• A limited memory steepest descent method
• A new stepsize for the steepest descent method
• Adaptive cyclic gradient methods with interpolation
• Alternate step gradient method*
• An efficient gradient method using the Yuan steplength
• Analysis of monotone gradient methods
• Cyclic gradient methods for unconstrained optimization
• Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
• scientific article; zbMATH DE number 5726954 (Why is no real title available?)
• New adaptive stepsize selections in gradient methods
• New stepsizes for the gradient method
• On the Barzilai and Borwein choice of steplength for the gradient method
• On the steplength selection in gradient methods for unconstrained optimization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Properties of the delayed weighted gradient method
• The cyclic Barzilai-–Borwein method for unconstrained optimization
• Two-Point Step Size Gradient Methods

This page was built for publication: Stepsizes for the gradient method based on subspace approximations

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