Inexact subgradient methods with applications in stochastic programming

DOI10.1007/BF01582059zbMath0807.90089OpenAlexW2012437081MaRDI QIDQ1315432

Kelly T. Au, Julia L. Higle, Suvrajeet Sen

Publication date: 10 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582059

zbMATH Keywords

convergencesubgradienttwo-stage stochastic linear programsprojected gradient-type methods

Mathematics Subject Classification ID

Stochastic programming (90C15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

A primal-dual approach to inexact subgradient methods ⋮ An SQP-type method and its application in stochastic programs ⋮ Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms ⋮ Convergence analysis of some methods for minimizing a nonsmooth convex function ⋮ An algorithm for approximating piecewise linear concave functions from sample gradients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistical verification of optimality conditions for stochastic programs with recourse
• Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
• Stochastic approximation methods for constrained and unconstrained systems
• A Linearization Method for Nonsmooth Stochastic Programming Problems
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Epi‐consistency of convex stochastic programs
• Approximation methods of solution of stochastic programming problems
• A class of convergent primal-dual subgradient algorithms for decomposable convex programs
• Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
• A generalization of Polyak's convergence result for subgradient optimization
• Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
• Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
• Solution of limiting extremal problems for minimizing functionals
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
• Optimal step sizes in semi-stochastic approximation procedures. I
• Validation of subgradient optimization
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: Inexact subgradient methods with applications in stochastic programming