On the Sample Size of Random Convex Programs with Structured Dependence on the Uncertainty (Extended Version)
Not on the map. Why?
Abstract (arXiv)
The "scenario approach" provides an intuitive method to address chance constrained problems arising in control design for uncertain systems. It addresses these problems by replacing the chance constraint with a finite number of sampled constraints (scenarios). The sample size critically depends on Helly's dimension, a quantity always upper bounded by the number of decision variables. However, this standard bound can lead to computationally expensive programs whose solutions are conservative in terms of cost and violation probability. We derive improved bounds of Helly's dimension for problems where the chance constraint has certain structural properties. The improved bounds lower the number of scenarios required for these problems, leading both to improved objective value and reduced computational complexity. Our results are generally applicable to Randomized Model Predictive Control of chance constrained linear systems with additive uncertainty and affine disturbance feedback. The efficacy of the proposed bound is demonstrated on an inventory management example.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Feb 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2023Compression, Generalization and Learningcited by 21
- 2023Margin theory for the scenario-based approach to robust optimization in high dimensioncited by 1
- 2024Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spacescited by 0
- 2026Scenario Approach with Post-Design Certification of User-Specified Propertiescited by 0
- 2026Scenario Approach with Post-Design Certification of User-Specified Properties17 Feb 2026
- 2024Randomized algorithms and PAC bounds for inverse reinforcement learning in continuous spaces24 May 2024
- 2023Margin theory for the scenario-based approach to robust optimization in high dimension7 Mar 2023
- 2023Compression, Generalization and Learning30 Jan 2023