Conditions for linear convergence of the gradient method for non-convex optimization (Q6097482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Conditions for linear convergence of the gradient method for non-convex optimization |
scientific article; zbMATH DE number 7692817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conditions for linear convergence of the gradient method for non-convex optimization |
scientific article; zbMATH DE number 7692817 |
Statements
Conditions for linear convergence of the gradient method for non-convex optimization (English)
0 references
5 June 2023
0 references
weakly convex optimization
0 references
gradient method
0 references
performance estimation problem
0 references
Polyak-Łojasiewicz inequality
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0.8045891523361206
0 references
0.7943665385246277
0 references
0.7907184958457947
0 references
0.785532534122467
0 references
0.7768533229827881
0 references
