Research map / Learning theory and algorithms / Matrix and tensor methods
A Scalable Frank-Wolfe-Based Algorithm for the Max-Cut SDP
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Frank-Wolfe on reformulated smooth Max-Cut problem (this paper) vs Yurtsever et al. (2021) | Gset graphs · Gset groups 1-7 | average Frank-Wolfe iterations to target relative error | Mixed |
| Frank-Wolfe on reformulated smooth Max-Cut problem vs Shinde et al. (2021) | Gset graphs · Gset groups 1-7 | average Frank-Wolfe iterations to target relative error | Helped |
| Diagonal shifting of cost matrix (Theorem 4.9) in practical experiments (ablation) | Frank-Wolfe Max-Cut method · Gset / experiments | practical performance | No clear effect |
Closest papers by meaning
- The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound (NeurIPS 2022 · similarity 0.89)
- Smoothed analysis of the low-rank approach for smooth semidefinite programs (NeurIPS 2018 · similarity 0.88)
- Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching (ICML 2024 · similarity 0.87)
- Structured Semidefinite Programming for Recovering Structured Preconditioners (NeurIPS 2023 · similarity 0.86)
- Simple Randomized Rounding for Max-Min Eigenvalue Augmentation (ICML 2025 · similarity 0.86)
- Revisiting Frank-Wolfe for Structured Nonconvex Optimization (NeurIPS 2025 · similarity 0.85)
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.