Randomized algorithms for robust controller synthesis using statistical learning theory

Automatica

Volumn 37, Issue 10, 2001, Pages 1515-1528

  Vidyasagar, M ^a  

^a TATA CONSULTANCY SERVICES   (India)

Author keywords

Polynomial inequalities; Randomized algorithms; Robust control; Statistical learning theory; VC dimension

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CONTROL SYSTEM ANALYSIS; CONTROL SYSTEM SYNTHESIS; LEARNING SYSTEMS; POLYNOMIALS; RANDOM PROCESSES; STATISTICAL METHODS;

POLYNOMIAL INEQUALITIES; RANDOMIZED ALGORITHMS; STATISTICAL LEARNING THEORY;

ROBUSTNESS (CONTROL SYSTEMS);

EID: 0035480306     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(01)00122-4     Document Type: Article

References (31)

1. Computational complexity of the μ calculation
2. NP-hardness of some linear control design problems
3. A survey of computational complexity results in systems and control
4. The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
5. Analysis of feedback systems with structured uncertainties
6. Decision theoretic generalizations of the PAC model for neural net and other learning applications
7. Probability inequalities for sums of bounded random variables
8. Polynomial bounds for VC dimension of sigmoidal neural networks
9. Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
10. Randomized algorithms for robust control analysis have polynomial complexity
11. Combining statistical physics with VC-bounds on generalisation in learning systems
12. Finiteness results for sigmoidal neural networks
13. The use of random search and genetic algorithms to optimize stochastic robustness functions
14. Several NP-hard problems arising in robust stability analysis
15. Some applications of randomized algorithms for control system design
16. Vapnik-Chervonenkis bounds for generalization
17. Checking robust nonsingularity is NP-hard
18. Stochastic robustness of linear time-invariant control systems
19. Probabilistic robustness analysis: Explicit bounds for the minimum number of sampling points
20. On the uniform convergence of relative frequencies to their probabilities
21. Necessary and sufficient conditions for the uniform convergence of means to their expectations
22. Statistical learning theory and its applications to randomized algorithms for robust controller synthesis
23. Probabilistic solutions to some NP-hard matrix problems