Hermitian completely positive matrices
DOI10.1016/J.LAA.2020.06.007zbMATH Open1448.15049OpenAlexW3036224157MaRDI QIDQ2197205FDOQ2197205
Authors: Anwa Zhou, Guangming Zhou, Jinyan Fan
Publication date: 28 August 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.06.007
Recommendations
truncated moment problemsemidefinite programHermitian completely positive decompositionHermitian completely positive matrix
Factorization of matrices (15A23) Hermitian, skew-Hermitian, and related matrices (15B57) Semidefinite programming (90C22) Moment problems (44A60)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Title not available (Why is that?)
- Some NP-complete problems in quadratic and nonlinear programming
- Global optimization with polynomials and the problem of moments
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completely positive reformulations for polynomial optimization
- On the computational complexity of membership problems for the completely positive cone and its dual
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Phase recovery, MaxCut and complex semidefinite programming
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Truncated \(K\)-moment problems in several variables
- Linear optimization with cones of moments and nonnegative polynomials
- Copositive Programming
- On copositive programming and standard quadratic optimization problems
- Complex Quadratic Optimization and Semidefinite Programming
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Designing Unimodular Codes Via Quadratic Optimization
- Optimal estimation of sensor biases for asynchronous multi-sensor data fusion
- Completely positive tensors in the complex field
Cited In (4)
Uses Software
This page was built for publication: Hermitian completely positive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197205)