Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs

DOI10.1137/130909597zbMath1321.90101arXiv1302.4527OpenAlexW2036953438MaRDI QIDQ2934478

Mingyi Hong, Zhi-Quan Luo, Zi Xu

Publication date: 12 December 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4527

zbMATH Keywords

NP-hardsemidefinite programming relaxationapproximation boundnonconvex quadratic constrained quadratic programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds ⋮ A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem

This page was built for publication: Semidefinite Approximation for Mixed Binary Quadratically Constrained Quadratic Programs