Fetching the paper…
Reading the bibliography…
We establish several mathematical and computational properties of the nuclear norm for higher-order tensors.
F. L. Hitchcock, “Multiple invariants and generalized rank of a p p -way matrix or tensor,” J. Math. Phys
1927
Earlier work this paper cites.
S. Banach, “Über homogene Polynome in ( L 2 L^{2} ),” Studia Math. , 7
1938
Earlier work this paper cites.
R. Schatten, A Theory of Cross-Spaces
1950
Earlier work this paper cites.
A. Grothendieck, “Produits tensoriels topologiques et espaces nucléaires,” Mem. Amer. Math. Soc
1955
Earlier work this paper cites.
A. E. Taylor, “The norm of a real linear transformation in Minkowski space,” Enseignement Math
1958
Earlier work this paper cites.
T. S. Motzkin and E. G. Straus, “Maxima for graphs and a new proof of Túran,” Canadian J. Math
1965
Earlier work this paper cites.
R. M. Karp, “Reducibility among combinatorial problems,” pp. 85–103, in R.E. Miller and J.W. Thatcher (Eds), Complexity of Computer Computations , Plenum, New York, NY, 1972
1972
Earlier work this paper cites.
Y. C. Wong, Schwartz Spaces, Nuclear Spaces and Tensor Products
1979
Earlier work this paper cites.
S. Friedland, “Variation of tensor powers and spectra,” Linear and Multilinear Algebra
1982
Earlier work this paper cites.
A. Defant and K. Floret, Tensor Norms and Operator Ideals
1993
Cited alongside, same era.
T. Zhang and G. H. Golub, “Rank-one approximation to high order tensors,” SIAM J. Matrix Anal. Appl
2001
Cited alongside, same era.
J.-L. Brylinski, “Algebraic measures of entanglement,” pp. 3–23, G. Chen and R. K. Brylinski (Eds), Mathematics of Quantum Computation
2002
Cited alongside, same era.
R. A. Ryan, Introduction to Tensor Products of Banach Spaces
2002
Cited alongside, same era.
D. Steinberg, Computation of Matrix Norms with Applications to Robust Optimization
2005
Cited alongside, same era.
A. Pappas, Y. Sarantopoulos, and A. Tonge, “Norm attaining polynomials,” Bull. Lond. Math. Soc
L.-H. Lim and P. Comon, “Multiarray signal processing: tensor decomposition meets compressed sensing,” C. R. Acad. Sci. Paris
2010
Later among the works it cites.
S. Friedland, “Best rank-one approximation of real symmetric tensors can be chosen symmetric,” Front. Math. China
2013
Later among the works it cites.
C. J. Hillar and L.-H. Lim, “Most tensor problems are NP-hard,” J. ACM
2013
Later among the works it cites.
L.-H. Lim, “Tensors and hypermatrices,” Handbook of Linear Algebra
2013
Later among the works it cites.
L.-H. Lim and P. Comon, “Blind multilinear identification,” IEEE Trans. Inform. Theory
2014
Closest in time.
H. Derksen, “On the nuclear norm and the singular value decomposition of tensors,” Found. Comput. Math
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2007
Cited alongside, same era.
P. Comon, G. Golub, L.-H. Lim, and B. Mourrain, “Symmetric tensor and symmetric tensor rank,” SIAM J. Matrix Anal. Appl
2008
Cited alongside, same era.
V. De Silva and L.-H. Lim, “Tensor rank and the ill-posedness of the best low-rank approximation problem,” SIAM J. Matrix Anal. Appl
2008
Cited alongside, same era.
J. M. Hendrickx and A. Olshevsky, “Matrix p p -norms are NP-hard to approximate if p ≠ 1 , 2 , ∞ p\neq 1,2,\infty ,” SIAM J. Matrix Anal. Appl
2010
Cited alongside, same era.
2016
Closest in time.
H. Derksen, S. Friedland, and L.-H. Lim, “Nuclear norm as a continuous measure of quantum entanglement and separability,” preprint
2016
Closest in time.
S. Friedland, Matrices — Algebra, Analysis and Applications
2016
Closest in time.