mlsanityData to 14 Oct 2026

General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming

arXiv 1703.07870 ↗First posted 22 Mar 2017math.OCcited by 17

Not on the map. Why?

Abstract (arXiv)

We introduce the Suggest-and-Improve framework for general nonconvex quadratically constrained quadratic programs (QCQPs). Using this framework, we generalize a number of known methods and provide heuristics to get approximate solutions to QCQPs for which no specialized methods are available. We also introduce an open-source Python package QCQP, which implements the heuristics discussed in the paper.

Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Mar 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 8; 2023: 1; 2024: 1; 2025: 1; 2026: 2.

17 papers.

Sort: