Pages that link to "Item:Q2439484"
From MaRDI portal
The following pages link to Convex relaxations of chance constrained optimization problems (Q2439484):
Displaying 27 items.
- Mean-value at risk portfolio efficiency: approaches based on data envelopment analysis models with negative data and their empirical behaviour (Q262452) (← links)
- Data-driven chance constrained stochastic program (Q304243) (← links)
- Solving joint chance constrained problems using regularization and Benders' decomposition (Q827143) (← links)
- Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs (Q828647) (← links)
- \(\alpha \)-conservative approximation for probabilistically constrained convex programs (Q969716) (← links)
- Relaxations and approximations of chance constraints under finite distributions (Q1650766) (← links)
- Convex relaxation for IMSE optimal design in random-field models (Q1658175) (← links)
- Distributionally robust chance constrained problem under interval distribution information (Q1670537) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- A robust approach to warped Gaussian process-constrained optimization (Q2097663) (← links)
- Optimized Bonferroni approximations of distributionally robust joint chance constraints (Q2118072) (← links)
- Relaxation schemes for the joint linear chance constraint based on probability inequalities (Q2165806) (← links)
- The probabilistic and reliable connected power dominating set problems (Q2311207) (← links)
- Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
- Beyond Chance-Constrained Convex Mixed-Integer Optimization: A Generalized Calafiore-Campi Algorithm and the notion of $S$-optimization (Q4609983) (← links)
- Bicriteria Approximation of Chance-Constrained Covering Problems (Q5131473) (← links)
- Computational and statistical tradeoffs via convex relaxation (Q5170958) (← links)
- Analytic approximation and differentiability of joint chance constraints (Q5197999) (← links)
- JOINT CHANCE CONSTRAINED PROGRAMMING WITH DEPENDENT PARAMETERS (Q5229433) (← links)
- Eventual convexity of chance constrained feasible sets (Q5248236) (← links)
- An Inner-Outer Approximation Approach to Chance Constrained Optimization (Q5355201) (← links)
- Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning (Q6065612) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
- A limited-memory BFGS-based differential evolution algorithm for optimal control of nonlinear systems with mixed control variables and probability constraints (Q6157441) (← links)
- Optimal control of nonlinear systems with integer‐valued control inputs and stochastic constraints (Q6180542) (← links)
- Robust approximation of chance constrained optimization with polynomial perturbation (Q6642796) (← links)
