Completely positive tensor recovery with minimal nuclear value

DOI10.1007/s10589-018-0003-5zbMath1391.90465OpenAlexW2796110179MaRDI QIDQ1639713

Anwa Zhou, Jin Yan Fan

Publication date: 13 June 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-018-0003-5

zbMATH Keywords

moment problemsemidefinite programcompletely positive tensortensor recoverythe CP-nuclear values

Mathematics Subject Classification ID

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

Related Items (3)

Dehomogenization for completely positive tensors ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ Z-singular value and Z-singular value inclusion sets for tensors

Uses Software

• SeDuMi
• GloptiPoly

Cites Work

• 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
• Symmetric nonnegative tensors and copositive tensors
• Optimality conditions and finite convergence of Lasserre's hierarchy
• The truncated moment problem via homogenization and flat extensions
• On the computational complexity of membership problems for the completely positive cone and its dual
• The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
• The \(\mathcal A\)-truncated \(K\)-moment problem
• \(\{0,1\}\) completely positive tensors and multi-hypergraphs
• A semidefinite algorithm for completely positive tensor decomposition
• 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
• Numerical optimization for symmetric tensor decomposition
• Completely positive reformulations for polynomial optimization
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Factorization and cutting planes for completely positive matrices by copositive projection
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• The Computational Complexity of Duality
• Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
• The CP-Matrix Completion Problem
• Robust Low-Rank Tensor Recovery: Models and Algorithms
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• 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
• Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
• Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
• 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
• Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
• Symmetric Tensors and Symmetric Tensor Rank
• Blind Multilinear Identification
• Symmetric Tensor Nuclear Norms
• Most Tensor Problems Are NP-Hard

This page was built for publication: Completely positive tensor recovery with minimal nuclear value