Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty

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.

18 pages, Submitted for publication to IEEE Transactions on Automatic Control

References in corpus (1)

• Randomized Methods for Design of Uncertain Systems: Sample Complexity and Sequential Algorithms

Cited by in corpus (9)

• Optimization under Uncertainty in the Era of Big Data and Deep Learning: When Machine Learning Meets Mathematical Programming
• A Statistical Learning Theory Approach for Uncertain Linear and Bilinear Matrix Inequalities
• A Posteriori Probabilistic Bounds of Convex Scenario Programs with Validation Tests
• Chance-constrained optimization with tight confidence bounds
• Randomized Constraints Consensus for Distributed Robust Linear Programming
• Randomized Constraints Consensus for Distributed Robust Mixed-Integer Programming
• AC optimal power flow in the presence of renewable sources and uncertain loads
• Algorithms for Optimal AC Power Flow in the Presence of Renewable Sources
• Parametric Scenario Optimization under Limited Data: A Distributionally Robust Optimization View