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

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10208-015-9264-x / rank
Normal rank
 
Property / author
 
Property / author: H. G. J. Derksen / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Rabe-Rüdiger von Randow / rank
Normal rank
 
Property / author
 
Property / author: H. G. J. Derksen / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Rabe-Rüdiger von Randow / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130150942 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.3860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the Alder-Strassen bound. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality of Hadamard type for permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor completion and low-n-rank tensor recovery via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permanent of a square matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Produits tensoriels topologiques et espaces nucléaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor rank is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Tensor Problems Are NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bounds for the Rank of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ranks and border ranks of symmetric tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multilinear Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiarray signal processing: tensor decomposition meets compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind Multilinear Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Cross-Spaces. (AM-26) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apolarity for determinants and permanents of generic matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10208-015-9264-X / rank
 
Normal rank

Latest revision as of 13:51, 9 December 2024

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
    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
    0 references
    0 references
    0 references
    0 references

    Identifiers

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