Properties of least squares estimates in set membership identification
From MaRDI portal
(Redirected from Publication:1891002)
Recommendations
- The least squares algorithm, parametric system identification and bounded noise
- On the worst-case divergence of the least-squares algorithm
- Membership set estimators: size, optimal inputs, complexity and relations with least squares
- Worst-case analysis of the least-squares method and related identification methods
- Comments on "Least squares methods for H/spl infin/ control oriented system identification"
Cites work
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Control oriented system identification: a worst-case/deterministic approach in H/sub infinity /
- Estimation theory and uncertainty intervals evaluation in presence of unknown but bounded errors: Linear families of models and estimators
- Exact recursive polyhedral description of the feasible parameter set for bounded-error models
- Hard frequency-domain model error bounds from least-squares like identification techniques
- scientific article; zbMATH DE number 3137662 (Why is no real title available?)
- scientific article; zbMATH DE number 4067100 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 49337 (Why is no real title available?)
- scientific article; zbMATH DE number 3997615 (Why is no real title available?)
- scientific article; zbMATH DE number 806815 (Why is no real title available?)
- Information-based complexity and nonparamteric worst-case system identification
- Linear and nonlinear algorithms for identification in H/sub infinity / with error bounds
- Optimal algorithms theory for robust estimation and prediction
- Optimal estimation theory for dynamic systems with set membership uncertainty: An overview
- Optimality of central and projection algorithms for bounded uncertainty
- Parameter-bounding identification algorithms for bounded-noise records
- Robust identification and Galois sequences
- The least squares algorithm, parametric system identification and bounded noise
- The modeling of uncertainty in control systems. Proceedings of the 1992 Santa Barbara Workshop held at the University of California, Santa Barbara, CA, USA, June 18-20, 1992
- The sample complexity of worst-case identification of FIR linear systems
Cited in
(15)- On the worst-case divergence of the least-squares algorithm
- The least squares algorithm, parametric system identification and bounded noise
- The least-squares identification of FIR systems subject to worst-case noise
- Asymptotic properties of set membership identification algorithms
- Model quality evaluation in set membership identification
- Analysis of linear methods for robust identification in \(\ell_ 1\)
- Estimation of model quality
- A new look at least-squares dynamic system identification
- \(L_\infty\) parameter identification based on linear programming recursive algorithm
- Membership set estimators: size, optimal inputs, complexity and relations with least squares
- Finite sample properties of linear model identification
- Set membership approach for reducing value sets in the frequency domain
- Least squares type algorithms for identification in the presence of modeling uncertainty
- Worst-case performance analysis in \(\ell_1\)-norm for an automated heavy vehicle platoon
- Chebyshev centers and radii for sets induced by quadratic matrix inequalities
This page was built for publication: Properties of least squares estimates in set membership identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891002)
