Inexact subgradient methods with applications in stochastic programming (Q1315432)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Inexact subgradient methods with applications in stochastic programming
scientific article

    Statements

    Inexact subgradient methods with applications in stochastic programming (English)
    0 references
    0 references
    0 references
    0 references
    10 March 1994
    0 references
    Projected gradient-type methods are considered for minimizing a function \(f\) on a given subset \(X\) of \(\mathbb{R}^ n\), where the negative step direction \(\xi^ k\) is a subgradient of \(f_ k\) with a sequence \((f_ k)\) of objective function approximations. Sufficient conditions are given for the convergence of this algorithm to the set of optimal solutions. Furthermore, based on the approximations \(f_ k\), methods for the adaptive selection of the step sizes \(s_ k\) are given. The method is applied to the solution of two-stage stochastic linear programs.
    0 references
    0 references
    projected gradient-type methods
    0 references
    subgradient
    0 references
    convergence
    0 references
    two-stage stochastic linear programs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers