Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-008-0261-6 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042860556 / rank | |||
Revision as of 16:57, 19 March 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
