Pith. sign in

REVIEW 7 cited by

General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1703.07870 v2 pith:NDENKS7U submitted 2017-03-22 math.OC

Jaehyun Park , Stephen Boyd This is my paper · ORCID
classification math.OC
keywords heuristicsconstrainedframeworkgeneralintroducemethodsnonconvexqcqps
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Testing nonparametric shape restrictions

    stat.ME 2019-09 conditional novelty 8.0 of 10

    A Khmaladze-transformed partial sum process of B-spline residuals yields a pivotal test for a wide class of nonparametric shape restrictions.

  2. Indexed singular value bounds on scattering operators: How many channels can a photonic device support?

    physics.optics 2025-10 conditional novelty 7.0 of 10

    A Courant-Fischer-Weyl min-max principle combined with convex relaxations yields computable upper bounds on each individual singular value of the electromagnetic Green operator for arbitrary linear scatterers.

  3. On Improved Statistical Accuracy of Low-Order Polynomial Chaos Approximations

    eess.SY 2026-06 unverdicted novelty 5.0 of 10

    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.

  4. Coherent Ising Machines: The Good, The Bad, The Ugly

    physics.optics 2025-07 conditional novelty 5.0 of 10

    Coherent Ising machines behave as approximate analog integrators of overdamped Langevin dynamics; hybrid optical-digital versions are bottlenecked by analog-digital conversion, while fully optical versions are estimat...

  5. Sequential Convex Restriction and its Applications in Robust Optimization

    math.OC 2019-09 conditional novelty 5.0 of 10

    A nonlinear feasibility condition built from concave envelopes and Brouwer's fixed point theorem yields a sequential convex optimization method with robust feasibility guarantees.

  6. Exact DC Representation of Multi-Tier Offloading Product in SAGINs via Quantifier Elimination

    eess.SP 2026-08 conditional novelty 4.0 of 10

    A signed-sum (polarization) identity converts SAGIN offloading products into SOCP-friendly DC form, yielding an 8.9x speedup over sequential geometric programming on 200 random instances.

  7. An Efficient and Globally Optimal Algorithm for Nonconvex QCQP with One Equality Constraint

    math.OC 2025-06 reject novelty 4.0 of 10

    A two-stage diagonalization and bisection algorithm is proposed for nonconvex QCQP with one equality constraint, claiming global optimality and O(N^3) complexity.

Pith tools