Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support

[1]  Welington de Oliveira,et al.  Regularized optimization methods for convex MINLP problems , 2016 .

[2]  Jérôme Malick,et al.  Decomposition algorithm for large-scale two-stage unit-commitment , 2016, Ann. Oper. Res..

[3]  Elisabeth Köbis,et al.  On Robust Optimization , 2015, J. Optim. Theory Appl..

[4]  Leena Suhl,et al.  Risk-Averse Optimization in Two-Stage Stochastic Models: Computational Aspects and a Study , 2015, SIAM J. Optim..

[5]  Claude Lemaréchal,et al.  Convex proximal bundle methods in depth: a unified analysis for inexact oracles , 2014, Math. Program..

[6]  Leena Suhl,et al.  Applying oracles of on-demand accuracy in two-stage stochastic programming - A computational study , 2014, Eur. J. Oper. Res..

[7]  Claudia A. Sagastizábal,et al.  Level bundle methods for oracles with on-demand accuracy , 2014, Optim. Methods Softw..

[8]  René Henrion,et al.  Gradient Formulae for Nonlinear Probabilistic Constraints with Gaussian and Gaussian-Like Distributions , 2014, SIAM J. Optim..

[9]  Xiao Liu,et al.  Decomposition algorithms for two-stage chance-constrained programs , 2014, Mathematical Programming.

[10]  Ignacio E. Grossmann,et al.  Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain , 2014, Comput. Oper. Res..

[11]  Thomas A. Henzinger,et al.  Probabilistic programming , 2014, FOSE.

[12]  Claudia A. Sagastizábal,et al.  Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems , 2014, SIAM J. Optim..

[13]  Wim van Ackooij,et al.  Level bundle methods for constrained convex optimization with various oracles , 2014 .

[14]  Antonio Frangioni,et al.  Large-scale Unit Commitment under uncertainty , 2014, 4OR.

[15]  Alexandra M. Newman,et al.  The unit commitment model with concave emissions costs: a hybrid Benders’ Decomposition with nonconvex master problems , 2013, Ann. Oper. Res..

[16]  Hanif D. Sherali,et al.  On generating maximal nondominated Benders cuts , 2013, Ann. Oper. Res..

[17]  R. Henrion,et al.  Joint chance constrained programming for hydro reservoir management , 2013 .

[18]  James R. Luedtke.  A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support , 2013, Mathematical Programming.

[19]  Maria Gabriela Martinez,et al.  Regularization methods for optimization problems with probabilistic constraints , 2013, Math. Program..

[20]  Antonio Frangioni,et al.  Bundle methods for sum-functions with “easy” components: applications to multicommodity network design , 2013, Mathematical Programming.

[21]  Antonio Frangioni,et al.  A stabilized structured Dantzig–Wolfe decomposition method , 2012, Mathematical Programming.

[22]  I. Necoara,et al.  Fast inexact decomposition algorithms for large-scale separable convex optimization , 2012, 1212.4275.

[23]  Jong Min Lee,et al.  A tighter cut generation strategy for acceleration of Benders decomposition , 2012, Comput. Chem. Eng..

[24]  Paul I. Barton,et al.  Nonconvex Generalized Benders Decomposition with Piecewise Convex Relaxations for Global Optimization of Integrated Process Design and Operation Problems , 2012 .

[25]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[26]  Andrea Lodi,et al.  On interval-subgradient and no-good cuts , 2010, Oper. Res. Lett..

[27]  Matteo Fischetti,et al.  A note on the selection of Benders’ cuts , 2010, Math. Program..

[28]  Marianthi G. Ierapetritou,et al.  Accelerating Benders method using covering cut bundle generation , 2010, Int. Trans. Oper. Res..

[29]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[30]  Nikolaos V. Sahinidis,et al.  Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs , 2009, Optim. Methods Softw..

[31]  Antonio Frangioni,et al.  Convergence Analysis of Deflected Conditional Approximate Subgradient Methods , 2009, SIAM J. Optim..

[32]  Etienne de Klerk,et al.  The complexity of optimizing over a simplex, hypercube or sphere: a short survey , 2008, Central Eur. J. Oper. Res..

[33]  James R. Luedtke,et al.  A Sample Approximation Approach for Optimization with Probabilistic Constraints , 2008, SIAM J. Optim..

[34]  Jacques Desrosiers,et al.  On the choice of explicit stabilizing terms in column generation , 2007, Discret. Appl. Math..

[35]  Thomas D. Sandry,et al.  Probabilistic and Randomized Methods for Design Under Uncertainty , 2007, Technometrics.

[36]  Matteo Fischetti,et al.  Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..

[37]  Alexander A. Kolokolov,et al.  Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem , 2006, J. Math. Model. Algorithms.

[38]  Hanif D. Sherali,et al.  Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming , 2006, Math. Program..

[39]  Giovanni Rinaldi,et al.  New approaches for optimizing over the semimetric polytope , 2005, Math. Program..

[40]  Stephen P. Boyd,et al.  Convex Optimization , 2004, IEEE Transactions on Automatic Control.

[41]  Alysson M. Costa.  A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..

[42]  Darinka Dentcheva,et al.  Dual methods for probabilistic optimization problems* , 2004, Math. Methods Oper. Res..

[43]  Marc Goetschalckx,et al.  A stochastic programming approach for supply chain network design under uncertainty , 2004, Eur. J. Oper. Res..

[44]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[45]  Andrzej Ruszczynski,et al.  Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra , 2002, Math. Program..

[46]  T. Westerlund,et al.  Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques , 2002 .

[47]  Antonio Frangioni,et al.  Generalized Bundle Methods , 2002, SIAM J. Optim..

[48]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..

[49]  Darinka Dentcheva,et al.  Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..

[50]  Golbon Zakeri,et al.  Inexact Cuts in Benders Decomposition , 1999, SIAM J. Optim..

[51]  Stefan Feltenmark,et al.  Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems , 1999, SIAM J. Optim..

[52]  Jørgen Tind,et al.  L-shaped decomposition of two-stage stochastic programs with integer recourse , 1998, Math. Program..

[53]  Paul Wentges,et al.  Accelerating Benders' decomposition for the capacitated facility location problem , 1996, Math. Methods Oper. Res..

[54]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[55]  András Prékopa,et al.  Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution , 1990, ZOR Methods Model. Oper. Res..

[56]  R. Wets,et al.  L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .

[57]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .

[58]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[59]  Jérôme Malick,et al.  Quadratic stabilization of Benders decomposition , 2014 .

[60]  Darinka Dentcheva,et al.  4. Optimization Models with Probabilistic Constraints , 2009 .

[61]  C. Floudas.  Generalized Benders Decomposition , 2009, Encyclopedia of Optimization.

[62]  Darinka Dentcheva,et al.  Optimization Models with Probabilistic Constraints , 2006 .

[63]  Giuseppe Carlo Calafiore,et al.  Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..

[64]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[65]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

[66]  A. Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[67]  A. Prékopa,et al.  Programming Under Probabilistic Constraint with Discrete Random Variable , 1998 .

[68]  A. Victor Cabot,et al.  The application of generalized benders decomposition to certain nonconcave programs , 1991 .