A cutting plane method from analytic centers for stochastic programming

This publication has 33 references indexed in Scilit:

• Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
  Mathematical Programming, 2004
• Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
  Discrete Applied Mathematics, 1994
• Path-Following Methods for Linear Programming
  SIAM Review, 1992
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems
  Annals of Operations Research, 1990
• A multicut algorithm for two-stage stochastic linear programs
  European Journal of Operational Research, 1988
• A polynomial newton method for linear programming
  Algorithmica, 1986
• Manifestations of the Schur complement
  Linear Algebra and its Applications, 1974
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
  SIAM Journal on Applied Mathematics, 1969
• Partitioning procedures for solving mixed-variables programming problems
  Numerische Mathematik, 1962
• The Decomposition Algorithm for Linear Programs
  Econometrica, 1961