The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Analysis of linear systems with saturation using convex optimization
Abstract
We show how linear matrix inequalities (LMI) can be used to perform local stability and performance analysis of linear systems with saturating elements. This leads to less conservative information on stability regions, disturbance rejection, and L/sub 2/-gain than standard global stability and performance analysis. The circle and Popov criteria are used to obtain Lyapunov functions whose sublevel sets provide regions of guaranteed stability and performance within a restricted state space region. Our LMI formulation leads directly to simple convex optimization problems that can be solved efficiently as semidefinite programs. The results cover both single and multiple saturation elements and can be immediately extended to discrete time systems. An obvious application of these techniques is in the analysis of control systems with saturating control inputs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Gilbert, É., & Tan, K. T. (1991) · IEEE Transactions on Automatic Control · doi:10.1109/9.83532 · Cited by 1,567
Linear controller design: limits of performance
Boyd, S., & Barratt, C. H. (1991) · Prentice-Hall, Inc eBooks · Cited by 1,196
Self-citationDeterminant Maximization with Linear Matrix Inequality Constraints
Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896303430 · Cited by 652
Self-citationMaximal lyapunov functions and domains of attraction for autonomous nonlinear systems
Vannelli, A., & Vidyasagar, M. (1985) · Automatica · doi:10.1016/0005-1098(85)90099-8 · Cited by 342
Studies in Applied Mathematics
(2010) · Studies in Applied Mathematics · doi:10.1111/(issn)1467-9590 · Cited by 331
Linear and Nonlinear Programming
Solow, D. (2007) · Wiley eBooks · doi:10.1002/9780470050118.ecse219 · Cited by 179
Cited by
Stability Analysis and Stabilization of Systems Presenting Nested Saturations
Tarbouriech, S., Prieur, C., & Gomes Da Silva, J. M. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878743 · Cited by 285
Metadata
- Authors
- Hindi, H., & Boyd, S.
- Venue
- Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171)
- Publisher
- IEEE
- Published
- 2002-11-27
- Volume
- 1
- Pages
- 903-908
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2113377036
- Cited by
- 373
- References
- 6
- FWCI
- 34.64
- Type
- conference paper
- 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: Analysis of linear systems with saturation using convex optimization. https://app.cochat.ai/papers/10.1109/cdc.1998.760808
- The paper
- Hindi, H., & Boyd, S. (2002). Analysis of linear systems with saturation using convex optimization. Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171). https://doi.org/10.1109/cdc.1998.760808
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.
