Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454)
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: Primal-dual first-order methods with O(1/) iteration-complexity for cone programming |
scientific article; zbMATH DE number 5851503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming |
scientific article; zbMATH DE number 5851503 |
Statements
Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (English)
0 references
14 February 2011
0 references
smooth optimal method
0 references
nonsmooth method
0 references
prox-method
0 references
0 references
0.9023048281669616
0 references
0.800581693649292
0 references
0.7936574816703796
0 references
0.7875348925590515
0 references
0.785331666469574
0 references
