Pages that link to "Item:Q1769067"
From MaRDI portal
The following pages link to Uncertain convex programs: randomized solutions and confidence levels (Q1769067):
Displayed 37 items.
- Optimization with a class of multivariate integral stochastic order constraints (Q363558) (← links)
- Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints (Q439920) (← links)
- A constraint sampling approach for multi-stage robust optimization (Q445078) (← links)
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality (Q535064) (← links)
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization (Q707779) (← links)
- Learning noisy functions via interval models (Q709215) (← links)
- Robust resource allocations in temporal networks (Q715076) (← links)
- Average flow constraints and stabilizability in uncertain production-distribution systems (Q848734) (← links)
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities (Q875498) (← links)
- Cascading: An adjusted exchange method for robust conic programming (Q940832) (← links)
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
- A robust approach to the chance-constrained knapsack problem (Q957372) (← links)
- Solving chance-constrained combinatorial problems to optimality (Q967213) (← links)
- \(\alpha \)-conservative approximation for probabilistically constrained convex programs (Q969716) (← links)
- Mathematical programming approaches for generating \(p\)-efficient points (Q992653) (← links)
- Interval predictor models: identification and reliability (Q1012735) (← links)
- On the expected probability of constraint violation in sampled convex programs (Q1039379) (← links)
- Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
- On safe tractable approximations of chance constraints (Q1926690) (← links)
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs (Q1926817) (← links)
- Multi-resource allocation in stochastic project scheduling (Q1931636) (← links)
- Pattern definition of the \(p\)-efficiency concept (Q1931642) (← links)
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection (Q1935293) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- Worst-case violation of sampled convex programs for optimization with uncertainty (Q2429409) (← links)
- Genetic algorithm based technique for solving chance constrained problems (Q2464197) (← links)
- On two-stage convex chance constrained problems (Q2466772) (← links)
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
- Ambiguous chance constrained problems and robust optimization (Q2492682) (← links)
- AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489) (← links)
- Automatic robust convex programming (Q2885466) (← links)
- (Q2893936) (← links)
- Statistical Learning Theory: A Pack-based Strategy for Uncertain Feasibility and Optimization Problems (Q3053993) (← links)
- Robust control of uncertain multi-inventory systems via linear matrix inequality (Q3162866) (← links)
- Robust<b>ℓ</b><sub>1</sub>performance analysis for linear systems with parametric uncertainties (Q3543015) (← links)
- Tractable algorithms for chance-constrained combinatorial problems (Q3632807) (← links)
- Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966130) (← links)