On the worst case performance of the steepest descent algorithm for quadratic functions
type: Item
instance of: scholarly article
title: On the worst case performance of the steepest descent algorithm for quadratic functions
zbMATH Open document ID: 1349.90763
author: C. C. Gonzaga
published in: Mathematical Programming. Series A. Series B
publication date: 2016-11-25T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6656099
MaRDI profile type: Publication
full work available at URL: s10107-016-0984-8
OpenAlex ID: W2283311117
cites work: On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
cites work: Two-Point Step Size Gradient Methods
cites work: Alternate step gradient method*
cites work: An efficient gradient method using the Yuan steplength
cites work: On spectral properties of steepest descent methods
cites work: On the asymptotic directions of the s-dimensional optimum gradient method
cites work: Solution of Linear Systems by Richardson's Method
cites work: On the steepest descent algorithm for quadratic functions
cites work: Q4791752
cites work: Q3967358
cites work: On the behavior of the gradient norm in the steepest descent method
cites work: Q3491338
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: Relaxed steepest descent and Cauchy-Barzilai-Borwein method
DOI: 10.1007/S10107-016-0984-8
description: scientific article; zbMATH DE number 6656099