Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1409.1462 / rank | |||
Normal rank | |||
Revision as of 08:37, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Iteration complexity analysis of dual first-order methods for conic convex programming |
scientific article |
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
