Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (Q5231367)

From MaRDI portal
Revision as of 22:03, 14 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128152620, #quickstatements; #temporary_batch_1723667127323)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 7098256
Language Label Description Also known as
English
Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations
scientific article; zbMATH DE number 7098256

    Statements

    Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations (English)
    0 references
    0 references
    26 August 2019
    0 references
    convex programming
    0 references
    proximal method of multipliers
    0 references
    second-order methods
    0 references
    hybrid extragradient
    0 references
    complexity
    0 references
    0 references
    0 references

    Identifiers