Randomized algorithms for analysis and control of uncertain systems

Communications and Control Engineering

Volumn , Issue 9781852335243, 2005, Pages 1-344

  Tempo, Roberto ^a   Calafiore, Giuseppe ^a   Dabbene, Fabrizio ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL ENGINEERING; ENGINEERING;

ANALYSIS AND CONTROLS; RANDOMIZED ALGORITHMS;

INDUSTRIAL ENGINEERING;

EID: 33847202340     PISSN: 01785354     EISSN: 21977119     Source Type: Book Series    
DOI: None     Document Type: Chapter

References (297)

1. M. Abramowitz and I.A. Stegun (editors). Handbook of Mathematical Functions. Dover, New York, 1970.
2. J.E. Ackermann, H.Z. Hu, and D. Kaesbauer. Robustness analysis: a case study. IEEE Transactions on Automatic Control, AC-35:352–356, 1990.
3. S. Agmon. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6:382–392, 1954.
4. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, 1974.
5. J.H. Ahrens and U. Dieter. Computer methods for sampling from Gamma, beta, Poisson and binomial distributions. Computing, 12:223–246, 1974.
6. T. Alpcan and T. Başar. A utility-based congestion control scheme for Internet-style networks with delay. In Proceedings IEEE Infocom, 2003.
7. T. Alpcan, T. Başar, and R. Tempo. Randomized algorithms for stability and robustness analysis of high speed communication networks. In Proceedings IEEE Conference on Control Applications, pages 397–403, 2003.
8. N.S. Altman. Bitwise behavior of random number generators. SIAM Journal on Scientific and Statistical Computing, 9:941–949, 1988.
9. V. Anantharam and J. Walrand. Special issue on control methods for communication networks – editorial. Automatica, 35:1891, 1990.
10. B.D.O. Anderson, N.K. Bose, and E.I. Jury. Output feedback stabilization and related problems – solution via decision methods. IEEE Transactions on Automatic Control, AC-20:53–66, 1975.
11. B.D.O. Anderson and J.B. Moore. Optimal Control: Linear Quadratic Methods. Prentice-Hall, Englewood Cliffs, 1990.
12. T.W. Anderson. An Introduction to Multivariate Statistical Analysis. Wiley, New York, 1958.
13. T.W. Anderson and D.A. Darling. Asymptotic theory of certain “goodness-of-fit” criteria based on stochastic processes. Annals of Mathematical Statistics, 23:193–212, 1952.
14. P. Apkarian and R.J. Adams. Advanced gain-scheduling techniques for uncertain systems. IEEE Transactions on Control Systems Technology, CST-6:21–32, 1998.
15. ∞ controllers. IEEE Transactions on Automatic Control, AC-40:853–864, 1995.
16. D. Applegate and R. Kannan. Sampling and integration of near log-concave functions. In Proceedings of the ACM Symposium on Theory of Computing, pages 156–163, 1991.
17. T. Asai and S. Hara. A unified approach to LMI-based reduced order self-scheduling control synthesis. Systems & Control Letters, 36:75–86, 1999.
18. E.-W. Bai, K.M. Nagpal, and R. Tempo. Bounded-error parameter estimation: noise models and recursive algorithms. Automatica, 32:985–999, 1996.
19. E.-W. Bai, R. Tempo, and M. Fu. Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis. Mathematics of Control, Signals, and Systems, 11:183–196, 1998.
20. V. Balakrishnan, S. Boyd, and S. Balemi. Branch and bound algorithm for computing the minimum stability degree of parameter-dependent linear systems. International Journal of Robust and Nonlinear Control, 1:295–317, 1992.
21. G.J. Balas, J.C. Doyle, K. Glover, A. Packard, and R. Smith. µ-Analysis and Synthesis Toolbox. MUSYN Inc. and The MathWorks Inc., Natick, 1993.
22. K. Ball. An elementary introduction to modern convex geometry. In Flavors of Geometry (S. Levy editor), pages 1–58. Cambridge University Press, Cambridge, 1997.
23. I. Bárány and Z. Füredi. Computing the volume is difficult. Discrete and Computational Geometry, 2:319–326, 1987.
24. B.R. Barmish. New Tools for Robustness of Linear Systems. Macmillan, New York, 1994.
25. B.R. Barmish and H.I. Kang. A survey of extreme point results for robustness of control systems. Automatica, 29:13–35, 1993.
26. B.R. Barmish, P.P. Khargonekar, Z. Shi, and R. Tempo. Robustness margin need not be a continuous function of the problem data. Systems & Control Letters, 15:91–98, 1990.
27. B.R. Barmish and C.M. Lagoa. The uniform distribution: a rigorous justification for its use in robustness analysis. Mathematics of Control, Signals, and Systems, 10:203–222, 1997.
28. B.R. Barmish and P.S. Shcherbakov. On avoiding vertexization of robustness problems: the approximate feasibility concept. IEEE Transactions on Automatic Control, AC-47:819–824, 2002.
29. A.C. Bartlett, C.V. Hollot, and L. Huang. Root locations of an entire polytope of polynomials: it suffices to check the edges. Mathematics of Control, Signals, and Systems, 1:61–71, 1988.
30. T. Başar and G. J. Olsder. Dynamic Noncooperative Game Theory. SIAM, Philadelphia, 1999.
31. G. Becker and A. Packard. Robust performance of linear parametrically varying systems using parametrically-dependent linear feedback. Systems & Control Letters, 23:205–215, 1994.
32. M. Bellare, S. Goldwasser, and D. Micciancio. “Pseudo-Random” Number Generation within Cryptographic Algorithms: The DSS Case. Springer-Verlag, New York, 1997.
33. R. Bellman. Dynamic Programming. Princeton University Press, Princeton, 1957.
34. A. Ben-Tal and A. Nemirovski. Robust convex optimization. Mathematics of Operations Research, 23:769–805, 1998.
35. G. Bennett. Probability inequalities for the sum of independent random variables. Journal of the American Statistical Association, 57:33–45, 1962.
36. J. Bernoulli. Ars Conjectandi. Paris, 1713.
37. S.N. Bernstein. The Theory of Probabilities. Gostehizdat Publishing House, Moscow, 1946 (in Russian).
38. D. Bertsimas and J. Sethuraman. Moment problems and semidefinite optimization. In Handbook of Semidefinite Programming (H. Wolkowicz, R. Saigal and L. Vandenberghe editors), pages 469–509. Kluwer, Boston, 2000.
39. S.P. Bhattacharyya. Robust Stabilization Against Structured Perturbations. Springer-Verlag, New York, 1987.
40. S.P. Bhattacharyya, H. Chapellat, and L.H. Keel. Robust Control: The Parametric Approach. Prentice-Hall, Upper Saddle River, 1995.
41. F. Blanchini. Set invariance in control. Automatica, 35:1747–1767, 1999.
42. V.D. Blondel and J.N. Tsitsiklis. A survey of computational complexity results in systems and control. Automatica, 36:1249–1274, 2000.
43. L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on Computing, 15:364–383, 1986.
44. L. Blum, F. Cucker, M. Shub, and S. Smale. Complexity and Real Computation. Springer-Verlag, New York, 1997.
45. B. Bollobás. Volume estimates and rapid mixing. In Flavors of Geometry (S. Levy editor), pages 151–194. Cambridge University Press, Cambridge, 1997.
46. V. A. Bondarko and V. A. Yakubovich. The method of recursive aim inequalities in adaptive control theory. International Journal of Adaptive Control and Signal Processing, 6:141–160, 1992.
47. S. Boucheron, G. Lugosi, and P. Massart. Concentration inequalities using the entropy method. Annals of Probability, 31:1583–1614, 2003.
48. S. Boyd and C.H. Barrat. Linear Controller Design – Limits of Performance. Prentice-Hall, Englewood Cliffs, 1991.
49. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia, 1994.
50. R.P. Braatz, P.M. Young, J.C. Doyle, and M. Morari. Computational complexity of µ calculation. IEEE Transactions on Automatic Control, AC-39:1000–1002, 1994.
51. M.S. Branicky, S.M. LaValle, K. Olson, and L. Yang. Quasi-randomized path planning. In Proceedings IEEE Conference on Robotics and Automation, pages 1481–1487, 2001.
52. R.W. Brockett and D. Liberzon. Quantized feedback stabilization of linear systems. IEEE Transactions on Automatic Control, AC-45:1279–1289, 2000.
53. S.H. Brooks. A discussion of random methods for seeking maxima. Operations Research, 6:244–251, 1958.
54. L.G. Bushnell. Special issue on networks and control – editorial. IEEE Control Systems Magazine, 21:22–23, 2001.
55. G. Calafiore and M.C. Campi. Interval predictors for unknown dynamical systems: an assessment of reliability. In Proceedings IEEE Conference on Decision and Control, pages 4766–4771, 2002.
56. G. Calafiore and M.C. Campi. Robust convex programs: randomized solutions and applications in control. In Proceedings IEEE Conference on Decision and Control, pages 2423–2428, 2003.
57. G. Calafiore and M.C. Campi. Uncertain convex programs: randomized solutions and confidence levels. Mathematical Programming, DOI: 10.1007/s10107-003-0499-y, 2004.
58. G. Calafiore and F. Dabbene. Loop gain under random feedback. In Proceedings IEEE Conference on Decision and Control, pages 5016–5019, 2001.
59. G. Calafiore and F. Dabbene. A probabilistic framework for problems with real structured uncertainty in systems and control. Automatica, 38:1265–1276, 2002.
60. G. Calafiore, F. Dabbene, and R. Tempo. Radial and uniform distributions in vector and matrix spaces for probabilistic robustness. In Topics in Control and its Applications (D.E. Miller and L. Qiu editors), pages 17–31. Springer-Verlag, New York, 1999.
61. G. Calafiore and B.T. Polyak. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Transactions on Automatic Control, AC-46:1755–1759, 2001.
62. G.C. Calafiore, F. Dabbene, and R. Tempo. Randomized algorithms for probabilistic robustness with real and complex structured uncertainty. IEEE Transactions on Automatic Control, AC-45:2218–2235, 2000.
63. S. Cambanis, S. Huang, and G. Simons. On the theory of elliptically contoured distributions. Journal of Multivariate Analysis, 11:368–385, 1981.
64. P. Chebychev. Sur les valeurs limites des intégrales. Journal de Mathematique Pure et Appliquee, 19:157–160, 1874.
65. C.-T. Chen. Linear Systems Theory and Design. Oxford University Press, New York, 1999.
66. X. Chen and K. Zhou. Order statistics and probabilistic robust control. Systems & Control Letters, 35:175–182, 1998.
67. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493–507, 1952.
68. R.Y. Chiang and M.G. Safonov. The Robust Control Toolbox. The MathWorks Inc., Natick, 1996.
69. K.L. Chung. A Course on Probability Theory. Academic Press, London, 2001.
70. W.J. Conover. Practical Nonparametric Statistics. Wiley, New York, 1980.
71. S.A. Cook. The complexity of theorem proving procedures. In Proceedings of the ACM Symposium on Theory of Computing, pages 117–128, 1971.
72. R. Couture and P. L’Ecuyer. Special issue on uniform random number generation – editorial. ACM Transactions on Modeling and Computer Simulation, 8:1–2, 1998.
73. T.M. Cover. Geometrical and statistical properties of system of linear inequalities with applications in pattern recognition. IEEE Transactions on Electronic Computers, 14:326–334, 1965.
74. G.E. Coxson and C.L. De Marco. The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix. Mathematics of Control, Signals, and Systems, 7:279–291, 1994.
75. M.A. Dahleh and I.J. Diaz-Bobillo. Control of Linear Systems: A Linear Programming Approach. Prentice-Hall, Englewood Cliffs, 1995.
76. G.B. Dantzig and G. Infanger. Multi-stage stochastic linear programs for portfolio optimization. Annals of Operations Research, 45:59–76, 1993.
77. M. Davis. Hilbert’s tenth problem is unsolvable. Mathematical Monthly, 80:233–269, 1973.
78. P.J. Davis and P. Rabinowitz. Methods of Numerical Integration. Academic Press, New York, 1984.
79. N.G. de Bruijn. On some multiple integrals involving determinants. Journal of the Indian Mathematical Society, 19:133–151, 1955.
80. W.L. Deemer and I. Olkin. The Jacobians of certain matrix transformations useful in multivariate analysis. Biometrika, 38:345–367, 1951.
81. A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Jones and Bartlett, Boston, 1993.
82. J.W. Demmel. The component-wise distance to the nearest singular matrix. SIAM Journal on Matrix Analysis and Applications, 13:10–19, 1992.
83. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, New York, 1996.
84. L.P. Devroye. Non-Uniform Random Variate Generation. Springer-Verlag, New York, 1986.
85. L.P. Devroye. Random variate generation for multivariate unimodal densities. ACM Transactions on Modeling and Computer Simulation, 7:447–477, 1997.
86. P. Diaconis and P. Hanlon. Eigen-analysis for some examples of the Metropolis algorithm. Contemporary Mathematics, 138:99–117, 1992.
87. P. Djavdan, H.J.A.F. Tulleken, M.H. Voetter, H.B. Verbruggen, and G.J. Olsder. Probabilistic robust controller design. In Proceedings IEEE Conference on Decision and Control, pages 2164–2172, 1989.
88. J.L. Doob. Stochastic Processes. Wiley, New York, 1990.
89. P. Dorato, D. Famularo, C.T. Abdallah, and W. Yang. Robust nonlinear feedback design via quantifier elimination theory. International Journal of Robust and Nonlinear Control, 9:817–822, 1999.
90. P. Dorato, Li Kun, E.B. Kosmatopoulos, P.A. Ioannou, and H. Ryaciotaki-Boussalis. Quantified multivariate polynomial inequalities. The mathematics of practical control design problems. IEEE Control Systems Magazine, 20:48– 58, 2000.
91. P. Dorato, R. Tempo, and G. Muscato. Bibliograpy on robust control. Automatica, 29:201–213, 1993.
92. J. Doyle. Analysis of feedback systems with structured uncertainties. IEE Proceedings, 129(D):242–250, 1982.
93. ∞ control problems. IEEE Transactions on Automatic Control, AC-34:831–847, 1989.
94. R.M. Dudley. Central limit theorems for empirical measures. Annals of Probability, 6:899–929, 1978.
95. k do not cut all subsets of k +2 points. Advances in Mathematics, 31:306–308, 1979.
96. R.M. Dudley. A Course on Empirical Processes. Springer-Verlag, New York, 1984.
97. R.M. Dudley. Uniform Central Limit Theorems. Cambridge University Press, Cambridge, 1999.
98. G.E. Dullerud and F. Paganini. A Course in Robust Control Theory: A Convex Approach. Springer-Verlag, New York, 2000.
99. M.E. Dyer, A.M. Frieze, and R. Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38:1–17, 1991.
100. A. Edelman. Eigenvalues and Condition Numbers of Random Matrices. Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge, 1989.
101. A. Edelman, E. Kostlan, and M. Shub. How many eigenvalues of a random matrix are real? Journal of the American Mathematical Society, 7:247–267, 1994.
102. B. Efron and C. Stein. The jackknife estimate of variance. Annals of Statistics, 9:586–596, 1981.
103. L. El Ghaoui and S.-I. Niculescu (editors). Advances in Linear Matrix Inequality Methods in Control. SIAM, New York, 2000.
104. L. El Ghaoui, F. Oustry, and M. AitRami. A cone complementary linearization algorithm for static output-feedback and related problems. IEEE Transactions on Automatic Control, AC-42:1171–1176, 1997.
105. L. El Ghaoui, F. Oustry, and H. Lebret. Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization, 9:33–52, 1998.
106. N. Elia and S.K. Mitter. Stabilization of linear systems with limited information. IEEE Transactions on Automatic Control, AC-46:1384–1400, 2001.
107. A.T. Fam. The volume of the coefficient space stability domain of monic polynomials. In Proceedings International Symposium on Circuits and Systems, pages 1780–1783, 1989.
108. K.T. Fang, S. Kotz, and K.W. Ng. Symmetric Multivariate and Related Distributions. Chapman & Hall, New York, 1990.
109. H. Faure. Discrépance de suites associées à un système de numération (en dimension s). Acta Arithmetica, 41:337–351, 1982.
110. V.N. Fomin. Mathematical Theory of Learning Recognizing Systems. LGU, Leningrad, 1976 (in Russian).
111. A. Frieze, J. Hastad, R. Kannan, J.C. Lagarias, and A. Shamir. Reconstructing truncated linear variables satisfying linear congruences. SIAM Journal on Computing, 17:262–280, 1988.
112. Y. Fujisaki, F. Dabbene, and R. Tempo. Probabilistic robust design of LPV control systems. Automatica, 39:1323–1337, 2003.
113. Y. Fujisaki and Y. Oishi. Guaranteed cost regulator design: Probabilistic solution and randomized algorithm. In Proceedings of the International Symposium on Mathematical Theory of Networks and Systems, 2004.
114. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, Boston, 1990.
115. ∞ synthesis. Automatica, 32:1007–1014, 1996.
116. ∞ control. International Journal of Robust and Nonlinear Control, 4:421–448, 1994.
117. F.R. Gantmacher. The Theory of Matrices. American Mathematical Society, Providence, 1959.
118. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
119. J.E. Gentle. Random Number Generation and Monte Carlo Methods. Springer-Verlag, New York, 1998.
120. V.L. Girko. Theory of Random Determinants. Kluwer, Dordrecht, 1990.
121. K.-C. Goh, M.G. Safonov, and J.H. Ly. Robust synthesis via bilinear matrix inequalities. International Journal of Robust and Nonlinear Control, 6:1079– 1095, 1996.
122. W. Gong and T. Başar. Special issue on systems and control methods for communication networks – editorial. IEEE Transactions on Automatic Control, AC-47:877–879, 2002.
123. M. Green and D.J.N. Limebeer. Linear Robust Control. Prentice-Hall, Englewood Cliffs, 1995.
124. A.K. Gupta and D.K. Nagar. Matrix Variate Distributions. CRC Press, Boca Raton, 1999.
125. A.K. Gupta and D. Song. Characterization of p-generalized normality. Journal of Multivariate Analysis, 60:61–71, 1997.
126. J.H. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numerische Mathematik, 2:84–90, 1960; Berichtigung, ibid., 2:196, 1960.
127. W.K. Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57:97–109, 1970.
128. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100:78– 150, 1992.
129. P. Hellekalek. Good random number generators are (not so) easy to find. Mathematics and Computers in Simulation, 46:487–507, 1998.
130. P. Hellekalek and G. Larcher (editors). Random and Quasi-Random Point Sets. Springer-Verlag, New York, 1998.
131. R. Hernandez and S. Dormido. Kharitonov’s theorem extension to interval polynomials which can drop in degree: a Nyquist approach. IEEE Transactions on Automatic Control, AC-41:1009–1012, 1996.
132. J.S. Hicks and R.F. Wheeling. An efficient method for generating uniformly distributed points on the surface of an n-dimensional sphere. Communications of the ACM, 2:17–19, 1959.
133. D. Hinrichsen and A.J. Pritchard. Stability radii of linear systems. Systems & Control Letters, 7:1–10, 1986.
134. E. Hlawka. Funktionen von beschränkter variation in der Theorie der Gle-ichverteilung. Annali di Matematica Pura e Applicata, 61:325–333, 1954.
135. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13–30, 1963.
136. H.P. Horisberger and P.R. Belanger. Regulators for linear time invariant plants with uncertain parameters. IEEE Transactions on Automatic Control, AC-21:705–708, 1976.
137. R.A. Horn and C.R. Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991.
138. I. Horowitz. Survey of quantitative feedback theory (QFT). International Journal of Control, 53:255–291, 1991.
139. C.H. Houpis and S.J. Rasmussen. Quantitative Feedback Theory. Marcel Dekker, New York, 1999.
140. L.K. Hua. Harmonic Analysis of Functions of Several Complex Variables in the Classical Domains. American Mathematical Society, Providence, 1979.
141. H. Ishii, T. Başar, and R. Tempo. Randomized algorithms for quadratic stability of quantized sampled-data systems. Automatica, 40:839–846, 2004.
142. H. Ishii and B.A. Francis. Limited Data Rate in Control Systems with Networks. Springer-Verlag, New York, 2002.
143. ∞ control problem: LMI existence conditions and state-space formulas. Automatica, 30:1307– 1317, 1994.
144. M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Approximation algorithms for NP-hard problems (D.S. Hochbaum editor), pages 482–520. PWS Publishing, Boston, 1996.
145. U. Jönsson and A. Rantzer. Optimization of integral quadratic constraints. In Advances in Linear Matrix Inequality Methods in Control (L. El Ghaoui and S.-I. Niculescu editors), pages 109–127. SIAM, New York, 2000.
146. S. Kaczmarz. Angenäherte Aufslösung von Systemen linearer Gleichunger. Bulletin International de l’Academie Polonaise des Sciences, Lett. A:355–357, 1937 (English translation: Approximate solution of systems of linear equations. International Journal of Control, 57:1269-1271, 1993).
147. A.A. Kale and A.L. Tits. On Kharitonov’s theorem without invariant degree assumption. Automatica, 36:1075–1076, 2000.
148. S. Kanev, B. De Schutter, and M. Verhaegen. An ellipsoid algorithm for probabilistic robust controller design. Systems & Control Letters, 49:365–375, 2003.
149. 5) volume algorithm for convex bodies. Random Structures and Algorithms, 11:1– 50, 1997.
150. M. Karpinski and A. Macintyre. Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks. Journal of Computational System Science, 54:169–176, 1997.
151. L.H. Keel and S.P. Bhattacharyya. A linear programming approach to controller design. In Proceedings IEEE Conference on Decision and Control, pages 2139–2148, 1997.
152. F.P. Kelly, A.K. Maulloo, and D.K.H. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237–252, 1998.
153. L.G. Khachiyan. The problem of computing the volume of polytopes is NP-hard. Uspekhi Mat. Nauk, 44:179–180, 1989 (in Russian).
154. P. Khargonekar and A. Tikku. Randomized algorithms for robust control analysis and synthesis have polynomial complexity. In Proceedings IEEE Conference on Decision and Control, pages 3470–3475, 1996.
155. ∞ control theory. IEEE Transactions on Automatic Control, AC-35:356–361, 1990.
156. V.L. Kharitonov. Asymptotic stability of an equilibrium position of a family of systems of linear differential equations. Differentsial’nye Uravneniya, 14:2086– 2088, 1978 (in Russian).
157. ∞ Control. Birkhäuser, Boston, 1997.
158. D.E. Knuth. The Art of Computer Programming, volume 2, Seminumerical Algorithms. Addison-Wesley, Reading, 1981.
159. J.F. Koksma. Een algemeene stelling uit de theorie der gelijkmatige verdeeling modulo 1. Mathematica B (Zutphen), 11:7–11, 1942-1943.
160. V. Koltchinskii, C.T. Abdallah, M. Ariola, P. Dorato, and D. Panchenko. Improved sample complexity estimates for statistical learning control of uncertain systems. IEEE Transactions on Automatic Control, AC-46:2383–2388, 2000.
161. 2-gain controllers for LPV systems. IEEE Transactions on Automatic Control, AC-43:1302–1307, 1998.
162. M.V. Kothare, V. Balakrishnan, and M. Morari. Robust constrained model predictive control using linear matrix inequalities. Automatica, 32:1361–1379, 1996.
163. H.J. Kushner and G.G. Yin. Stochastic Approximation and Recursive Algorithms and Applications. Springer-Verlag, New York, 2003.
164. H. Kwakernaak. Special issue on robust control – editorial. Automatica, 29:3, 1993.
165. H. Kwakernaak and R. Sivan. Linear Optimal Control Systems. Wiley, New York, 1972.
166. H. Kwakernaak and R. Sivan. Modern Signals and Systems. Prentice-Hall, Englewood Cliffs, 1991.
167. C.M. Lagoa and B.R. Barmish. Distributionally robust Monte Carlo simulation: A tutorial survey. In Proceedings of the IFAC World Congress, pages 1327–1338, 2002.
168. C.M. Lagoa, P.S. Shcherbakov, and B.R. Barmish. Probabilistic enhancement of classical robustness margins: the unirectangularity concept. Systems & Control Letters, 35:31–43, 1998.
169. ∞ controller in the chain-scattering framework. Automatica, 40:985–994, 2004.
170. P. L’Ecuyer. Uniform random number generation. Annals of Operations Research, 53:77–120, 1994.
171. P. L’Ecuyer, F. Blouin, and R. Couture. A search for good multiple recursive random number generators. ACM Transactions on Modeling and Computer Simulation, 3:87–98, 1993.
172. D.H. Lehmer. Mathematical methods in large-scale computing units. In Proceedings of the Second Symposium on Large-Scale Digital Calculation Machinery, pages 141–146, 1951.
173. D.J. Leith and W.E. Leithead. Survey of gain-scheduling analysis and design. International Journal of Control, 73:1001–1025, 2000.
174. L. Lovász. Random walks on graphs: a survey. In Combinatorics, Paul Erdös is Eighty (D. Miklós, V. T. Sós and T. Szönyi editors), pages 353–398. János Bolyai Mathematical Society, Budapest, 1996.
175. L. Lovász. Hit-and-run mixes fast. Mathematical Programming, 86:443–461, 1999.
176. L. Lovász, M. Grötschel, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York, 1993.
177. G. Lugosi. Pattern classification and learning theory. In Principles of nonparametric learning (L. Györfi editor), pages 1–56. Springer-Verlag, New York, 2002.
178. A.J. Macintyre and E.D. Sontag. Finiteness results for sigmoidal “neural” networks. In Proceedings of the ACM Symposium on Theory of Computing, pages 325–334, 1993.
179. M. Mansour. Discrete-time and sampled-data stability tests. In The Control Handbook (W.S. Levine editor), pages 146–151. CRC Press, Boca Raton, 1996.
180. A. Markov. On Certain Applications of Algebraic Continued Fractions. Ph.D. Dissertation, St Petersburg, 1884 (in Russian).
181. A. Marshall and I. Olkin. Multivariate Chebyshev inequalities. Annals of Mathematical Statistics, 31:1001–1014, 1960.
182. I. Masubuchi, A. Ohara, and N. Suda. LMI-based controller synthesis: A unified formulation and solution. International Journal of Robust and Nonlinear Control, 8:669–686, 1998.
183. Yu. Matiyasevich. Enumerable sets are Diophantine. Doklady Akademii Nauk SSSR, 191:279–282, 1970 (in Russian).
184. M. Matsumoto and T. Nishimura. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8:3–30, 1998.
185. A. Megretski and A. Ranzer. System analysis via integral quadratic constraints. IEEE Transactions on Automatic Control, AC-42:819–830, 1997.
186. M.L. Mehta. Random Matrices. Academic Press, Boston, 1991.
187. K.L. Mengersen and R.L. Tweedie. Rates of convergence of the Hastings and Metropolis algorithms. Annals of Statistics, 24:101–121, 1996.
188. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A. Teller, and H. Teller. Equations of state calculations by fast computing machines. Journal of Chemical Physics, 21:1087–1091, 1953.
189. N. Metropolis and S.M. Ulam. The Monte Carlo method. Journal of the American Statistical Association, 44:335–341, 1949.
190. S.P. Meyn and R.L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, New York, 1996.
191. R.J. Minnichelli, J.J. Anagnost, and C.A. Desoer. An elementary proof of Kharitonov’s stability theorem with extensions. IEEE Transactions on Automatic Control, AC-34:995–998, 1989.
192. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
193. T.S. Motzkin and I.J. Schoenberg. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6:393–404, 1954.
194. M.E. Muller. A note on a method for generating random points uniformly distributed on n-dimensional spheres. Communications of the ACM, 2:19–20, 1959.
195. K. Mulmuley. Computational Geometry: An Introduction through Randomiza-tion Algorithms. Prentice-Hall, Englewood Cliffs, 1994.
196. A. Nemirovski. Several NP-hard problems arising in robust stability analysis. Mathematics of Control, Signals, and Systems, 6:99–195, 1993.
197. A. Nemirovski. On tractable approximations of randomly perturbed convex constraints. In Proceedings IEEE Conference on Decision and Control, pages 2419–2422, 2003.
198. A.S. Nemirovski and D.B. Yudin. Problem Complexity and Method Efficiency in Optimization. Wiley, New York, 1983.
199. Y. Nesterov and A.S. Nemirovski. Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994.
200. Y. Nesterov and J.-Ph. Vial. Confidence level solutions for stochastic programming. Technical Report, Université Catholique de Louvain, 2000.
201. M.P. Newlin and P.M.Young. Mixed µ problems and branch and bound techniques. International Journal of Robust and Nonlinear Control, 7:145–164, 1997.
202. H. Niederreiter. Point sets and sequences with small discrepancy. Monatshefte für Mathematik, 104:273–337, 1987.
203. H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, 1992.
204. H. Niederreiter. New developments in uniform pseudorandom number and vector generation. In Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P.J.-S. Shiue editors), pages 87–120. Springer-Verlag, New York, 1995.
205. H. Niederreiter. Some current issues in quasi-Monte Carlo methods. Journal of Complexity, 23:428–433, 2003.
206. Y. Oishi. Probabilistic design of a robust state-feedback controller based on parameter-dependent Lyapunov functions. In Proceedings IEEE Conference on Decision and Control, pages 1920–1925, 2003.
207. Y. Oishi and H. Kimura. Model-set identification based on learning-theoretic inequalities. In Proceedings of the IFAC World Congress, 2002.
208. Y. Oishi and H. Kimura. Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. Automatica, 39:2149–2156, 2003.
209. I. Olkin. Note on the Jacobians of certain matrix transformations useful in multivariate analysis. Biometrika, 40:43–46, 1953.
210. I.S. Pace and S. Barnett. Numerical comparison of root-location algorithms for constant linear systems. In Recent Mathematical Developments in Control (D.J. Bell editor), pages 373–392. Academic Press, London, 1973.
211. A. Packard and J. Doyle. The complex structured singular value. Automatica, 29:71–109, 1993.
212. 2 analysis: a survey with comparisons. In Advances in Linear Matrix Inequality Methods in Control (L. El Ghaoui and S.-I. Niculescu editors), pages 129–151. SIAM, New York, 2000.
213. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, 1994.
214. A. Papoulis and S.U. Pillai. Probability, Random Variables and Stochastic Processes. McGraw-Hill, New York, 2002.
215. I.R. Petersen and D.C. McFarlane. Optimal guaranteed cost control and filtering for uncertain linear systems. IEEE Transactions on Automatic Control, AC-39:1971–1977, 1994.
216. S. Poljak and J. Rohn. Checking robust nonsingularity is NP-hard. Mathematics of Control, Signals, and Systems, 6:1–9, 1993.
217. D. Pollard. Convergence of Stochastic Processes. Springer-Verlag, New York, 1984.
218. D. Pollard. Empirical Processes: Theory and Applications, volume 2. NSF-CBMS Regional Conference Series in Probability and Statistics, Institute of Mathematical Statistics, 1990.
219. B.T. Polyak. Gradient methods for solving equations and inequalities. Zh. Vychisl. Mat. i Mat. Fiz., 4:995–1005, 1964 (in Russian).
220. B.T. Polyak and P.S. Shcherbakov. Random spherical uncertainty in estimation and robustness. IEEE Transactions on Automatic Control, AC-45:2145– 2150, 2000.
221. B.T. Polyak and R. Tempo. Probabilistic robust design with linear quadratic regulators. Systems & Control Letters, 43:343–353, 2001.
222. I. Popescu. Applications of Optimization in Probability, Finance and Revenue Management. Ph.D. Dissertation, Massachusetts Institute of Technology, Cambridge, 1999.
223. A. Prékopa. Stochastic Programming. Kluwer, Dordrecht, 1995.
224. L. Qiu, B. Bernhardsson, A. Rantzer, E.J. Davison, P.M. Young, and J.C. Doyle. A formula for computation of the real stability radius. Automatica, 31:879–890, 1995.
225. L.R. Ray and R.F. Stengel. A Monte Carlo approach to the analysis of control system robustness. Automatica, 29:229–236, 1993.
226. R. Reemtsen and J.-J. Rückmann (editors). Semi-Infinite Programming. Kluwer, Dordrecht, 1998.
227. R.Y. Rubinstein. Monte-Carlo Optimization, Simulation and Sensitivity of Queueing Networks. Wiley, New York, 1986.
228. W.J. Rugh. Linear System Theory. Prentice-Hall, Upper Saddle River, 1996.
229. W.J. Rugh and J.S. Shamma. Research on gain-scheduling. Automatica, 36:1401–1425, 2000.
230. M.G. Safonov. Stability margins of diagonally perturbed multivariable feedback systems. IEE Proceedings, 129(D):251–256, 1982.
231. M.G. Safonov and M.K.H. Fan. Special issue on multivariable stability margin – editorial. International Journal of Robust and Nonlinear Control, 7:97–103, 1997.
232. ∞ output feedback control problems. Systems & Control Letters, 14:13–24, 1990.
233. N. Sauer. On the density of families of sets. Journal of Combinatorial Theory, 13(A):145–147, 1972.
234. ∞ -Optimal Control. Ph.D. Dissertation, University of Würzburg, 1990.
235. ∞ control. In Trends in Control: A European Perspective (A. Isidori editor), pages 173–216. Springer-Verlag, New York, 1995.
236. C. Scherer, P. Gahinet, and M. Chilali. Multiobjective output feedback control via LMI optimization. IEEE Transactions on Automatic Control, AC-42:896– 911, 1997.
237. ∞ control for plants with zeros on the imaginary axis. SIAM Journal on Control and Optimization, 30:123–142, 1992.
238. ∞ optimization without assumptions on finite or infinte zeros. SIAM Journal on Control and Optimization, 30:143–166, 1992.
239. C.W. Scherer. LPV control and full block multipliers. Automatica, 37:361–375, 2001.
240. A. Schrijver. Theory of Linear and Integer Programming. Wiley, New York, 1998.
241. F.C. Schweppe. Uncertain Dynamical Systems. Prentice-Hall, Englewood Cliffs, 1973.
242. A. Seidenberg. A new decision method for elementary algebra. Annals of Mathematics, 60:365–374, 1954.
243. A. Selberg. Bemerkninger om et multiplet integral. Norsk Matematisk Tidsskrift, 26:71–78, 1944.
244. R.E. Skelton, T. Iwasaki, and K.M. Grigoriadis. A Unified Algebraic Approach to Linear Control Design. Taylor & Francis, London, 1998.
245. S. Skogestad and I. Postlethwaite. Multivariable Feedback Control: Analysis and Design. Wiley, New York, 1996.
246. R.L. Smith. Efficient Monte-Carlo procedures for generating points uniformly distributed over bounded regions. Operations Research, 32:1296–1308, 1984.
247. G.W. Snedecor and W.G. Cochran. Statistical Methods. Iowa State Press, Ames, 1989.
248. I.M. Sobol’. The distribution of points in a cube and the approximate evaluation of integrals. Zh. Vychisl. Mat. i Mat. Fiz., 7:784–802, 1967 (in Russian).
249. p-norm uniform distribution. Proceedings of the American Mathematical Society, 125:595–601, 1997.
250. E.D. Sontag. VC dimension of neural networks. In Neural Networks and Machine Learning (C.M. Bishop editor). Springer-Verlag, New York, 1998.
251. J.C. Spall. Estimation via Markov chain Monte Carlo. IEEE Control Systems Magazine, 23:34–45, 2003.
252. R.F. Stengel. Some effects of parameter variations on the lateral-directional stability of aircraft. AIAA Journal of Guidance and Control, 3:124–131, 1980.
253. R.F. Stengel. Stochastic Optimal Control: Theory and Application. Wiley, New York, 1986.
254. G.W. Stewart. The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM Journal on Numerical Analysis, 17:403–409, 1980.
255. T.J. Stieltjes. Recherches sur les fractions continues. Annales de la Faculté de Sciences de Toulouse, 8:1–122, 1894.
256. T.J. Stieltjes. Recherches sur les fractions continues. Annales de la Faculté de Sciences de Toulouse, 9:5–47, 1895.
257. A.G. Sukharev. Optimal strategies of the search for an extremum. Zh. Vychisl. Mat. i Mat. Fiz., 11:910–924, 1971 (in Russian).
258. 2 performance analysis. Automatica, 38:957–966, 2002.
259. ∞ control problems. IEEE Transactions on Automatic Control, AC-45:2095–2101, 2000.
260. M. Talagrand. New concentration inequalities in product spaces. Inventiones Mathematicae, 126:505–563, 1996.
261. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 1951.
262. R.C. Tausworthe. Random numbers generated by linear recurrence modulo two. Mathematics of Computation, 19:201–209, 1965.
263. R. Tempo, E.-W. Bai, and F. Dabbene. Probabilistic robustness analysis: explicit bounds for the minimum number of samples. In Proceedings IEEE Conference on Decision and Control, pages 3424–3428, 1996.
264. R. Tempo, E.-W. Bai, and F. Dabbene. Probabilistic robustness analysis: explicit bounds for the minimum number of samples. Systems & Control Letters, 30:237–242, 1997.
265. R. Tempo and F. Blanchini. Robustness analysis with real parametric uncertainty. In The Control Handbook (W.S. Levine editor), pages 495–505. CRC Press, Boca Raton, 1996.
266. M.J. Todd. Semidefinite optimization. Acta Numerica, 10:515–560, 2001.
267. O. Toker. On the complexity of the robust stability problem for linear parameter varying systems. Automatica, 33:2015–2017, 1997.
268. O. Toker. On the complexity of purely complex µ computation and related problems in multidimensional systems. IEEE Transactions on Automatic Control, AC-43:409–414, 1998.
269. Y.L. Tong. Probability Inequalities in Multivariate Distributions. Academic Press, New York, 1980.
270. J.F. Traub, G.W. Wasilkowski, and H. Woźniakowski. Information-Based Complexity. Academic Press, New York, 1988.
271. J.F. Traub and A.G. Werschulz. Complexity and Information. Cambridge University Press, Cambridge, 1998.
272. J.G. Truxal. Control systems - some unusual design problems. In Adaptive Control Systems (E. Mishkin and L. Braun editors), pages 91–118. McGraw-Hill, New York, 1961.
273. J.S. Tyler and F.B. Tuteur. The use of a quadratic performance index to design multivariable invariant plants. IEEE Transactions on Automatic Control, AC-11:84–92, 1966.
274. V.A. Ugrinovskii. Randomized algorithms for robust stability and guaranteed cost control of stochastic jump parameter systems with uncertain switching policies. Journal of Optimization Theory and Applications, 2004, in press.
275. S. Uryasev (editor). Probabilistic Constrained Optimization: Methodology and Applications. Kluwer, New York, 2000.
276. J.V. Uspensky. Introduction to Mathematical Probability. McGraw-Hill, New York, 1937.
277. J.G. van der Corput. Verteilungsfunktionen i, ii. Nederl. Akad. Wetensch. Proceedings, 38(B):813–821, 1058–1066, 1935.
278. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38:49–95, 1996.
279. V.N. Vapnik. Statistical Learning Theory. Wiley, New York, 1996.
280. V.N. Vapnik and A.Ya. Chervonenkis. On the uniform convergence of relative frequencies to their probabilities. Theory of Probability and Its Applications, 16:264–280, 1971.
281. R. Vein and P. Dale. Determinants and their Applications in Mathematical Physics. Springer-Verlag, New York, 1999.
282. M. Vidyasagar. Statistical learning theory and randomized algorithms for control. IEEE Control Systems Magazine, 18:69–85, 1998.
283. M. Vidyasagar. Randomized algorithms for robust controller synthesis using statistical learning theory. Automatica, 37:1515–1528, 2001.
284. M. Vidyasagar. Learning and Generalization: With Applications to Neural Networks. Springer-Verlag, New York, 2002.
285. M. Vidyasagar and V. Blondel. Probabilistic solutions to some NP-hard matrix problems. Automatica, 37:1397–1405, 2001.
286. J. von Neumann. Various techniques used in connection with random digits. U.S. Nat. Bur. Stand. Appl. Math. Ser., pages 36–38, 1951.
287. R.S. Wenocur and R.M. Dudley. Some special Vapnik–Chervonenkis classes. Discrete Mathematics, 33:313–318, 1981.
288. J.C. Willems and R. Tempo. The Kharitonov theorem with degree drop. IEEE Transactions on Automatic Control, AC-44:2218–2220, 1999.
289. F. Wu and K.M. Grigoriadis. LPV systems with parameter-varying time delays: analysis and control. Automatica, 37:221–229, 2001.
290. 2 control. In Advances in Linear Matrix Inequality Methods in Control (L. El Ghaoui and S.-I. Niculescu editors), pages 155–174. SIAM, New York, 2000.
291. D.C. Youla and M. Saito. Interpolation with positive-real functions. Journal of the Franklin Institute, 284:77–108, 1967.
292. P.M. Young. The rank one mixed µ problem and “Kharitonov-type” analysis. Automatica, 30:1899–1911, 1994.
293. G. Zames. Feedback and optimal sensitivity: model reference transformations, multiplicative seminorms and approximate inverses. IEEE Transactions on Automatic Control, AC-26:301–320, 1981.
294. A.A. Zhigljavsky. Theory of Global Random Search. Kluwer, Dordrecht, 1991.
295. K. Zhou, J.C. Doyle, and K. Glover. Robust and Optimal Control. Prentice-Hall, Upper Saddle River, 1996.
296. G. Zhu, M.A. Rotea, and R. Skelton. A convergent algorithm for the output covariance constraint control problem. SIAM Journal on Control and Optimization, 35:341–361, 1997.
297. K. Zyczkowski and M. Kus. Random unitary matrices. Journal of Physics, 27:4235–4245, 1994.