Research map / Optimization / Optimizers
Local Minima in Quadratic-Penalty Relaxations of Binary Linear Programs
Cheng-Han Huang, Yongliang Sun, Chaoyan Huang, Ismail Alkhouri, Rongrong Wang
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use ancestor penalty instead of naive parent penalty for precedence constraints (ablation) | Open-pit mining relaxed QUBO with PGD · MineLib raw block models | feasibility rate: 0% (0/20) -> 100% (20/20) | Improved |
| use ancestor penalty instead of naive parent penalty (ablation) | Open-pit mining relaxed QUBO with PGD · MineLib raw block models | binarity rate: 60% (12/20) -> 100% (20/20) | Improved |
| use diagonal-cancelled (binary-equivalent) penalty instead of raw squared residual (ablation) | 0-1 knapsack relaxed QUBO with projected Adam · kplib instances | binarity rate: 0% (0/20) -> 100% (20/20) | Improved |
| increase penalty weight 1000x (gamma_small to gamma_large) for naive knapsack QUBO (ablation) | naive knapsack QUBO · kplib instances | binarity rate: 0% (0/20) -> 0% (0/20) | No clear effect |
| use square-free (diagonal-cancelled) assignment penalty instead of naive penalty (ablation) | time-indexed TSP relaxed QUBO with PGD · TSPLIB instances, gamma_small | feasibility rate: 0% (0/20) -> 100% (20/20) | Improved |
| increase penalty weight 1000x for naive TSP QUBO (ablation) | naive time-indexed TSP QUBO · TSPLIB instances | binarity rate: 0% (0/20) -> 5% (1/20) | No clear effect |
| use PGD on relaxed QUBO instead of Gurobi for MIS under 5-minute budget | MIS on Erdos-Renyi graphs · n 2000 to 40000, p 0.3/0.5/0.7 | average independent set size: 27 vs 21.875 (n=2000, p=0.3) | Improved |
| compare PGD with SLS and GRASP heuristics at 5 minutes | PGD for MIS · Erdos-Renyi representative subset | average independent set size: 16 vs 16.125 (SLS) vs 17 (GRASP), n=4000, p=0.5 | No clear effect |
| add batched parallel restarts on one GPU | PGD for MIS · Erdos-Renyi, 30 s budget | average independent set size: 191.5 -> 200.75 (n=3000, p=1/30) | Improved |
| increase penalty weight alone for naive open-pit parent penalty | Open-pit parent QUBO · theory (Lemma 3.3) | feasibility of local minima | No clear effect |
Closest papers by meaning
- Differentiable Quadratic Optimization For the Maximum Independent Set Problem (ICML 2025 · similarity 0.87)
- Predicting Lagrangian Multipliers for Mixed Integer Linear Programs (ICML 2024 · similarity 0.86)
- Deep Distributed Optimization for Large-Scale Quadratic Programming (ICLR 2025 · similarity 0.86)
- Differentiable extensions with rounding guarantees for combinatorial optimization over permutations (NeurIPS 2025 · similarity 0.85)
- On the Universal Near Optimality of Hedge in Combinatorial Settings (NeurIPS 2025 · similarity 0.85)
- Conditional Gradient Methods with Standard LMO for Stochastic Simple Bilevel Optimization (NeurIPS 2025 · similarity 0.85)
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.
