A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
math.OC
Submitted: 2026-04-27
Updated: 2026-10-26
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
- Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
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