Worst-case identification in _ 2: Linear and nonlinear algorithms
From MaRDI portal
(Redirected from Worst-case identification in _ 2: Linear and nonlinear algorithms)
Worst-case identification in \(\ell 2\): Linear and nonlinear algorithms
Worst-case identification in \(\ell 2\): Linear and nonlinear algorithms
Recommendations
- Worst-case errors of linear algorithms for identification in H
- scientific article; zbMATH DE number 5773500
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
- scientific article; zbMATH DE number 926789
- Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
- Worst-case analysis of the least-squares method and related identification methods
- Worst-case identification in Banach spaces
- Worst case system identification in H/sub ∞/: validation of a priori information, essentially optimal algorithms, and error bounds
- The sample complexity of worst-case identification of FIR linear systems
- Worst-case/deterministic identification in H/sub infinity /: the continuous-time case
Cites work
- Algorithms for identification in H∞with unequally spaced function measurements
- scientific article; zbMATH DE number 4043735 (Why is no real title available?)
- scientific article; zbMATH DE number 806815 (Why is no real title available?)
- scientific article; zbMATH DE number 3380412 (Why is no real title available?)
- Interpolation in Normed Spaces from the Values of Linear Functionals
- Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
- On a Polynomial of Byrnes
- On Polynomials ∑±nzm,∑eαminzm,z=e0i
- On the Minimum Modulus of Trigonometric Polynomials
- On the time complexity of worst-case system identification
- Robust identification and Galois sequences
- Robust identification and interpolation in H∞
- Robust identification in \(H_{\infty{}}\)
- Sur Les Polynomes a Coefficients Unimodulaires
- The Minimum Modulus of Polynomials
- The Minimum Modulus of Polynomials with Coefficients of Modulus One
- The sample complexity of worst-case identification of FIR linear systems
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
- Worst-case analysis of identification-BIBO robustness for closed-loop data
Cited in
(15)- On the worst-case divergence of the least-squares algorithm
- Worst case system identification in \(\ell{}_ 1\): Optimal algorithms and error bounds
- Complexity of identification of linear systems with rational transfer functions
- The least-squares identification of FIR systems subject to worst-case noise
- Sample complexity of worst-case H^-identification
- The sample complexity of worst-case identification of FIR linear systems
- Worst-case identification of nonlinear fading memory systems
- Analysis of linear methods for robust identification in \(\ell_ 1\)
- Estimation of model quality
- scientific article; zbMATH DE number 5773500 (Why is no real title available?)
- Shake-and-bake algorithms for the identification of nonredundant linear inequalities
- Robust identification and Galois sequences
- scientific article; zbMATH DE number 926789 (Why is no real title available?)
- Worst-case analysis of the least-squares method and related identification methods
- Convergence analysis of central and minimax algorithms in scalar regressor models
This page was built for publication: Worst-case identification in \(\ell_ 2\): Linear and nonlinear algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1316084)
