A Unified Theorem on SDP Rank Reduction
From MaRDI portal
Publication:3169003
DOI10.1287/moor.1080.0326zbMath1218.90153OpenAlexW2063185045MaRDI QIDQ3169003
Yinyu Ye, Anthony Man-Cho So, Jia-Wei Zhang
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1080.0326
Semidefinite programming (90C22) Applications of mathematical programming (90C90) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (10)
Jordan-algebraic aspects of optimization: randomization ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints ⋮ Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems ⋮ Moment inequalities for sums of random matrices and their applications in optimization ⋮ Convexity of the image of a quadratic map via the relative entropy distance ⋮ Theorems of the alternative for inequality systems of real polynomials ⋮ Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem
This page was built for publication: A Unified Theorem on SDP Rank Reduction
