Randomized algorithms for robust controller synthesis using statistical learning theory
From MaRDI portal
Publication:5947623
DOI10.1016/S0005-1098(01)00122-4zbMath1055.93512OpenAlexW1987656566MaRDI QIDQ5947623
Publication date: 10 February 2002
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0005-1098(01)00122-4
Nonparametric robustness (62G35) Design techniques (robust design, computer-aided design, etc.) (93B51) Synthesis problems (93B50) Stochastic learning and adaptive control (93E35)
Related Items
A probabilistic framework for problems with real structured uncertainty in systems and control, On control system design using random samples of contractive block Toeplitz matrices, A survey of randomized algorithms for control synthesis and performance verification, Design of Near Optimal Decision Rules in Multistage Adaptive Mixed-Integer Optimization, Polynomial-time probabilistic observability analysis of sampled-data piecewise affine systems, Randomization and entropy in machine learning and data processing, Optimization under uncertainty with applications to design of truss structures, On the sample size of random convex programs with structured dependence on the uncertainty, Probabilistic design of LPV control systems., Convexity and convex approximations of discrete-time stochastic control problems with constraints, Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities., Robust control of uncertain systems: classical results and recent developments, A statistical learning theory approach for uncertain linear and bilinear matrix inequalities, Probabilistic model validation for uncertain nonlinear systems, Control design with hard/soft performance specifications: aQ-parameter randomization approach, Iterative robust control: speeding up improvement through iterations, Statistical Learning Theory: A Pack-based Strategy for Uncertain Feasibility and Optimization Problems, From deterministic to stochastic surrender risk models: impact of correlation crises on economic capital, Research on probabilistic methods for control system design, Probability-guaranteed robust \(H_{\infty }\) performance analysis and state-feedback design, Randomized algorithms for the synthesis of cautious adaptive controllers, A primal--dual probabilistic setting for quadratic stability of uncertain systems, Robust \(H_{\infty }\) control design for best mean performance over an uncertain-parameters box, Near optimal solutions to least-squares problems with stochastic uncertainty, Application of randomized algorithms to assessment and design of observer-based fault detection systems, On convex parameterization of robust control design for minimizing (conditional) performance at risk, Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control, Randomized methods for design of uncertain systems: sample complexity and sequential algorithms, Some applications of randomized algorithms for control system design, Polytopic best-meanH∞performance analysis, On a new generalised LMI condition and randomised algorithm for robust stabilisation via static-output-feedback
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Several NP-hard problems arising in robust stability analysis
- Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
- Checking robust nonsingularity is NP-hard
- Some applications of randomized algorithms for control system design
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- Stochastic robustness of linear time-invariant control systems
- Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
- Feedforward Neural Network Methodology
- Computational complexity of μ calculation
- NP-Hardness of Some Linear Control Design Problems
- Finiteness results for sigmoidal “neural” networks
- Vapnik-Chervonenkis bounds for generalization
- Probability Inequalities for Sums of Bounded Random Variables
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A survey of computational complexity results in systems and control
- Probabilistic solutions to some NP-hard matrix problems
