The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
52nd IEEE Conference on Decision and Control
Abstract
We study the inverse problem of reproducing partially known second-order statistics of a linear time invariant system by the least number of possible input disturbance channels.This can be formulated as a rank minimization problem, and for its solution, we employ a convex relaxation based on the nuclear norm.The resulting optimization problem can be cast as a semi-definite program and solved efficiently using generalpurpose solvers for small-and medium-size problems.In this paper, we focus on issues and techniques that are pertinent to large-scale systems.We bring in a re-parameterization which transforms the problem into a form suitable for the alternating direction method of multipliers.Furthermore, we show that each iteration of this algorithm amounts to solving a system of linear equations, an eigenvalue decomposition, and a singular value thresholding.An illustrative example is provided to demonstrate the effectiveness of the developed approach.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Toh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Tao, M., & Yuan, X. (2011) · SIAM Journal on Optimization · doi:10.1137/100781894 · Cited by 453
Cited by
Control of connected and automated vehicles: State of the art and future challenges
Guanetti, J., Kim, Y., & Borrelli, F. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.04.011 · Cited by 643
Online capacity estimation of lithium-ion batteries with deep long short-term memory networks
Li, W., Sengupta, N., Dechent, P., Howey, D., Annaswamy, A., & Sauer, D. U. (2021) · Journal of Power Sources · doi:10.1016/j.jpowsour.2020.228863 · Cited by 362
Battery internal temperature estimation by combined impedance and surface temperature measurement
Richardson, R. R., Ireland, P. T., & Howey, D. A. (2014) · Journal of Power Sources · doi:10.1016/j.jpowsour.2014.04.129 · Cited by 284
Khodadadi Sadabadi, K., Jin, X., & Rizzoni, G. (2021) · Journal of Power Sources · doi:10.1016/j.jpowsour.2020.228861 · Cited by 266
Lechl, M., Fürmann, T., de Meer, H., & Weidlich, A. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.113570 · Cited by 34
Metadata
- Publisher
- IEEE
- Published
- 2013
- OpenAlex
- W644929910
- Cited by
- 452
- References
- 12
- Type
- paratext
- 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: 52nd IEEE Conference on Decision and Control. https://app.cochat.ai/papers/10.1109/cdc20427.2013
- The paper
- 52nd IEEE Conference on Decision and Control. (2013). https://doi.org/10.1109/cdc20427.2013
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.