Completely positive tensor recovery with minimal nuclear value
From MaRDI portal
(Redirected from Publication:1639713)
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
Cites work
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- A semidefinite algorithm for completely positive tensor decomposition
- A semidefinite programming approach to the generalized problem of moments
- Blind Multilinear Identification
- Completely positive reformulations for polynomial optimization
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Factorization and cutting planes for completely positive matrices by copositive projection
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear optimization with cones of moments and nonnegative polynomials
- Most tensor problems are NP-hard
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- Nuclear norm of higher-order tensors
- Numerical optimization for symmetric tensor decomposition
- On tensor completion via nuclear norm minimization
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the nuclear norm and the singular value decomposition of tensors
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomial Functions
- Robust low-rank tensor recovery: models and algorithms
- Semidefinite relaxations for best rank-1 tensor approximations
- Sums of squares, moment matrices and optimization over polynomials
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetric nonnegative tensors and copositive tensors
- Symmetric tensor nuclear norms
- Tensor Algebra and Multidimensional Harmonic Retrieval in Signal Processing for MIMO Radar
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- The CP-matrix completion problem
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- The computational complexity of duality
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- The truncated moment problem via homogenization and flat extensions
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
Cited in
(3)
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)
