Solving low-rank matrix completion problems efficiently

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 1013-1020

  Goldfarb, Donald ^a   Ma, Shiqian ^a   Wen, Zaiwen ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING DIRECTIONS; AUGMENTED LAGRANGIANS; CONTINUATION ALGORITHM; CONVEX RELAXATION; FIRST-ORDER ALGORITHMS; FIXED POINTS; HIGH RATE; LOW-RANK MATRICES; MATRIX; MATRIX COMPLETION PROBLEMS; RECOVERABILITY; RELATIVE ERRORS; SEMI-DEFINITE PROGRAMMING;

MATHEMATICAL PROGRAMMING; RELAXATION PROCESSES; SINGULAR VALUE DECOMPOSITION;

ALGORITHMS;

EID: 77949594951     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394884     Document Type: Conference Paper

References (20)

1. F. ALIZADEH AND D. GOLDFARB, Second-order cone programming, Mathematical Programming, 95 (2003), pp. 3-51.
2. D. P. BERTSEKAS, Constrained optimization and Lagrange multiplier methods, Computer Science and Applied Mathematics, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1982.
3. J. M. BORWEIN AND A. S. LEWIS, Convex Analysis and Nonlinear Optimization, Springer-Verlag, 2003.
4. J. CAI, E. J. CANDÈS, AND Z. SHEN, A singular value thresholding algorithm for matrix completion, Preprint available at http://arxiv.org/abs/0810.3286, (2008).
5. E. J. CANDÈS AND B. RECHT, Exact matrix completion via convex optimization, Foundations of Computational Mathematics, (2009).
6. E. J. CANDÈS AND T. TAO, The power of convex relaxation: near-optimal matrix completion, Preprint available at http://arxiv.org/abs/0903.1476, (2009).
7. P. DRINEAS, R. KANNAN, AND M. W. MAHONEY, Fast Monte Carlo algorithms for matrices ii: Computing lowrank approximations to a matrix, SIAM J. Computing, 36 (2006), pp. 158-183.
8. M. FAZEL, Matrix Rank Minimization with Applications, PhD thesis, Stanford University, 2002.
9. R. FLETCHER, Practical methods of optimization, A Wiley-Interscience Publication, John Wiley & Sons Ltd., Chichester, second ed., 1987.
10. D. GOLDFARB AND S. MA, Convergence of fixed point continuation algorithms for matrix rank minimization, tech. report, Department of IEOR, Columbia University, 2009.
11. L. GRIPPO AND M. SCIANDRONE, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, Oper. Res. Lett., 26 (2000), pp. 127-136.
12. E. T. HALE, W. YIN, AND Y. ZHANG, Fixed-point continuation for l1-minimization: Methodology and convergence, SIAM Journal on Optimization, 19 (2008), pp. 1107-1130.
13. S. MA, D. GOLDFARB, AND L. CHEN, Fixed point and Bregman iterative methods for matrix rank minimization, to appear in Math. Program. A, (2009).
14. M. J. D. POWELL, On search directions for minimization algorithms, Math. Programming, 4 (1973), pp. 193-201.
15. B. RECHT, M. FAZEL, AND P. PARRILO, Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization, Preprint available at http://arxiv.org/abs/0706.4138, (2007).
16. R. T. ROCKAFELLAR, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res., 1 (1976), pp. 97-116.
17. N. SREBRO, Learning with Matrix Factorizations, PhD thesis, Massachusetts Institute of Technology, 2004.
18. R. H. TÜTÜNCÜ, K.-C. TOH, AND M. J. TODD, Solving semidefinite-quadratic-linear programs using SDPT3, Mathematical Programming Series B, 95 (2003), pp. 189-217.
19. Z. WEN, D. GOLDFARB, S. MA, AND K. SCHEINBERG, Row by row methods for semidefinite programming, tech. report, Dept of IEOR, Columbia University, 2009.
20. Z. WEN, S. MA, AND D. GOLDFARB, Alternating direction methods for nuclear norm minimization, in preparation, (2009).