Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
From MaRDI portal
Abstract: In this paper, we propose new sequential randomized algorithms for convex optimization problems in the presence of uncertainty. A rigorous analysis of the theoretical properties of the solutions obtained by these algorithms, for full constraint satisfaction and partial constraint satisfaction, respectively, is given. The proposed methods allow to enlarge the applicability of the existing randomized methods to real-world applications involving a large number of design variables. Since the proposed approach does not provide a priori bounds on the sample complexity, extensive numerical simulations, dealing with an application to hard-disk drive servo design, are provided. These simulations testify the goodness of the proposed solution.
Cited in
(8)- A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay
- Data-driven model improvement for model-based control
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints
- Robust control of uncertain systems: classical results and recent developments
- A statistical learning theory approach for uncertain linear and bilinear matrix inequalities
- Parametric scenario optimization under limited data: a distributionally robust optimization view
- ROBIST: robust optimization by iterative scenario sampling and statistical testing
This page was built for publication: Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980405)
