A cyclic delayed weighted steplength for the gradient method

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents a new adaptive steplength for the gradient method, which exploits the advantages the two steplengths proposed by Barzilai and Borwein. Particularly, the proposed steplength is based on an optimal step size determined by minimizing a merit function constructed as a convex combination of the cost function and its gradient norm. The global convergence and some theoretical properties related to the proposed gradient method are provided. Finally, some computational studies are included to highlight the efficiency and effectiveness of the new approach.

Original languageEnglish
JournalRicerche di Matematica
DOIs
StateAccepted/In press - 2021
Externally publishedYes

Keywords

  • Linear system of equations
  • Quadratic programming
  • Spectral gradient method
  • Steepest descent method

Fingerprint

Dive into the research topics of 'A cyclic delayed weighted steplength for the gradient method'. Together they form a unique fingerprint.

Cite this