Optimization
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. 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
- Math-4569 Near-Optimal Algorithms for Mixed-Integer Convex Optimization
- Math-4570 Linear Bounds for Minimally Integer-Infeasible Systems
- Math-4571 Approximating Maximum Nonsymmetric Principal Subdeterminants
- Math-4576 Deterministic Optimization of Top-$k$ Perfect-Matching Edges
- Math-4593 Convex Relaxations for Planted Graph Matching
- Math-4600 Global Margin Maximization beyond the Neural Tangent Regime
- Math-4605 Duality and Convergence Rates in Lasserre Hierarchies
- Math-4610 Global Convergence of Low-Rank Multi-Penalty Optimization
- Math-4616 Moment-SOS Convergence for PDE-Constrained Variational Problems
- Math-4620 Integer Feasibility with Bounded Subdeterminants
- Math-4627 Complexity-Bounded Computation of Maximum Destabilizing Subgroups
- Math-4628 Minimal Convex Difference Decompositions of CPWL Functions
- Math-4634 Semidefinite Relaxations for Quantum Equilibria
- Math-4985 Beyond Convex Optimization
- Math-5022 Semialgebraic stratification of maximum likelihood
- Math-5160 Optimization with Inexact Real-Valued Inputs
- Math-5167 Sharper Complexity Bounds for Full-Newton Interior-Point Methods
- Math-5179 Practical Strength of Lift-and-Project Relaxations
- Math-5180 Integrality-Gap Reduction by Lift-and-Project Closures
- Math-5181 Higher-Row Cuts from Cylindrical Simplices
- Math-5182 Symmetry-Aware Rank-One Convex Interpolation Algorithms
- Math-5183 Runtime Thresholds for Ant-Colony Optimization
- Math-5192 Faster Rank-Two Parametric Assignment
- Math-5201 Fundamental-Domain Choice in Symmetric Integer Programming
- Math-5215 Interior Maximizers of Mixed Characteristic Polynomials
- Math-5223 Open Problems in Mixed-Integer Nonlinear Optimization
- Math-5224 Convexification and Complexity in Mixed-Integer Optimization
- Math-5225 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- Math-5237 Cutting Planes Lower Bounds for Random CNF Formulas
- Math-5239 Random CNF Lower Bounds beyond Cutting Planes
- Math-5241 Ordered-Median Facility Location
- Math-5242 Certificates of Polynomial Nonnegativity in Copositive Optimization
- Math-5243 Deterministic Components of Stochastic Optimization
- Math-5247 Local Algorithms for Semidefinite Programming
- Math-5249 The Polynomial Hirsch Conjecture
- Math-5255 Automatic Recognition of Numerically Unstable Quadratic Programs
- Math-5256 Adaptive Refinement and Global Optimization of Topological Shapes
- Math-5259 Primal and Dual Geometry of SONC Relaxations
- Math-5265 Algorithms for Symmetry-Reduced Semidefinite Programs
- Math-5267 Unspecified Combinatorial Optimization Problem
- Math-5283 Unspecified Conic Optimization Research Problem
- Math-5285 Condition-Number-Robust Low-Rank Matrix Completion
- Math-5296 Neural Approximation of Strongly Convex Drifts with Linear Error
- Math-5308 Abelian Embeddings and Gap-CSP Integrality Gaps
- Math-5310 Autoencoder Optimization Perspectives
- Math-5315 Duplicate Strongly Polynomial Linear-Programming Lead-In
- Math-5316 Workshop Contents Listing for Combinatorial Optimization
- Math-5322 Half-Integral Extreme Points for a Feedback-Vertex-Set Relaxation
- Math-5325 Adam Optimization Performance
- Math-5336 Dimension-Free Sum-of-Squares Certificates for Two Quadratic Constraints