Learning to Select Between LP and SDP Relaxations for Nonconvex Quadratically Constrained Quadratic Programs
math.OC
Submitted: 2025-01-07
Updated: 2026-10-30
Code: https://github.com/mugededeoglu/learning-relaxation
Project page: https://networkx.github.io
Terminology
Sources
- Exact Semidefinite Formulations for a Class of (Random and Non-Random) Nonconvex Quadratic Programs
- Polynomial Optimization: Enhancing RLT relaxations with Conic Constraints
- The circle packing problem: a theoretical comparison of various convexification techniques
- On Representing Convex Quadratically Constrained Quadratic Programs via Graph Neural Networks
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise