|
|
|
|
LEADER |
02475 am a22002413u 4500 |
001 |
77630 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Saunderson, James F.
|e author
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
|e contributor
|
100 |
1 |
0 |
|a Saunderson, James F.
|e contributor
|
100 |
1 |
0 |
|a Parrilo, Pablo A.
|e contributor
|
100 |
1 |
0 |
|a Willsky, Alan S.
|e contributor
|
700 |
1 |
0 |
|a Chandrasekaran, Venkat
|e author
|
700 |
1 |
0 |
|a Parrilo, Pablo A.
|e author
|
700 |
1 |
0 |
|a Willsky, Alan S.
|e author
|
245 |
0 |
0 |
|a Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
|
260 |
|
|
|b Society for Industrial and Applied Mathematics,
|c 2013-03-12T18:18:29Z.
|
856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/77630
|
520 |
|
|
|a 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 matrix and an unknown low-rank positive semidefinite matrix, decompose $X$ into these constituents. The second problem we consider is to determine the facial structure of the set of correlation matrices, a convex set also known as the elliptope. This convex body, and particularly its facial structure, plays a role in applications from combinatorial optimization to mathematical finance. The third problem is a basic geometric question: given points $v_1,v_2,\ldots,v_n\in \mathbb{R}^k$ (where $n > k$) determine whether there is a centered ellipsoid passing exactly through all the points. We show that in a precise sense these three problems are equivalent. Furthermore we establish a simple sufficient condition on a subspace $\mathcal{U}$ that ensures any positive semidefinite matrix $L$ with column space $\mathcal{U}$ can be recovered from $D+L$ for any diagonal matrix $D$ using a convex optimization-based heuristic known as minimum trace factor analysis. This result leads to a new understanding of the structure of rank-deficient correlation matrices and a simple condition on a set of points that ensures there is a centered ellipsoid passing through them.
|
546 |
|
|
|a en_US
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t SIAM Journal on Matrix Analysis and Applications
|