Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454)

From MaRDI portal
Revision as of 17:57, 19 March 2024 by Maintenance script (talk | contribs) (rollbackEdits.php mass rollback)
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
    0 references
    0 references
    0 references
    14 February 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    smooth optimal method
    0 references
    nonsmooth method
    0 references
    prox-method
    0 references
    0 references
    0 references