𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sample complexity of worst-case H∞-identification

✍ Scribed by K.J. Harrison; J.A. Ward; D.K. Gamble

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
311 KB
Volume
27
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst Case Complexity of Problems with R
Worst Case Complexity of Problems with Random Information Noise
✍ Leszek Plaskota 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 326 KB

We study the worst case complexity of solving problems for which information is partial and contaminated by random noise. It is well known that if information is exact then adaption does not help for solving linear problems, i.e., for approximating linear operators over convex and symmetric sets. On

Worst case complexity of multivariate Fe
Worst case complexity of multivariate Feynman–Kac path integration
✍ Marek Kwas; Youming Li 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 184 KB

We study the multivariate Feynman-Kac path integration problem. This problem was studied in Plaskota et al. (J. Comp. Phys. 164 (2000) 335) for the univariate case. We describe an algorithm based on uniform approximation, instead of the L 2 -approximation used in Plaskota et al. (2000). Similarly to

Worst-case identification of nonlinear f
Worst-case identification of nonlinear fading memory systems
✍ Munther A. Dahleh; Eduardo D. Sontag; David N.C. Tse; John N. Tsitsiklis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB

In this paper, the problem of asymptotic identification for fading memory systems in the presence of bounded noise is studied. For any experiment, the worst-case error is characterized in terms of the diameter of the worst-case uncertainty set. Optimal inputs that minimize the radius of uncertainty