Optimization
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
103 records · Search and filter
- CS-380 Near-Optimal Algorithms for Mixed-Integer Convex Optimization
- CS-381 Linear Bounds for Minimally Integer-Infeasible Systems
- CS-382 Approximating Maximum Nonsymmetric Principal Subdeterminants
- CS-387 Deterministic Optimization of Top-$k$ Perfect-Matching Edges
- CS-404 Convex Relaxations for Planted Graph Matching
- CS-411 Global Margin Maximization beyond the Neural Tangent Regime
- CS-416 Duality and Convergence Rates in Lasserre Hierarchies
- CS-421 Global Convergence of Low-Rank Multi-Penalty Optimization
- CS-427 Moment-SOS Convergence for PDE-Constrained Variational Problems
- CS-431 Integer Feasibility with Bounded Subdeterminants
- CS-438 Complexity-Bounded Computation of Maximum Destabilizing Subgroups
- CS-439 Minimal Convex Difference Decompositions of CPWL Functions
- CS-445 Semidefinite Relaxations for Quantum Equilibria
- CS-450 Beyond Convex Optimization
- CS-487 Semialgebraic stratification of maximum likelihood
- CS-625 Optimization with Inexact Real-Valued Inputs
- CS-632 Sharper Complexity Bounds for Full-Newton Interior-Point Methods
- CS-644 Practical Strength of Lift-and-Project Relaxations
- CS-645 Integrality-Gap Reduction by Lift-and-Project Closures
- CS-646 Higher-Row Cuts from Cylindrical Simplices
- CS-647 Symmetry-Aware Rank-One Convex Interpolation Algorithms
- CS-648 Runtime Thresholds for Ant-Colony Optimization
- CS-657 Faster Rank-Two Parametric Assignment
- CS-666 Fundamental-Domain Choice in Symmetric Integer Programming
- CS-680 Interior Maximizers of Mixed Characteristic Polynomials
- CS-688 Open Problems in Mixed-Integer Nonlinear Optimization
- CS-689 Convexification and Complexity in Mixed-Integer Optimization
- CS-690 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- CS-702 Cutting Planes Lower Bounds for Random CNF Formulas
- CS-704 Random CNF Lower Bounds beyond Cutting Planes
- CS-706 Ordered-Median Facility Location
- CS-707 Certificates of Polynomial Nonnegativity in Copositive Optimization
- CS-708 Deterministic Components of Stochastic Optimization
- CS-712 Local Algorithms for Semidefinite Programming
- CS-714 The Polynomial Hirsch Conjecture
- CS-720 Automatic Recognition of Numerically Unstable Quadratic Programs
- CS-721 Adaptive Refinement and Global Optimization of Topological Shapes
- CS-724 Primal and Dual Geometry of SONC Relaxations
- CS-730 Algorithms for Symmetry-Reduced Semidefinite Programs
- CS-732 Unspecified Combinatorial Optimization Problem
- CS-748 Unspecified Conic Optimization Research Problem
- CS-750 Condition-Number-Robust Low-Rank Matrix Completion
- CS-761 Neural Approximation of Strongly Convex Drifts with Linear Error
- CS-773 Abelian Embeddings and Gap-CSP Integrality Gaps
- CS-775 Autoencoder Optimization Perspectives
- CS-780 Duplicate Strongly Polynomial Linear-Programming Lead-In
- CS-781 Workshop Contents Listing for Combinatorial Optimization
- CS-787 Half-Integral Extreme Points for a Feedback-Vertex-Set Relaxation
- CS-790 Adam Optimization Performance
- CS-801 Dimension-Free Sum-of-Squares Certificates for Two Quadratic Constraints