On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59512949, #quickstatements; #temporary_batch_1727091737240 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11590-016-1087-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11590-016-1087-4 / rank | |||
Normal rank | |||
Latest revision as of 03:01, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions |
scientific article |
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
