A descent proximal level bundle method for convex nondifferentiable optimization, Operations Research Letters, vol.17, issue.3, pp.121-126, 1995. ,
DOI : 10.1016/0167-6377(94)00056-C
Vial, Solving the p-median problem with a semi-lagrangian relaxation [Deá06] I. Deák, Two-stage stochastic problems with correlated normal variables: computational experiences, Computational Optimization and Applications Annals OR, vol.35, issue.2 1, pp.142-79, 2006. ,
A Primer in Column Generation, pp.1-32, 2005. ,
DOI : 10.1007/0-387-25486-2_1
Benchmarking optimization software with performance profiles, Mathematical Programming, vol.91, issue.2, pp.201-213, 2002. ,
DOI : 10.1007/s101070100263
Regularization methods for optimization problems with probabilistic constraints, Math. Programming (series A) Level bundle methods for oracles with on-demand accuracy, Optimization Methods and Software, vol.138, issue.29 6, pp.223-251, 2013. ,
Convex proximal bundle methods in depth: a unified analysis for inexact oracles, Mathematical Programming, vol.24, issue.2, pp.241-277, 2014. ,
DOI : 10.1007/s10107-014-0809-6
Optimal scenario tree reduction for stochastic streamflows in power generation planning problems, Optimization Methods and Software Inexact bundle methods for two-stage stochastic programming, Solodov, A doubly stabilized bundle method for nonsmooth convex optimization, pp.917-936, 2010. ,
Bundle-type methods for inexact data, Central European Journal of Operations Research, vol.8, pp.35-55, 2000. ,
Generalized bundle methods, SIAM Journal on Optimization, vol.13, 2002. ,
Generalized Benders decomposition, Journal of Optimization Theory and Applications, vol.10, issue.4, pp.237-260, 1972. ,
A proximal bundle method based on approximate subgradients Convex analysis and minimization algorithms, Grund. der math. Wiss, Computational Optimization and Applications, vol.20, issue.10, pp.245-266, 1023. ,
The cutting plane method for solving convex programs, J. Soc. Indust. Appl. Math, vol.8, pp.703-712, 1960. ,
A proximal bundle method with approximate subgradient linearizations, SIAM Journal on Optimization, vol.16, issue.4, pp.1007-1023, 2006. ,
Accelerating benders decomposition: Algorithmic enhancement and model selection criteria Stochastic programming, Handbooks in Operations Research and Management Science Lectures on stochastic programming: Modeling and theory, MPS-SIAM Series on Optimization, Solodov, On approximations with finite precision in bundle methods for nonsmooth optimization, pp.464-484, 1981. ,
Large-scale Unit Commitment under uncertainty, 4OR, vol.5, issue.1, pp.4-5, 2015. ,
DOI : 10.1007/s10288-014-0279-y
URL : https://hal.archives-ouvertes.fr/hal-01340333
Probabilistic optimization via approximate p-efficient points and bundle methods, Computers & Operations Research, vol.77, 2015. ,
DOI : 10.1016/j.cor.2016.08.002
Level bundle methods for constrained convex optimization with various oracles, Computational Optimization and Applications, vol.15, issue.3, pp.555-597, 2014. ,
DOI : 10.1007/s10589-013-9610-3
Inexact stabilized benders decomposition approaches to chance-constrained problems with finite support, Submitted; Available as preprint TR-15-01 of, 2015. ,
Joint chance constrained programming for hydro reservoir management, Optimization and Engineering, vol.24, issue.2, pp.509-531, 2014. ,
DOI : 10.1007/s11081-013-9236-4
Inexact Cuts in Benders Decomposition, SIAM Journal on Optimization, vol.10, issue.3, pp.643-657, 2000. ,
DOI : 10.1137/S1052623497318700