Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing: given a matrix $X$ formed as the sum of an unknown diagonal mat...
Main Authors: | Saunderson, James F. (Contributor), Chandrasekaran, Venkat (Author), Parrilo, Pablo A. (Contributor), Willsky, Alan S. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2013-03-12T18:18:29Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Diagonal and low-rank decompositions and fitting ellipsoids to random points
by: Saunderson, James F., et al.
Published: (2014) -
Sparse and low-rank matrix decompositions
by: Chandrasekaran, Venkat, et al.
Published: (2010) -
Rank-Sparsity Incoherence for Matrix Decomposition
by: Chandrasekaran, Venkat, et al.
Published: (2011) -
Semidefinite Descriptions of the Convex Hull of Rotation Matrices
by: Saunderson, James, et al.
Published: (2016) -
A note on the rank inequality for diagonally magic matrices
by: Duanmei Zhou, et al.
Published: (2016-02-01)