Fetching the paper…
Reading the bibliography…
We present a data-driven approach for distributionally robust chance constrained optimization problems (DRCCPs).
A. Prekopa, “On probabilistic constrained programming,” in Proceedings of the Princeton symposium on mathematical programming , vol. 113, 1970, p. 138
1970
Earlier work this paper cites.
R. T. Rockafellar, Convex Analysis . Princeton, NJ: Princeton University Press, 1970
1970
Earlier work this paper cites.
R. T. Rockafellar and S. Uryasev, “Optimization of conditional value-at-risk,” Journal of risk , vol. 2, pp. 21–42, 2000
2000
Earlier work this paper cites.
A. Shapiro and A. Kleywegt, “Minimax analysis of stochastic problems,” Optimization Methods and Software , vol. 17, no. 3, pp. 523–542, 2002
2002
Earlier work this paper cites.
C. Villani, Topics in optimal transportation . American Mathematical Soc., 2003, no. 58
2003
Earlier work this paper cites.
G. C. Calafiore and M. C. Campi, “Uncertain convex programs: Randomized solutions and confidence levels,” Mathematical Programming , vol. 102, no. 1, pp. 25–46, 2005
2005
Earlier work this paper cites.
E. Erdoğan and G. Iyengar, “Ambiguous chance constrained problems and robust optimization,” Mathematical Programming , vol. 107, no. 1-2, pp. 37–61, 2006
2006
Earlier work this paper cites.
A. Nemirovski and A. Shapiro, “Convex approximations of chance constrained programs,” SIAM Journal on Optimization , vol. 17, no. 4, pp. 969–996, 2006
2006
Earlier work this paper cites.
M. C. Campi and S. Garatti, “The exact feasibility of randomized solutions of uncertain convex programs,” SIAM Journal on Optimization , vol. 19, no. 3, pp. 1211–1230, 2008
2008
Earlier work this paper cites.
J. Luedtke and S. Ahmed, “A sample approximation approach for optimization with probabilistic constraints,” SIAM Journal on Optimization , vol. 19, no. 2, pp. 674–699, 2008
2008
Earlier work this paper cites.
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski, Robust optimization . Princeton University Press, 2009, vol. 28
2009
Earlier work this paper cites.
A. Shapiro, D. Dentcheva, and A. Ruszczyński, Lectures on stochastic programming: Modeling and theory . SIAM, 2009
2009
Earlier work this paper cites.
G. C. Calafiore, “Random convex programs,” SIAM Journal on Optimization , vol. 20, no. 6, pp. 3427–3464, 2010
2010
Cited alongside, same era.
E. Delage and Y. Ye, “Distributionally robust optimization under moment uncertainty with application to data-driven problems,” Operations research , vol. 58, no. 3, pp. 595–612, 2010
2010
Cited alongside, same era.
L. Blackmore, M. Ono, and B. C. Williams, “Chance-constrained optimal path planning with obstacles,” IEEE Transactions on Robotics , vol. 27, no. 6, pp. 1080–1094, 2011
2011
Cited alongside, same era.
M. C. Campi and S. Garatti, “A sampling-and-discarding approach to chance-constrained optimization: feasibility and optimality,” Journal of Optimization Theory and Applications , vol. 148, pp. 257–280, 2011
2011
Cited alongside, same era.
S. Zymler, D. Kuhn, and B. Rustem, “Distributionally robust joint chance constraints with second-order moment information,” Mathematical Programming , vol. 137, pp. 167–198, 2013
2016
Later among the works it cites.
M. Vrakopoulou, B. Li, and J. L. Mathieu, “Chance constrained reserve scheduling using uncertain controllable loads part I: Formulation and scenario-based analysis,” IEEE Transactions on Smart Grid (To appear) , 2017
2017
Later among the works it cites.
G. A. Hanasusanto, V. Roitch, D. Kuhn, and W. Wiesemann, “Ambiguous joint chance constraints under mean and dispersion information,” Operations Research , vol. 65, no. 3, pp. 751–767, 2017
2017
Later among the works it cites.
Y. Zhang, S. Shen, and J. L. Mathieu, “Distributionally robust chance-constrained optimal power flow with uncertain renewables and uncertain reserves provided by loads,” IEEE Transactions on Power Systems , vol. 32, no. 2, pp. 1378–1388, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
G. Schildbach, L. Fagiano, C. Frei, and M. Morari, “The scenario approach for stochastic model predictive control with bounds on closed-loop constraint violations,” Automatica , vol. 50, no. 12, pp. 3009–3018, 2014
2014
Cited alongside, same era.
S. Mehrotra and D. Papp, “A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization,” SIAM Journal on Optimization , vol. 24, no. 4, pp. 1670–1697, 2014
2014
Cited alongside, same era.
A. Carvalho, S. Lefévre, G. Schildbach, J. Kong, and F. Borrelli, “Automated driving: The role of forecasts and uncertainty - A control perspective,” European Journal of Control , vol. 24, pp. 14–32, 2015
2015
Cited alongside, same era.
M. Farina, L. Giulioni, and R. Scattolini, “Stochastic linear model predictive control with chance constraints–a review,” Journal of Process Control , vol. 44, pp. 53–67, 2016
2016
Cited alongside, same era.
M. P. Vitus, Z. Zhou, and C. J. Tomlin, “Stochastic control with uncertain parameters via chance constrained control,” IEEE Transactions on Automatic Control , vol. 61, no. 10, pp. 2892–2905, 2016
2016
Cited alongside, same era.
R. Jiang and Y. Guan, “Data-driven chance constrained stochastic program,” Mathematical Programming , vol. 158, pp. 291–327, 2016
2016
Cited alongside, same era.
B. P. Van Parys, D. Kuhn, P. J. Goulart, and M. Morari, “Distributionally robust control of constrained stochastic systems,” IEEE Transactions on Automatic Control , vol. 61, no. 2, pp. 430–442, 2016
2016
Cited alongside, same era.
2017
Later among the works it cites.
I. Yang, “A convex optimization approach to distributionally robust markov decision processes with Wasserstein distance,” IEEE control systems letters , vol. 1, no. 1, pp. 164–169, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
A. Pichler and H. Xu, “Quantitative stability analysis for minimax distributionally robust risk optimization,” 2017, available online at http://www.optimization-online.org/DB_HTML/2017/01/5814.html
2017
Later among the works it cites.
2018
Closest in time.
W. Xie and S. Ahmed, “Bicriteria approximation of chance constrained covering problems,” 2018, available online at http://www.optimization-online.org/DB_HTML/2018/01/6411.html
2018
Closest in time.
W. Xie, “On distributionally robust chance constrained program with Wasserstein distance,” 2018, available online at http://www.optimization-online.org/DB_FILE/2018/06/6662.pdf
2018
Closest in time.
Z. Chen, D. Kuhn, and W. Wiesemann, “Data-driven chance constrained programs over Wasserstein balls,” 2018, available online at http://www.optimization-online.org/DB_FILE/2018/06/6671.pdf
2018
Closest in time.