Randomized methods for design of uncertain systems: sample complexity and sequential algorithms

DOI10.1016/j.automatica.2014.11.004zbMath1309.93192arXiv1304.0678OpenAlexW2007921211MaRDI QIDQ2342767

Amalia Luque, Daniel R. Ramirez, Teodoro Alamo, Roberto Tempo

Publication date: 29 April 2015

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.0678

zbMATH Keywords

uncertain systemssample complexityrandomized and probabilistic algorithms

Mathematics Subject Classification ID

Related Items (30)

On incremental approximate saddle-point computation in zero-sum matrix games ⋮ Scenario Min-Max Optimization and the Risk of Empirical Costs ⋮ Probabilistic reachable and invariant sets for linear systems with correlated disturbance ⋮ Stochastic MPC with offline uncertainty sampling ⋮ Probabilistic robust anti-disturbance control of uncertain systems ⋮ Probabilistic performance validation of deep learning‐based robust NMPC controllers ⋮ Probabilistically certified region of attraction of a tumor growth model with combined chemo‐ and immunotherapy ⋮ Moving from linear to conic markets for electricity ⋮ Probabilistic feasibility guarantees for convex scenario programs with an arbitrary number of discarded constraints ⋮ On Conditional Risk Assessments in Scenario Optimization ⋮ Learning-based sensitivity analysis and feedback design for drug delivery of mixed therapy of cancer in the presence of high model uncertainties ⋮ Stability properties of multi-stage nonlinear model predictive control ⋮ A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach ⋮ Probabilistic robust design of control systems for high-fidelity cyber-physical testing ⋮ Stability analysis of LPV systems: scenario approach ⋮ Trading performance for state constraint feasibility in stochastic constrained control: a randomized approach ⋮ Unnamed Item ⋮ Wait-and-judge scenario optimization ⋮ Exploiting structure of chance constrained programs via submodularity ⋮ Chance-constrained \(H_\infty\) control for a class of time-varying systems with stochastic nonlinearities: the finite-horizon case ⋮ Optimal disturbance compensation for constrained linear systems operating in stationary conditions: a scenario-based approach ⋮ On a class of interval predictor models with universal reliability ⋮ On probabilistic certification of combined cancer therapies using strongly uncertain models ⋮ A randomized relaxation method to ensure feasibility in stochastic control of linear systems subject to state and input constraints ⋮ Chance-constrained sets approximation: a probabilistic scaling approach ⋮ The wait-and-judge scenario approach applied to antenna array design ⋮ Using stochastic programming to train neural network approximation of nonlinear MPC laws ⋮ A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints

Uses Software

• RACT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A constraint sampling approach for multi-stage robust optimization
• Robust control of uncertain systems: classical results and recent developments
• A statistical learning theory approach for uncertain linear and bilinear matrix inequalities
• Performance assessment and design of abstracted models for stochastic hybrid systems through a randomized approach
• A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
• Uncertain convex programs: randomized solutions and confidence levels
• On the Lambert \(w\) function
• Research on probabilistic methods for control system design
• Randomized algorithms for analysis and control of uncertain systems. With applications
• A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
• An ellipsoid algorithm for probabilistic robust controller design
• LMI relaxations in robust control
• Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
• Improved sample complexity estimates for statistical learning control of uncertain systems
• Robust Convex Optimization
• Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty
• A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
• Random Convex Programs
• The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• The Linear Programming Approach to Approximate Dynamic Programming
• NP-Hardness of Some Linear Control Design Problems
• Stochastic algorithms for exact and approximate feasibility of robust LMIs
• On the Sample Complexity of Probabilistic Analysis and Design Methods
• Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
• Probabilistic Robust Controller Design: Probable Near Minimax Value and Randomized Algorithms
• Optimization with few violated constraints for linear bounded error parameter estimation
• Common Lyapunov Functions and Gradient Algorithms
• Randomized algorithms for synthesis of switching rules for multimodal systems
• The Scenario Approach to Robust Control Design
• Advanced Lectures on Machine Learning
• Convex Approximations of Chance Constrained Programs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A survey of computational complexity results in systems and control
• Probabilistic robust design with linear quadratic regulators
• Randomized algorithms for robust controller synthesis using statistical learning theory
• Probabilistic solutions to some NP-hard matrix problems

This page was built for publication: Randomized methods for design of uncertain systems: sample complexity and sequential algorithms