Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control
From MaRDI portal
Publication:5966130
DOI10.3166/ejc.16.419-430zbMath1394.93360OpenAlexW2156420987MaRDI QIDQ5966130
Publication date: 9 March 2011
Published in: European Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/ejc.16.419-430
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
- Several NP-hard problems arising in robust stability analysis
- Estimation of regression parameters with arbitrary noise
- Robust performance of linear parametrically varying systems using parametrically-dependent linear feedback
- The uniform distribution: A rigorous justification for its use in robustness analysis
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Probabilistic design of LPV control systems.
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
- A probabilistic framework for problems with real structured uncertainty in systems and control
- Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
- Uncertain convex programs: randomized solutions and confidence levels
- A Monte Carlo approach to the analysis of control system robustness
- Checking robust nonsingularity is NP-hard
- Randomized algorithms for quadratic stability of quantized sampled-data systems
- Randomized algorithms for the synthesis of cautious adaptive controllers
- An ellipsoid algorithm for probabilistic robust controller design
- Guaranteed non-asymptotic confidence regions in system identification
- Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
- Improved sample complexity estimates for statistical learning control of uncertain systems
- Stochastic robustness of linear time-invariant control systems
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- Learnability and the Vapnik-Chervonenkis dimension
- Adaptive Robust Procedures: A Partial Review and Some Suggestions for Future Applications and Theory
- Computational complexity of μ calculation
- Stochastic sampling algorithms for state estimation of jump Markov linear systems
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- Equation of State Calculations by Fast Computing Machines
- The Scenario Approach to Robust Control Design
- Probability Inequalities for Sums of Bounded Random Variables
- Monte Carlo sampling methods using Markov chains and their applications
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- The Monte Carlo Method
- 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
