Worst-case violation of sampled convex programs for optimization with uncertainty
Consider the following robust convex program \[ \min_{x\in \chi }\,\left\langle c,x\right\rangle \;\text{s.t.\;}f\left( x,u\right) \leq 0,\;\forall u\in \mathcal{U}\subset \mathbb{R}^d, \] where \(f\left( x,u\right) \) is a convex function in \(x\in \mathbb{R}^m\), \(\;\mathcal{U}\) denotes the uncertainty set for uncertain parameters \( u\in \mathbb{R}^d\), i.e., the set of all potentially realizable values of these uncertain parameters and \(\chi \) is a convex subset in \(\mathbb{R}^m\). The basic idea of robust optimization is to seek a solution that is guaranteed to perform well in terms of feasibility and near-optimality for all possible realizations of the uncertain input data. This paper is concerned with the probability of violation of the constraints by the randomized solution and also the degree of violation, i.e. the worst-case violation. The authors derive an upper bound of the worst-case violation for the sampled convex programs and consider the relation between the probability of violation and the worst-case violation. Numerical experiments are presented.
- Uncertain convex programs: randomized solutions and confidence levels
- Sampled convex programs and probabilistically robust design
- Robust convex optimization
- On the expected probability of constraint violation in sampled convex programs
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- Applications of second-order cone programming
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Robust convex optimization
- Robust convex quadratically constrained programs
- Robust Portfolio Selection Problems
- Robust solutions of uncertain linear programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- The Scenario Approach to Robust Control Design
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Uncertain convex programs: randomized solutions and confidence levels
- On the expected probability of constraint violation in sampled convex programs
- Expected shortfall: heuristics and certificates
- Uncertain convex programs: randomized solutions and confidence levels
- First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds
- On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs
- Consistency of the scenario approach
- Probabilistic guarantees in robust optimization
- Sampled convex programs and probabilistically robust design
- Shared subspace models for multi-group covariance estimation
- Data-driven verification and synthesis of stochastic systems via barrier certificates
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
This page was built for publication: Worst-case violation of sampled convex programs for optimization with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429409)
