The minimum-rank gram matrix completion via modified fixed point continuation method

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2011, Pages 241-248

  Ma, Yue ^a   Zhi, Lihong ^a  

^a AMSS   (China)

Author keywords

fixed point iterative method; gram matrix completion; nuclear norm minimization; schur decomposition; sum of squares

Indexed keywords

FIXED POINT ITERATIVE METHOD; GRAM MATRICES; NUCLEAR NORM MINIMIZATION; SCHUR DECOMPOSITION; SUM OF SQUARES;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; POLYNOMIALS;

MATRIX ALGEBRA;

EID: 79959639348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993886.1993924     Document Type: Conference Paper

References (53)

1. BARRETT, W., JOHNSON, C. R., AND TARAZAGA, P. The real positive definite completion problem for a simple cycle. Linear Algebra Appl. 192 (1993), 3-31.
2. BARZILAI, J., AND BORWEIN, J. Two-point step size gradient methods. IMA J. Numer. Anal. 8 (1988), 141-148.
3. BECK, A., AND TEBOULLE, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 1 (2009), 183-202.
4. BURER, S., AND MONTEIRO, R. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95, 2 (2003), 329-357.
5. BURER, S., AND MONTEIRO, R. Local minima and convergence in low-rank semidefinite programming. Math. Program. 103, 3 (2005), 427-444.
6. CAI, J.-F., CANDÈS, E. J., AND SHEN, Z. A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 4 (2010), 1956-1982.
7. CANDÈS, E. J., AND RECHT, B. Exact matrix completion via convex optimization. Found. Comput. Math. 9, 6 (2009), 717-772.
8. CANDÈS, E. J., AND TAO, T. The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inform. Theory 56, 5 (2010), 2053-2080.
9. CHISTOV, A., AND GRIGORIEV, D. Complexity of quantifier elimination in the theory of algebraically closed fields. In Proceedings of the Mathematical Foundations of Computer Science 1984 (London, UK, 1984), Springer-Verlag, pp. 17-31.
10. CHOI, M., LAM, T., AND REZNICK, B. Sums of squares of real polynomials. Symp. in Pure Math. 58, 2 (1995), 103-126.
11. DE KLERK, E., ROOS, C., AND TERLAKY, T. Initialization in semidefinite programming via a self-dual skew-symmetric embedding. Oper. Res. Lett. 20, 5 (1997), 213-221.
12. FAZEL, M. Matrix rank minimization with applications. PhD thesis, Stanford University, 2002.
13. FAZEL, M., HINDI, H., AND BOYD, S. A rank minimization heuristic with application to minimum order system approximation. In Proceedings of the 2001 American Control Conference (2001), pp. 4734-4739.
14. GOLDFARB, D., AND MA, S. Convergence of fixed point continuation algorithms for matrix rank minimization. Foundations of Computational Mathematics 11, 2 (2011), 183-210.
15. GOLUB, G. H., AND VAN LOAN, C. F. Matrix computations, third ed. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD, 1996.
16. GRONE, R., JOHNSON, C. R., DE SÁ, E. M., AND WOLKOWICZ, H. Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58 (1984), 109-124.
17. HALE, E. T., YIN, W., AND ZHANG, Y. Fixed-point continuation for l1-minimization: methodology and convergence. SIAM J. Optim. 19, 3 (2008), 1107-1130.
18. HENRION, D., AND MALICK, J. Projection methods in convex optimization. LAAS-CNRS Research Report 10730 (2010).
19. HENRION, D., AND MALICK, J. Projection methods for conic feasibility problems; application to sum-of-squares decompositions. Optimization Methods and Software 26, 1 (2011), 23-46.
20. JI, S., AND YE, J. An accelerated gradient method for trace norm minimization. In Proceedings of the 26th Annual International Conference on Machine Learning (New York, NY, USA, 2009), ICML '09, ACM, pp. 457-464.
21. KALTOFEN, E., LI, B., YANG, Z., AND ZHI, L. Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. In ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (New York, NY, USA, 2008), ACM, pp. 155-164.
22. KALTOFEN, E., LI, B., YANG, Z., AND ZHI, L. Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients, 2009. Accepted for publication in J. Symbolic Comput.
23. KOČVARA, M., AND STINGL, M. On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. Math. Program. 109, 2-3, Ser. B (2007), 413-444.
24. LARSEN, R. PROPACK - software for large and sparse SVD calculations. Available from: http://soi.stanford.edu/~rmunk/PROPACK/.
25. LAURENT, M. The real positive semidefinite completion problem for series-parallel graphs. Linear Algebra Appl. 252 (1997), 347-366.
26. LAURENT, M. Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems. SIAM J. Matrix Anal. Appl. 22, 3 (2000), 874-894.
27. LAURENT, M. Matrix completion problems. Encyclopedia of Optimization III (Interior - M) (2001), 221-229.
28. LEWIS, A. S. Convex analysis on the Hermitian matrices. SIAM J. Optim. 6, 1 (1996), 164-177.
29. LIU, Z., AND VANDENBERGHE, L. Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31 (2009), 1235-1256.
30. LÖFBERG, J. YALMIP : A toolbox for modeling and optimization in MATLAB. In Proc. IEEE CCA/ISIC/CACSD Conf. (Taipei, Taiwan, 2004). URL: http://control.ee.ethz.ch/~joloef/yalmip.php.
31. MA, S., GOLDFARB, D., AND CHEN, L. Fixed point and bregman iterative methods for matrix rank minimization. Math. Program. (2009), 1-33.
32. MA, Y. The minimum-rank Gram matrix completion via fixed point continuation method (in Chinese). Journal of Systems Science and Mathematical Sciences 30, 11 (2010), 1501-1511.
33. MALICK, J., POVH, J., RENDL, F., AND WIEGELE, A. Regularization methods for semidefinite programming. SIAM J. Optim. 20, 1 (2009), 336-356.
34. 2). Soviet Mathematics Doklady 27 (1983), 372-376.
35. NESTEROV, Y. Smooth minimization of non-smooth functions. Math. Program. 103, 1 (2005), 127-152.
36. NESTEROV, Y. Gradient methods for minimizing composite objective function. Tech. rep., 2007.
37. NIE, J. Regularization methods for sum of squares relaxations in large scale polynomial optimization. Tech. rep., 2009. Available: http://arxiv.org/ abs/0909.3551.
38. PEYRL, H., AND PARRILO, P. A Macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients. In ProcSNC07 (2007), pp. 207-208.
39. PEYRL, H., AND PARRILO, P. Computing sum of squares decompositions with rational coefficients. Theoretical Computer Science 409 (2008), 269-281.
40. PFISTER, A. Zur Darstellung definiter Funktionen als Summe von Quadraten. Inventiones Math. 4, 4 (1967), 229-236.
41. POURCHET, Y. Sur la représentation en somme de carrés des polynômes à une indéterminée sur un corps de nombres algébriques. Acta Arith. 19 (1971), 89-104.
42. POWERS, V., AND WÖRMANN, T. An algorithm for sums of squares of real polynomials. J. Pure Appl. Algebra 127, 1 (1998), 99-104.
43. RECHT, B., FAZEL, M., AND PARRILO, P. A. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 3 (2010), 471-501.
44. RECHT, B., XU, W., AND HASSIBI, B. Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. In CDC (2008), pp. 3065-3070.
45. RENNIE, J., AND SREBRO, N. Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the 22nd international conference on Machine learning (2005), ICML '05, pp. 713-719.
46. ROCKAFELLAR, R. Convex Analysis. Princeton University Press, 1972.
47. SREBRO, N., RENNIE, J., AND JAAKKOLA, T. Maximum-margin matrix factorization. In Advances in Neural Information Processing Systems (2005).
48. STURM, J. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optimization Methods and Software 11/12 (1999), 625-653.
49. TOH, K.-C., AND YUN, S. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Tech. rep., 2009. Available: http://www.optimization-online.org/DBHTML/2009/03/2268.html.
50. TSENG, P. On accelerated proximal gradient methods for convex-concave optimization. Submitted to SIAM J. Optim (2008).
51. WATSON, G. A. Characterization of the subdifferential of some matrix norms. Linear Algebra Appl. 170 (1992), 33-45.
52. WEN, Z., YIN, W., GOLDFARB, D., AND ZHANG, Y. A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32, 4 (2010), 1832-1857.
53. ZHAO, X.-Y., SUN, D., AND TOH, K.-C. A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 4 (2010), 1737-1765.