Stochastic approximation algorithm for minimax problems (Q1823151)

From MaRDI portal
Revision as of 08:42, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Stochastic approximation algorithm for minimax problems
scientific article

    Statements

    Stochastic approximation algorithm for minimax problems (English)
    0 references
    0 references
    1990
    0 references
    A stochastic approximation algorithm for minimax optimization problems is analyzed. At each iterate, it performs one random experiment, based on which it computes a direction vector. It is shown that, under suitable conditions, it a.s. converges to the set of points satisfying necessary optimality conditions. The algorithm and its analysis bring together ideas from stochastic approximation and nondifferentiable optimization.
    0 references
    stochastic approximation
    0 references
    minimax optimization
    0 references
    nondifferentiable optimization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references