Probabilistic optimization via approximate p-efficient points and bundle methods
Authors:
- W. van AckooijWAW. van Ackooij
- V. BergeVBV. Berge
- W. de OliveiraWOW. de Oliveira
- C. SagastizábalCSC. Sagastizábal
- 1 January 2017
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 77, 177-193
Abstract
No abstract availableKeywords
Funding Information
- Severo Ochoa Program (SEV-2013-0323)
- Basque Government BERC Program (2014-2017)
- CNPq (303840/2011-0)
- AFOSR (FA9950-11-1-0139)
- PRONEX-Optimization
- FAPERJ
This publication has 44 references indexed in Scilit:
- Regularization methods for optimization problems with probabilistic constraintsMathematical Programming, 2012
- Augmented Lagrangian method for probabilistic optimizationAnnals of Operations Research, 2011
- An integer programming approach for linear programs with probabilistic constraintsMathematical Programming, 2008
- A primal-proximal heuristic applied to the French Unit-commitment problemMathematical Programming, 2005
- Uncertain convex programs: randomized solutions and confidence levelsMathematical Programming, 2004
- Optimal quadratic quantization for numerics: the Gaussian caseMonte Carlo Methods and Applications, 2003
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedraMathematical Programming, 2002
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Aquifer remediation design under uncertainty using a new chance constrained programming techniqueWater Resources Research, 1993
- An optimal regulation of a storage level with application to the water level regulation of a lakeEuropean Journal of Operational Research, 1979