Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SDPLR / rank | |||
Normal rank | |||
Revision as of 00:28, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming |
scientific article |
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
