Fast primal-dual gradient method for strongly convex minimization problems with linear constraints (Q3133230)
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: Fast primal-dual gradient method for strongly convex minimization problems with linear constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast primal-dual gradient method for strongly convex minimization problems with linear constraints |
scientific article |
Statements
Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints (English)
0 references
13 February 2018
0 references
convex optimization
0 references
algorithm complexity
0 references
entropy-linear programming
0 references
dual problem
0 references
primal-dual method
0 references
0.832105278968811
0 references
0.8184472322463989
0 references
0.8039959669113159
0 references
0.790875256061554
0 references
