A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move (Q3519421)

From MaRDI portal
Revision as of 16:44, 11 October 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
A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
scientific article

    Statements

    A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2008
    0 references
    alternating minimization
    0 references
    alternating projection
    0 references
    proximal algorithms
    0 references
    costs to change
    0 references
    inertia
    0 references
    anchoring effect
    0 references
    dynamical game theory
    0 references
    Nash equilibria
    0 references
    steepest descent
    0 references
    dissipative dynamical systems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references