AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences

Kinjal Basu, Ankan Saha, Shaunak Chatterjee

NeurIPS 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 5 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed low-discrepancy boundary sampling rather than uniform sampling on the unit square or sphereQCQP-to-QP approximation · Random convex QCQP examplesrelative squared errorImproved
Increase the number of sampled boundary points NQCQP-to-QP approximation · Random convex QCQP examplesrelative squared errorImproved
Replace the quadratic constraint with sampled tangent-plane linear constraintsLarge-scale QCQP · Synthetic QCQP, n ≥ 1000scalabilityImproved
Use low-discrepancy sampling rather than uniform sampling on [0,1]^nQCQP-to-QP approximation · Synthetic QCQP objective valuesobjective valueMixed
Use low-discrepancy sampling rather than uniform sampling on the unit sphereQCQP-to-QP approximation · Synthetic QCQP objective valuesobjective valueMixed
Use the sampled linear relaxation instead of SDP or RLT relaxationsQCQP solver · Synthetic QCQP, n ≥ 1000scalabilityImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy