The DOI matches its Crossref record.
Robust and reduced-order filtering: new LMI-based characterizations and methods
Abstract
This paper addresses several challenging problems of robust filtering. We derive new linear matrix inequality (LMI) characterizations of minimum variance or H/sub 2/ performance and demonstrate that they allow the use of parameter-dependent Lyapunov functions while preserving tractability of the problem. The resulting conditions are less conservative than earlier techniques, which are restricted to fixed (not parameter-dependent) Lyapunov functions. The remainder of the paper discusses reduced-order filter problems. New LMI-based nonconvex optimization formulations are introduced for the existence of reduced-order filters, and several efficient optimization algorithms of local and global optimization are proposed. Nontrivial and less conservative relaxation techniques are presented as well. The viability and efficiency of the proposed approaches are then illustrated through computational experiments and comparisons with existing methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Disciplined Convex Programming
Grant, M., Boyd, S., & Ye, Y. (2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9_7 · Cited by 1,026
${\cal H}_{\infty}$ Estimation for Uncertain Systems With Limited Communication Capacity
Gao, H., & Chen, T. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.908316 · Cited by 583
Metadata
- Authors
- Tuan, H. D., Apkarian, P., & Nguyen, T. Q.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2001
- Volume
- 49
- Issue
- 12
- Pages
- 2975-2984
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2121679811
- Cited by
- 208
- References
- 0
- FWCI
- 10.97
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust and reduced-order filtering: new LMI-based characterizations and methods. https://app.cochat.ai/papers/10.1109/78.969506
- The paper
- Tuan, H. D., Apkarian, P., & Nguyen, T. Q. (2001). Robust and reduced-order filtering: new LMI-based characterizations and methods. IEEE Transactions on Signal Processing. https://doi.org/10.1109/78.969506
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.