A primal-dual approach to inexact subgradient methods

DOI10.1007/BF02592092zbMath0853.90104MaRDI QIDQ1919096

Kelly T. Au

Publication date: 1 August 1996

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

zbMATH Keywords

computationally demanding objective functionsinexact subgradient methodsprimal-dual information

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Linear programming (90C05) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel processors for planning under uncertainty
• Statistical verification of optimality conditions for stochastic programs with recourse
• Inexact subgradient methods with applications in stochastic programming
• Epi‐consistency of convex stochastic programs
• Approximation methods of solution of stochastic programming problems
• Approximation to Optimization Problems: An Elementary Review
• 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
• Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
• Solution of limiting extremal problems for minimizing functionals
• Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Computation in Discrete Stochastic Programs with Recourse

This page was built for publication: A primal-dual approach to inexact subgradient methods