A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming
- 24 February 2005
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 104 (1) , 153-177
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear ProgrammingOperations Research, 2002
- The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm2000
- A Computational Study of the Homogeneous Algorithm for Large-scale Convex OptimizationComputational Optimization and Applications, 1998
- Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point MethodSIAM Journal on Scientific Computing, 1998
- Parallel decomposition of large-scale stochastic nonlinear programsAnnals of Operations Research, 1996
- An Extension of the DQA Algorithm to Convex Stochastic ProgramsSIAM Journal on Optimization, 1994
- Exploiting special structure in a primal—dual path-following algorithmMathematical Programming, 1993
- Efficient solution of two-stage stochastic linear programs using interior point methodsComputational Optimization and Applications, 1992
- Computing Block-Angular Karmarkar Projections with Applications to Stochastic ProgrammingManagement Science, 1988
- Decomposition and Partitioning Methods for Multistage Stochastic Linear ProgramsOperations Research, 1985