Lecture notes in computer science

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye Y

Published Jan 1, 2005• 111 citations

Related papers

On approximating complex quadratic optimization problems via semidefinite programming relaxations

Anthony Man–Cho So, Jiawei Zhang, Yinyu Ye Y

Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation

Dachuan Xu, Shu-zhong Zhang

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

Zi Li Xu, Ming-Yi Hong

Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani

On the gap between the quadratic integer programming problem and its semidefinite relaxation

U. Malik, Imad M. Jaimoukha, George D. Halikias +1 more

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li