On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6804643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions |
scientific article; zbMATH DE number 6804643 |
Statements
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (English)
0 references
9 November 2017
0 references
gradient method
0 references
steepest descent
0 references
semidefinite programming
0 references
performance estimation problem
0 references
0.834549069404602
0 references
0.8164929747581482
0 references
0.8143249750137329
0 references
0.8128824830055237
0 references
