A cutting plane method from analytic centers for stochastic programming

Authors:
O. Bahn;O. du Merle;J.-L. Goffin;J.-P. Vial
Affiliations:
-;-;-;-
Venue:
Mathematical Programming: Series A and B
Year:
1995

Citing 0
Cited 7

On Improvements to the Analytic Center Cutting Plane Method

Computational Optimization and Applications
A Polynomial Cutting Surfaces Algorithm for the ConvexFeasibility Problem Defined by Self-Concordant Inequalities

Computational Optimization and Applications
Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems

Computational Optimization and Applications
Decomposition Algorithms for Stochastic Programming on a Computational Grid

Computational Optimization and Applications
A New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods

Journal of Global Optimization
Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse

Operations Research
Specialized fast algorithms for IQC feasibility and optimization problems

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract