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

Tight Semidefinite Relaxations for Sign-Indefinite Qcqps with Bipartite Structures

悟大 東, Godai Azuma, 光浩 福田, Mituhiro Fukuda, SunYoung Kim, 真 山下, Makoto Yamashita

Published Jun 1, 2023• 0 citations
OpenAlex

Related papers

Exactness Conditions for Semidefinite Relaxation of Nonconvex QCQPS with Forest Structures

悟大 東, Godai Azuma, 光浩 福田 +4 more

•Jul 1, 2021•0 citations

Tightness conditions of SDP relaxation for QCQPs with bipartite graph structure

悟大 東, Godai Azuma, 光浩 福田 +4 more

•Aug 1, 2023•0 citations

Fixing variables in semidefinite relaxations

Christoph Heimberg

Lecture notes in computer science•Jan 1, 1997•4 citations

Quadratic maximization and semidefinite relaxation

Shuzhong Zhang

Mathematical Programming•May 1, 2000•168 citations

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

Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani

Mathematical Programming•May 17, 2011•136 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