Positive Maps and Separable Matrices
From MaRDI portal
Publication:2810548
DOI10.1137/15M1018514zbMath1338.15066arXiv1504.06595OpenAlexW2963982648MaRDI QIDQ2810548
Publication date: 3 June 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06595
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (12)
Separability of Hermitian tensors and PSD decompositions ⋮ Bounding the separable rank via polynomial optimization ⋮ Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems ⋮ Some Recent Developments in Spectrahedral Computation ⋮ New examples of extremal positive linear maps ⋮ A practical approach to SOS relaxations for detecting quantum entanglement ⋮ Symmetric Hermitian decomposability criterion, decomposition, and its applications ⋮ Hermitian Tensor Decompositions ⋮ Positive definiteness of paired symmetric tensors and elasticity tensors ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ Bi-block positive semidefiniteness of bi-block symmetric tensors ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Linear optimization with cones of moments and nonnegative polynomials
- On the role of the strong ellipticity condition in nonlinear elasticity
- A tensor product matrix approximation problem in quantum physics
- Conditions for strong ellipticity and M-eigenvalues
- Positive semidefinite biquadratic forms
- An exact Jacobian SDP relaxation for polynomial optimization
- A bounded degree SOS hierarchy for polynomial optimization
- Certifying convergence of Lasserre's hierarchy via flat truncation
- A successive approximation method for quantum separability
- On strong ellipticity and the Legendre-Hadamard condition
- Global Optimization with Polynomials and the Problem of Moments
- Polynomial Optimization with Real Varieties
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A Semidefinite Hierarchy for Containment of Spectrahedra
This page was built for publication: Positive Maps and Separable Matrices