Convergence of diagonally stationary sequences in convex optimization (Q1332534)

From MaRDI portal
Revision as of 08:56, 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
Convergence of diagonally stationary sequences in convex optimization
scientific article

    Statements

    Convergence of diagonally stationary sequences in convex optimization (English)
    0 references
    0 references
    9 April 1995
    0 references
    In convex optimization, many approximation methods generate a ``diagonally stationary sequence'', or more precisely, a sequence \(\{x_ n\}\) in \(X\), for which exists \(x^*_ n \in \partial f^ n(x_ n)\) such that \(\| x^*_ n \|_ * \to 0\) for \(n \to \infty\), where \(X\) is a real normed linear space, \(f\) and \(f^ n\) be extended real- valued proper closed convex functions on \(X\). The paper explores convergence conditions of such sequences, and gives some general convergence results by applying variational convergence theory.
    0 references
    diagonally stationary sequence
    0 references
    convex optimization
    0 references
    normed linear space
    0 references
    convergence
    0 references
    0 references

    Identifiers