Dehomogenization for completely positive tensors
From MaRDI portal
Publication:6107957
DOI10.3934/naco.2022037zbMath1518.15037arXiv2206.12553OpenAlexW4312666982MaRDI QIDQ6107957
Xindong Tang, Jia-Wang Nie, Zi Yang, Suhan Zhong
Publication date: 28 June 2023
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.12553
Positive matrices and their generalizations; cones of matrices (15B48) Multilinear algebra, tensor calculus (15A69) Polynomial optimization (90C23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric nonnegative tensors and copositive tensors
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Copositive optimization -- recent developments and applications
- On the computational complexity of membership problems for the completely positive cone and its dual
- The \(\mathcal A\)-truncated \(K\)-moment problem
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
- A semidefinite algorithm for completely positive tensor decomposition
- Linear optimization with cones of moments and nonnegative polynomials
- Completely positive tensor recovery with minimal nuclear value
- Tensor eigenvalue complementarity problems
- Real eigenvalues of nonsymmetric tensors
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Factorization and cutting planes for completely positive matrices by copositive projection
- Global Optimization with Polynomials and the Problem of Moments
- Rank-One Approximation to High Order Tensors
- Approximation of the Stability Number of a Graph via Copositive Programming
- The CP-Matrix Approximation Problem
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
- The CP-Matrix Completion Problem
- Polynomial Matrix Inequality and Semidefinite Representation
- An Introduction to Polynomial and Semi-Algebraic Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- Completely Positive Binary Tensors
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- On Linear Copositive Lyapunov Functions and the Stability of Switched Positive Linear Systems
- Symmetric Tensors and Symmetric Tensor Rank
- An elementary and constructive solution to Hilbert’s 17th Problem for matrices
This page was built for publication: Dehomogenization for completely positive tensors
