The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
Abstract
We introduce a flexible optimization framework for nuclear norm minimization of matrices with linear structure, including Hankel, Toeplitz, and moment structures and catalog applications from diverse fields under this framework. We discuss various first-order methods for solving the resulting optimization problem, including alternating direction methods of multipliers, proximal point algorithms, and gradient projection methods. We perform computational experiments to compare these methods on system identification problems and system realization problems. For the system identification problem, the gradient projection method (accelerated by Nesterov's extrapolation techniques) and the proximal point algorithm usually outperform other first-order methods in terms of CPU time on both real and simulated data, for small and large regularization parameters, respectively, while for the system realization problem, the alternating direction method of multipliers, as applied to a certain primal reformulation, usually outperforms other first-order methods in terms of CPU time. We also study the convergence of the proximal alternating direction methods of multipliers used in this paper.
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
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
System Identification: Theory for the User
Lennart Ljung, A. (1987) · Cited by 17,690
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
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
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
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
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
Self-citationProceedings of the 1999 American Control Conference
(1999) · Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251) · doi:10.1109/acc.1999.782304 · Cited by 2,898
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Candes, E. J., & Plan, Y. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2035722 · Cited by 1,709
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
Sontag, E. D. (1998) · Texts in Applied Mathematics · doi:10.1007/978-1-4612-0577-7 · Cited by 1,226
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Self-citationToh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2006) · CMS books in mathematics · doi:10.1007/978-0-387-31256-9 · Cited by 780
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
(1983) · Studies in Mathematics and Its Applications · doi:10.1016/s0168-2024(08)x7003-1 · Cited by 760
Signal enhancement-a composite property mapping algorithm
CADZOW, J. A. (1988) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/29.1488 · Cited by 701
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
Sums of Squares, Moment Matrices and Optimization Over Polynomials
Laurent, M. (2009) · The IMA Volumes in Mathematics and its Applications · doi:10.1007/978-0-387-09686-5_7 · Cited by 648
Fazel, M., Hindi, H., & Boyd, S. P. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1243393 · Cited by 574
Self-citationFrom time series to linear system—Part I. Finite dimensional linear time invariant systems
Willems, J. C. (1986) · Automatica · doi:10.1016/0005-1098(86)90066-x · Cited by 569
Candès, E. J., & Plan, Y. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2111771 · Cited by 569
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
Guaranteed Rank Minimization via Singular Value Projection
Jain, P., Meka, R., & Dhillon, I. S. (2010) · Cited by 420
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Zhang, X., Burger, M., & Osher, S. (2011) · Journal of Scientific Computing · doi:10.1007/s10915-010-9408-8 · Cited by 419
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2000) · Springer eBooks · doi:10.1007/978-1-4757-9859-3 · Cited by 394
ADMiRA: Atomic Decomposition for Minimum Rank Approximation
Lee, K., & Bresler, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054251 · Cited by 267
DAISY : A database for identification of systems
Moor, B. D., Gersem, P. D., Schutter, B. D., & Favoreel, W. (1997) · Journal A · Cited by 264
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Tseng, P. (2010) · Mathematical Programming · doi:10.1007/s10107-010-0394-2 · Cited by 224
Self-citationTrace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
Pong, T. K., Tseng, P., Ji, S., & Ye, J. (2010) · SIAM Journal on Optimization · doi:10.1137/090763184 · Cited by 208
Self-citationMinimal state-space realization in linear system theory: an overview
Schutter, B. D. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00341-1 · Cited by 187
Reweighted nuclear norm minimization with application to system identification
Mohan, K., & Fazel, M. (2010) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2010.5531594 · Cited by 156
Self-citationA Stable Numerical Method for Inverting Shape from Moments
Golub, G. H., Milanfar, P., & Varah, J. M. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597328315 · Cited by 146
Some Saddle-function splitting methods for convex programming
Eckstein, J. (1994) · Optimization methods & software · doi:10.1080/10556789408805578 · Cited by 142
An implementable proximal point algorithmic framework for nuclear norm minimization
Liu, Y.-J., Sun, D., & Toh, K.-C. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0437-8 · Cited by 115
Self-citationA Rank Minimization Approach to Video Inpainting
Ding, T., Sznaier, M., & Camps, O. (2007) · IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2007.4408932 · Cited by 62
Vector ARMA estimation: a reliable subspace approach
Mari, J., Stoica, P., & McKelvey, T. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.847793 · Cited by 61
Cited by
Kernel methods in system identification, machine learning and function estimation: A survey
Pillonetto, G., Dinuzzo, F., Chen, T., De Nicolao, G., & Ljung, L. (2014) · Automatica · doi:10.1016/j.automatica.2014.01.001 · Cited by 741
Non-convex Optimization for Machine Learning
Jain, P., & Kar, P. (2017) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000058 · Cited by 364
Deep Convolutional Framelets: A General Deep Learning Framework for Inverse Problems
Ye, J. C., Han, Y., & Cha, E. (2018) · SIAM Journal on Imaging Sciences · doi:10.1137/17m1141771 · Cited by 330
Metadata
- Authors
- Fazel, M., Pong, T. K., Sun, D., & Tseng, P.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2013-01
- Volume
- 34
- Issue
- 3
- Pages
- 946-977
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2056145308
- Cited by
- 487
- References
- 43
- FWCI
- 32.74
- 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
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.