Symmetric Tensor Nuclear Norms

DOI10.1137/16M1083384zbMath1372.15023arXiv1605.08823OpenAlexW2964049675MaRDI QIDQ5369251

Jia-Wang Nie

Publication date: 16 October 2017

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.08823

zbMATH Keywords

symmetric tensornuclear normLasserre relaxationmoment optimizationnuclear decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Multilinear algebra, tensor calculus (15A69)

Related Items (15)

Nonnegative forms with sublevel sets of minimal volume ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Bounding the separable rank via polynomial optimization ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization ⋮ Highly entangled tensors ⋮ Approximate real symmetric tensor rank ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ Generalized truncated moment problems with unbounded sets ⋮ Further results on tensor nuclear norms ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ Symmetric multilinear forms on Hilbert spaces: where do they attain their norm? ⋮ T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming ⋮ On the tensor spectral \(p\)-norm and its dual norm via partitions ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the nuclear norm and the singular value decomposition of tensors
• On tensor completion via nuclear norm minimization
• Eigenvectors of tensors and algorithms for Waring decomposition
• Optimality conditions and finite convergence of Lasserre's hierarchy
• The truncated moment problem via homogenization and flat extensions
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
• The \(\mathcal A\)-truncated \(K\)-moment problem
• Multiarray signal processing: tensor decomposition meets compressed sensing
• Linear optimization with cones of moments and nonnegative polynomials
• A semidefinite programming approach to the generalized problem of moments
• The convex geometry of linear inverse problems
• A semidefinite approach for truncated \(K\)-moment problems
• Best rank one approximation of real symmetric tensors can be chosen symmetric
• Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
• Tensor theta norms and low rank recovery
• Generating polynomials and symmetric tensor decompositions
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• The Computational Complexity of Duality
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• Theta Bodies for Polynomial Ideals
• Tensor completion and low-n-rank tensor recovery via convex optimization
• GloptiPoly 3: moments, optimization and semidefinite programming
• Optimization of Polynomial Functions
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Nuclear norm of higher-order tensors
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems
• Symmetric Tensors and Symmetric Tensor Rank
• Blind Multilinear Identification
• Most Tensor Problems Are NP-Hard
• Über homogene Polynome in ($L^{2}$)

This page was built for publication: Symmetric Tensor Nuclear Norms