Skip to main content
Article thumbnail
Location of Repository

An interior-point and decomposition approach to multiple stage stochastic programming

By S. Zhang

Abstract

There is no abstract of this report

OAI identifier:

Suggested articles

Citations

  1. (1995). A cutting plane method from analytic centers for stochastic programming,
  2. (2001). A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs,
  3. (1995). A new scenario decomposition method for large-scale stochastic optimization,
  4. (1996). A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs,
  5. (2000). A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming,
  6. (1999). A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming,
  7. (1997). A Scalable parallel interior point algorithm for stochastic linear programming and robust optimization,
  8. (1996). A simplified homogeneous self-dual linear programming algorithm and its implementation,
  9. (1994). An extension of the DQA algorithm to convex stochastic programs,
  10. (1994). An O( √ nL)-iteration homogeneous and self-dual linear programming algorithm,
  11. (1998). Building and Solving Largescale Stochastic Programs on an Affordable Distributed Computing System, forthcoming in Annals of Operations Research,
  12. (1988). Computing block-angular Karmarkar projections with applications to stochastic programming,
  13. (1992). Efficient solution of two-stage stochastic linear programs using interior point methods,
  14. (1993). Exploiting special structure in a primaldual path-following algorithm,
  15. (2000). High Performance Computing for Asset Liability Management, forthcoming in Operations Research,
  16. (1997). Introduction to Stochastic Programming,
  17. (1969). L-shaped linear programs with applications to optimal control and stochastic linear programs,
  18. On adaptive-step primal-dual interior-point algorithms for linear programming,
  19. (1993). On quadratic and O( √ nL) convergence of a predictor-corrector algorithm for LCP,
  20. (1994). Parallel factorization of structured matrices arising in stochastic programming,
  21. (1956). Polyhedral convex cones,
  22. (1996). Polynomial cutting plane algorithms for two-stage stochastic linear programs based on ellipsoids, volumetric centers and analytic centers, Working Paper,
  23. (1991). Scenarios and policy aggregation in optimization under uncertainty,
  24. (1994). Stochastic Programming,
  25. (1991). The formulation of stochastic programs for interior point methods,
  26. (1999). The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm,
  27. (1997). Theory and Algorithms for Linear Optimization,
  28. (1998). Using a massively parallel processor to solve large sparse linear programs by an interior-point method,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.