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

Exploiting Aggregate Sparsity in Second Order Cone Relaxations for Quadratic Constrained Quadratic Programming Problems

真 山下, Makoto Yamashita

Published Sep 1, 2020• 0 citations
OpenAlex

Related papers

Faster, but weaker, relaxations for quadratically constrained quadratic programs

Samuel Burer, Sunyoung Kim, Masakazu Kojima

Computational Optimization and Applications•Nov 7, 2013•14 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

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

Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program

Agnès Gorge, Abdel Lisser, Riadh Zorgati

Lecture notes in computer science•Jan 1, 2012•1 citation

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

Approximation Algorithm for A Mixed Binary Quadratically Constrained Quadratic Programming Problem

Zi Li Xu, Mingyi Hong

•Jan 1, 2015•1 citation