On the nuclear norm and the singular value decomposition of tensors (Q300892): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Let \(V\) be the tensor product of \(d\) finite-dimensional Hilbert spaces. For some applications one needs to find a decomposition of a given tensor \(T\in V\) as the sum of a number \(r\) of pure tensors. The smallest such \(r\) is called the rank of \(T\). For \(d=2\), the rank of \(T\) corresponds to the rank of a matrix. But already for \(d=3\) it is difficult to determine the rank or even give upper or lower bounds. Convex relaxation is a powerful matrix technique which has been successfully applied to matrix completion problems. The author generalizes this to tensors using the nuclear norm. He also generalizes the singular value decomposition (SVD) for matrices to the so-called diagonal SVD for tensors. In addition, he studies various measures of orthogonality in tensor product spaces.
Property / review text: Let \(V\) be the tensor product of \(d\) finite-dimensional Hilbert spaces. For some applications one needs to find a decomposition of a given tensor \(T\in V\) as the sum of a number \(r\) of pure tensors. The smallest such \(r\) is called the rank of \(T\). For \(d=2\), the rank of \(T\) corresponds to the rank of a matrix. But already for \(d=3\) it is difficult to determine the rank or even give upper or lower bounds. Convex relaxation is a powerful matrix technique which has been successfully applied to matrix completion problems. The author generalizes this to tensors using the nuclear norm. He also generalizes the singular value decomposition (SVD) for matrices to the so-called diagonal SVD for tensors. In addition, he studies various measures of orthogonality in tensor product spaces. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Rabe-Rüdiger von Randow / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A18 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A83 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6599349 / rank
 
Normal rank
Property / zbMATH Keywords
 
tensor decomposition
Property / zbMATH Keywords: tensor decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
nuclear norm
Property / zbMATH Keywords: nuclear norm / rank
 
Normal rank
Property / zbMATH Keywords
 
singular value decomposition
Property / zbMATH Keywords: singular value decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
PARFAC
Property / zbMATH Keywords: PARFAC / rank
 
Normal rank
Property / zbMATH Keywords
 
CANDECOMP
Property / zbMATH Keywords: CANDECOMP / rank
 
Normal rank
Property / zbMATH Keywords
 
tensor product
Property / zbMATH Keywords: tensor product / rank
 
Normal rank
Property / zbMATH Keywords
 
matrix completion
Property / zbMATH Keywords: matrix completion / rank
 
Normal rank

Revision as of 21:54, 27 June 2023

scientific article
Language Label Description Also known as
English
On the nuclear norm and the singular value decomposition of tensors
scientific article

    Statements

    On the nuclear norm and the singular value decomposition of tensors (English)
    0 references
    0 references
    29 June 2016
    0 references
    Let \(V\) be the tensor product of \(d\) finite-dimensional Hilbert spaces. For some applications one needs to find a decomposition of a given tensor \(T\in V\) as the sum of a number \(r\) of pure tensors. The smallest such \(r\) is called the rank of \(T\). For \(d=2\), the rank of \(T\) corresponds to the rank of a matrix. But already for \(d=3\) it is difficult to determine the rank or even give upper or lower bounds. Convex relaxation is a powerful matrix technique which has been successfully applied to matrix completion problems. The author generalizes this to tensors using the nuclear norm. He also generalizes the singular value decomposition (SVD) for matrices to the so-called diagonal SVD for tensors. In addition, he studies various measures of orthogonality in tensor product spaces.
    0 references
    tensor decomposition
    0 references
    nuclear norm
    0 references
    singular value decomposition
    0 references
    PARFAC
    0 references
    CANDECOMP
    0 references
    tensor product
    0 references
    matrix completion
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references