Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553)

From MaRDI portal
Revision as of 09:54, 17 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references