Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Rockafellar, R. Wets (1991)
Scenarios and Policy Aggregation in Optimization Under UncertaintyMath. Oper. Res., 16
F. Louveaux (1980)
A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment ProblemOper. Res., 28
D. Gade, Gabriel Hackebeil, S. Ryan, J. Watson, R. Wets, D. Woodruff (2016)
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programsMathematical Programming, 157
Jens Lang (2007)
Konrad-Zuse-Zentrum für Informationstechnik Berlin
Lewis Ntaimo, S. Sen (2005)
The Million-Variable “March” for Stochastic Combinatorial OptimizationJournal of Global Optimization, 32
R. Hemmecke, R. Schultz (2003)
Decomposition of test sets in stochastic integer programmingMathematical Programming, 94
Minjiao Zhang, Simge Küçükyavuz (2014)
Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer ProgramsSIAM J. Optim., 24
A. Løkketangen, D. Woodruff (1996)
Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programmingJournal of Heuristics, 2
(1985)
Variable splitting: a new Lagrangean relaxation approach to some mathematical programming models
(1993)
The integer L-shapedmethod for stochastic integer programswith complete recourse
S. Sen, H. Sherali (2006)
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programmingMathematical Programming, 106
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, Jonathan Eckstein (2011)
Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFound. Trends Mach. Learn., 3
S. Ryan, R. Wets, D. Woodruff, Cesar Silva-Monroy, J. Watson (2013)
Toward scalable, parallel progressive hedging for stochastic unit commitment2013 IEEE Power & Energy Society General Meeting
Jason Barnett, J. Watson, D. Woodruff (2017)
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programsOper. Res. Lett., 45
L. Escudero, A. Garín, María Merino, G. Pérez (2009)
BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0–1 problemsTOP, 17
G. Guo, Gabriel Hackebeil, S. Ryan, J. Watson, D. Woodruff (2015)
Integration of progressive hedging and dual decomposition in stochastic integer programsOper. Res. Lett., 43
A. Ruszczynski (2002)
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedraMathematical Programming, 93
J. Mulvey, H. Vladimirou (1991)
Applying the progressive hedging algorithm to stochastic generalized networksAnnals of Operations Research, 31
D. Gade, Simge Küçükyavuz, S. Sen (2012)
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programsMathematical Programming, 144
(2015)
SIPLIB: a stochastic integer programming test problem library
R. Slyke, R. Wets (1969)
L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING.Siam Journal on Applied Mathematics, 17
M. Goemans (1997)
Semidefinite programming in combinatorial optimizationMathematical Programming, 79
J. Higle, S. Sen (2006)
Multistage stochastic convex programs: Duality and its implicationsAnnals of Operations Research, 142
R. Rockafellar (1976)
Monotone Operators and the Proximal Point AlgorithmSiam Journal on Control and Optimization, 14
Yunwei Qi, S. Sen (2017)
The Ancestral Benders’ cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programmingMathematical Programming, 161
N. Boland, J. Christiansen, B. Dandurand, Andrew Eberhard, Jeff Linderoth, James Luedtke, Fabricio Oliveira (2017)
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer ProgrammingSIAM J. Optim., 28
Claus Carøe, J. Tind (1998)
L-shaped decomposition of two-stage stochastic programs with integer recourseMathematical Programming, 83
Shabbir Ahmed (2013)
A scenario decomposition algorithm for 0-1 stochastic programsOper. Res. Lett., 41
J. Birge (1985)
Decomposition and Partitioning Methods for Multistage Stochastic Linear ProgramsOper. Res., 33
(2016)
RajanD (2016)Optimization driven scenario grouping
Miles Lubin, Kipp Martin, C. Petra, B. Sandikçi (2012)
On Parallelizing Dual Decomposition in Stochastic Integer ProgrammingEconometrics: Econometric & Statistical Methods - General eJournal
S. Sen, J. Higle (2005)
The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set ConvexificationMathematical Programming, 104
N. Boland, Andrew Eberhard (2015)
On the augmented Lagrangian dual for integer programmingMathematical Programming, 150
M. Guignard, Siwhan Kim (1987)
Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 39
M. Feizollahi, Shabbir Ahmed, A. Sun (2017)
Exact augmented Lagrangian duality for mixed integer linear programmingMathematical Programming, 161
Adela Pagès-Bernaus, Gerardo Pérez-Valdés, A. Tomasgard (2015)
A parallelised distributed implementation of a Branch and Fix Coordination algorithmEur. J. Oper. Res., 244
J. Watson, D. Woodruff (2011)
Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problemsComputational Management Science, 8
J. Mulvey, A. Ruszczynski (1995)
A New Scenario Decomposition Method for Large-Scale Stochastic OptimizationOper. Res., 43
R. Horst, T. Hoang (1992)
Global Optimization: Deterministic Approaches
R. Bixby (2002)
Solving Real-World Linear Programs: A Decade and More of ProgressOper. Res., 50
Andrew Trapp, O. Prokopyev, A. Schaefer (2013)
On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic ProgrammingOper. Res., 61
G. Lulli, S. Sen (2004)
A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing ProblemsManag. Sci., 50
Claus Carøe, R. Schultz (1999)
Dual decomposition in stochastic integer programmingOper. Res. Lett., 24
Gustavo Angulo, Shabbir Ahmed, Santanu Dey (2016)
Improving the Integer L-Shaped MethodINFORMS J. Comput., 28
A. Hassanzadeh, T. Ralphs (2014)
A Generalization of Benders’ Algorithm for Two-Stage Stochastic Optimization Problems With Mixed Integer Recourse
Progressive Hedging (PH) is a well-known algorithm for solving multi-stage stochastic convex optimization problems. Most previous extensions of PH for mixed-integer stochastic programs have been implemented without convergence guarantees. In this paper, we present a new framework that shows how PH can be utilized while guaranteeing convergence to globally optimal solutions of mixed-integer stochastic convex programs. We demonstrate the effectiveness of the proposed framework through computational experiments.
Computational Management Science – Springer Journals
Published: Jun 5, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.