Augmented Lagrangian method for probabilistic optimization
暂无分享,去创建一个
[1] V. Norkin,et al. α-concave functions and measures and their applications , 1991 .
[2] Andrzej Ruszczynski,et al. Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra , 2002, Math. Program..
[3] Darinka Dentcheva,et al. Concavity and efficient points of discrete distributions in probabilistic programming , 2000, Math. Program..
[4] A. Ruszczynski,et al. Nonlinear Optimization , 2006 .
[5] András Prékopa,et al. ON PROBABILISTIC CONSTRAINED PROGRAMMING , 2015 .
[6] Nilay Noyan,et al. Mathematical programming approaches for generating p-efficient points , 2010, Eur. J. Oper. Res..
[7] H. Kuhn. Proceedings of the Princeton Symposium on Mathematical Programming , 1971 .
[8] A. Prékopa,et al. Programming Under Probabilistic Constraint with Discrete Random Variable , 1998 .
[9] Alexander Shapiro,et al. Lectures on Stochastic Programming: Modeling and Theory , 2009 .
[10] Tamás Rapcsák,et al. New Trends in Mathematical Programming , 1998 .
[11] Tamás Szántai. Calculation of the Multivariate Probability Distribution Function Values and their Gradient Vectors , 1987 .
[12] George L. Nemhauser,et al. An integer programming approach for linear programs with probabilistic constraints , 2010, Math. Program..
[13] J. Frédéric Bonnans,et al. Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.
[14] J Figueira,et al. Stochastic Programming , 1998, J. Oper. Res. Soc..
[15] Y. Rinott. On Convexity of Measures , 1976 .
[16] Darinka Dentcheva,et al. Dual methods for probabilistic optimization problems* , 2004, Math. Methods Oper. Res..
[17] Darinka Dentcheva,et al. Bounds for probabilistic integer programming problems , 2002, Discret. Appl. Math..