Worst-case violation of sampled convex programs for optimization with uncertainty
From MaRDI portal
Publication:2429409
DOI10.1007/s10957-011-9923-2zbMath1272.90037OpenAlexW2043772803MaRDI QIDQ2429409
Akiko Takeda, Takafumi Kanamori
Publication date: 27 April 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9923-2
Related Items (8)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ On the computational complexity and generalization properties of multi-stage and stage-wise coupled scenario programs ⋮ Unnamed Item ⋮ Consistency of the Scenario Approach ⋮ Expected shortfall: heuristics and certificates ⋮ First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds ⋮ A relaxation algorithm with a probabilistic guarantee for robust deviation optimization ⋮ Probabilistic Guarantees in Robust Optimization
Cites Work
- Unnamed Item
- A relaxation algorithm with a probabilistic guarantee for robust deviation optimization
- The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality
- Applications of second-order cone programming
- Robust solutions of uncertain linear programs
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Robust convex quadratically constrained programs
- Uncertain convex programs: randomized solutions and confidence levels
- Robust Convex Optimization
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- The Scenario Approach to Robust Control Design
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Robust Portfolio Selection Problems
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
This page was built for publication: Worst-case violation of sampled convex programs for optimization with uncertainty
