Completely positive tensor recovery with minimal nuclear value
From MaRDI portal
Publication:1639713
DOI10.1007/S10589-018-0003-5zbMATH Open1391.90465OpenAlexW2796110179MaRDI QIDQ1639713FDOQ1639713
Authors: Anwa Zhou, Jinyan 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
Recommendations
- A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
- A semidefinite algorithm for completely positive tensor decomposition
- Completely positive binary tensors
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor theta norms and low rank recovery
Numerical mathematical programming methods (65K05) Multilinear algebra, tensor calculus (15A69) Nonlinear programming (90C30) Semidefinite programming (90C22)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Nuclear norm of higher-order tensors
- Global optimization with polynomials and the problem of moments
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Most tensor problems are NP-hard
- On the copositive representation of binary and continuous nonconvex quadratic programs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Sums of squares, moment matrices and optimization over polynomials
- Title not available (Why is that?)
- A semidefinite programming approach to the generalized problem of moments
- Title not available (Why is that?)
- Symmetric nonnegative tensors and copositive tensors
- Title not available (Why is that?)
- Completely positive reformulations for polynomial optimization
- Factorization and cutting planes for completely positive matrices by copositive projection
- On the computational complexity of membership problems for the completely positive cone and its dual
- Optimality conditions and finite convergence of Lasserre's hierarchy
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- Optimization of Polynomial Functions
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- Robust low-rank tensor recovery: models and algorithms
- On the nuclear norm and the singular value decomposition of tensors
- The truncated moment problem via homogenization and flat extensions
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Symmetric Tensors and Symmetric Tensor Rank
- Blind Multilinear Identification
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Linear optimization with cones of moments and nonnegative polynomials
- Semidefinite relaxations for best rank-1 tensor approximations
- On tensor completion via nuclear norm minimization
- Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- Numerical optimization for symmetric tensor decomposition
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- The CP-matrix completion problem
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
- The computational complexity of duality
- A semidefinite algorithm for completely positive tensor decomposition
- Symmetric tensor nuclear norms
Cited In (3)
Uses Software
This page was built for publication: Completely positive tensor recovery with minimal nuclear value
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639713)
