A semidefinite relaxation algorithm for checking completely positive separable matrices
From MaRDI portal
Publication:2313773
DOI10.3934/jimo.2018076zbMath1438.15032OpenAlexW2807436732WikidataQ128134115 ScholiaQ128134115MaRDI QIDQ2313773
Publication date: 23 July 2019
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2018076
Factorization of matrices (15A23) Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48) Moment problems (44A60)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- On the computational complexity of membership problems for the completely positive cone and its dual
- On polynomial optimization over non-compact semi-algebraic sets
- The \(\mathcal A\)-truncated \(K\)-moment problem
- On copositive matrices and strong ellipticity for isotropic elastic materials
- Linear optimization with cones of moments and nonnegative polynomials
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- Copositive programming motivated bounds on the stability and the chromatic numbers
- A tensor product matrix approximation problem in quantum physics
- Z-eigenvalue methods for a global polynomial optimization problem
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Eigenvalues of a real supersymmetric tensor
- Global Optimization with Polynomials and the Problem of Moments
- Positive Maps and Separable Matrices
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations
- The CP-Matrix Completion Problem
- GloptiPoly 3: moments, optimization and semidefinite programming
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Some NP-complete problems in quadratic and nonlinear programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
