Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Mathematical Programming

On approximating complex quadratic optimization problems via semidefinite programming relaxations

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

Published Dec 12, 2006• 231 citations
Publisher
DOI
10.1007/s10107-006-0064-6

Related papers

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

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

Lecture notes in computer science•Jan 1, 2005•111 citations

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

Dachuan Xu, Shu-zhong Zhang

Science in China Series A Mathematics•Jul 30, 2007•7 citations

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

Zi Li Xu, Ming-Yi Hong

arXiv:1403.3998•Journal of the Operations Research Society of China•Jul 7, 2015•3 citations

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

Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani

Mathematical Programming•May 17, 2011•133 citations

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

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

Mathematical Programming•Dec 30, 2005•34 citations

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li

Advances in intelligent systems and computing•Jun 14, 2019•3 citations