Tensor completion and low-n-rank tensor recovery via convex optimization

Inverse Problems

Volumn 27, Issue 2, 2011, Pages

  Gandy, Silvia ^a   Recht, Benjamin ^b   Yamada, Isao ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATING DIRECTION METHODS; APPROXIMATION PROBLEMS; COMPRESSED SENSING; CONVEX RELAXATION; DOUGLAS; EFFICIENT ALGORITHM; LINEAR CONSTRAINTS; LOW-RANK MATRICES; SOLUTION STRATEGY; SPLITTING TECHNIQUES; TENSOR COMPLETION;

ALGORITHMS; CONVEX OPTIMIZATION; RECOVERY; RELAXATION PROCESSES;

TENSORS;

EID: 79551661156     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/27/2/025010     Document Type: Article

References (31)

1. Kolda T G and Bader B W 2009 Tensor decompositions and applications SIAM Rev. 51 455-500
2. Fazel M, Hindi H and Boyd S 2001 A rank minimization heuristic with application to minimum order system approximation Proc. of the American Control Conf. (Arlington, VA, June 2001) vol 6, pp 4734-9
3. Recht B, Fazel M and Parrilo P A 2010 Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization SIAM Rev. 52 471-501
4. Candès E J and Recht B 2008 Exact matrix completion via convex optimization Found. Comput. Math. 9 717-72
5. Recht B 2009 A simpler approach to matrix completion J. Mach. Learn. Res. (to appear) arXiv:0910.0651
6. Liu J, Musialski P,Wonka P and Ye J 2010 Tensor completion for estimating missing values in visual data IEEE 12th Int. Conf. Computer Vision (Kyoto, 2009) pp 2114-21
7. Lim L-H and Common P 2010 Multiarray signal processing: tensor decomposition meets compressed sensing Comptes Rendus Mecanique 338 311-20
8. Håstad J 1990 Tensor rank is NP-complete J. Algorithms 11 644-54
9. Navasca C and De Lathauwer L 2009 Low multilinear tensor approximation via semidefinite programming 17th European Signal Processing Conf. (EUSIPCO) (Glasgow, Scotland, August 2009)
10. Nocedal J and Wright S J 2006 Numerical Optimization (Springer Series in Operations Research and Financial Engineering) (New York: Springer)
11. Chambolle A 2004 An algorithm for total variation minimization and applications J. Math. Imaging Vis. 20 89-97
12. Douglas J and Rachford H 1956 On the numerical solution of heat conduction problems in two and three space variables Trans. Am. Math. Soc. 82 421-39
13. Combettes P L and Pesquet J-C 2007 A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery IEEE J. Sel. Top. Signal Process. 1 564-74
14. Combettes P L and Pesquet J-C 2008 A proximal decomposition method for solving convex variational inverse problems Inverse Problems 25 065014
15. Yamada I, YukawaMand YamagishiM2011 Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings Fixed-Point Algorithms for Inverse Problems in Science and Engineering ed H H Bauschke et al (New York: Springer) chapter 17
16. Gandy S and Yamada I 2010 Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix J. Math. Indust. 2 (2010B-5) 147-56
17. Moreau J-J 1962 Fonctions convexes duales et points proximaux dans un espace Hilbertien C. R. Acad. Sci. Paris Ser. A Math 244 2897-9
18. Combettes P L and Wajs V R 2005 Signal recovery by proximal forward-backward splitting SIAM Multiscale Model. Simul. 4 1168-200
19. Cai J F, Candès E J and Shen Z 2008 A singular value thresholding algorithm for matrix completion SIAM J. Optim. 20 1956-82
20. Golub G H and van Loan C F 1996 Matrix Computations (Baltimore, MD: Johns Hopkins University Press)
21. Gabay D and Mercier B 1976 A dual algorithm for the solution of nonlinear variational problems via finiteelement approximations Comp. Math. Appl. 2 17-40
22. Glowinski R and Marrocco A 1975 Sur l'approximation par éléments finis d'ordre un, et la résolution par pénalisation-dualité d'une classe de problèmes Dirichlets nonlinéaires Rev. Française d'Aut. Inf. Rech. Oper. R-2 41-76
23. Eckstein J and Bertsekas D P 1992 On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Math. Program. 55 293-318
24. Gabay D 1983 Applications of the method of multipliers to variational inequalities Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems ed M Fortin and R Glowinski (Amsterdam: North-Holland)
25. Bertsekas D P and Tsitsiklis J N 1989 Parallel and Distributed Computation (Englewood Cliffs, NJ: Prentice-Hall)
26. Barzilai J and Borwein J M 1988 Two-point step size gradient methods IMA J. Numer. Anal. 8 141-8
27. Beck A and Teboulle M 2009 A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM J. Imaging Sci. 2 183-202
28. Berry M W 1992 Large-scale sparse singular value decompositions Int. J. Supercomput. Appl. 6 13-49
29. Larsen R M PROPACK-software for large and sparse svd calculations available at http://sun.stanford.edu/srmunk/PROPACK/
30. OsiriX. DICOM sample image sets repository available at http://www.osirix-viewer.com, http://pubimage.hcuge.ch:8080/
31. Army Geospatial Center of the US Army Corps of Engineers. Sample data sets for the hypercube software available at http://www.agc.army.mil/Hypercube/