DocumentCode
719303
Title
Recovery of third order tensors via convex optimization
Author
Rauhut, Holger ; Stojanac, Zeljka
Author_Institution
Lehrstuhl C fur Math. (Anal.), RWTH Aachen Univ., Aachen, Germany
fYear
2015
fDate
25-29 May 2015
Firstpage
397
Lastpage
401
Abstract
We study recovery of low-rank third order tensors from underdetermined linear measurements. This natural extension of low-rank matrix recovery via nuclear norm minimization is challenging since the tensor nuclear norm is in general intractable to compute. To overcome this obstacle we introduce hierarchical closed convex relaxations of the tensor unit nuclear norm ball based on so-called theta bodies - a recent concept from computational algebraic geometry. Our tensor recovery procedure consists in minimization of the resulting new norms subject to the linear constraints. Numerical results on recovery of third order low-rank tensors show the effectiveness of this new approach.
Keywords
computational geometry; convex programming; matrix algebra; minimisation; tensors; computational algebraic geometry; convex optimization; low-rank matrix recovery; low-rank third order tensors; nuclear norm minimization; tensor nuclear norm; theta bodies; underdetermined linear measurements; Convex functions; Electronic mail; Geometry; Minimization; Optimization; Polynomials; Tensile stress;
fLanguage
English
Publisher
ieee
Conference_Titel
Sampling Theory and Applications (SampTA), 2015 International Conference on
Conference_Location
Washington, DC
Type
conf
DOI
10.1109/SAMPTA.2015.7148920
Filename
7148920
Link To Document