Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553)
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: Iteration complexity analysis of dual first-order methods for conic convex programming |
scientific article; zbMATH DE number 6599541
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iteration complexity analysis of dual first-order methods for conic convex programming |
scientific article; zbMATH DE number 6599541 |
Statements
Iteration complexity analysis of dual first-order methods for conic convex programming (English)
0 references
29 June 2016
0 references
conic convex problem
0 references
smooth dual function
0 references
dual first-order methods
0 references
aproximate primal feasible and suboptimal solution
0 references
rate of convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9329621
0 references
0.93143225
0 references
0.92373854
0 references
0.91568995
0 references
0.91205186
0 references
0.9088007
0 references
0.9028071
0 references
