REVIEW 2 cited by
General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
On Improved Statistical Accuracy of Low-Order Polynomial Chaos Approximations
A constrained optimization method is introduced to enforce exact first- and second-moment recovery in low-order polynomial chaos expansions, demonstrated on algebraic test functions.
-
Neural-powered unit disk graph embedding: qubits connectivity for some QUBO problems
Neural networks transform initial embeddings into feasible unit disk configurations for QUBO problems on Rydberg qubits and outperform the Gurobi solver in experiments.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.