Research map / Learning theory and algorithms / Combinatorial and search optimization
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Polynomial time guarantees for the Burer-Monteiro method (NeurIPS 2022 · similarity 0.93)
- The non-convex Burer-Monteiro approach works on smooth semidefinite programs (NeurIPS 2016 · similarity 0.92)
- A Scalable Frank-Wolfe-Based Algorithm for the Max-Cut SDP (ICML 2023 · similarity 0.89)
- Smoothed analysis of the low-rank approach for smooth semidefinite programs (NeurIPS 2018 · similarity 0.89)
- Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching (ICML 2024 · similarity 0.84)
- Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search (NeurIPS 2024 · similarity 0.84)
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.