Research map / Optimization / Nonconvex and smooth optimization
Lower Bounds for Frank-Wolfe on Strongly Convex Sets
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
- Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets (AAAI 2019 · similarity 0.92)
- Frank-Wolfe Beyond 1/t Convergence (NeurIPS 2026 · similarity 0.92)
- Affine Invariant Analysis of Frank-Wolfe on Strongly Convex Sets (ICML 2021 · similarity 0.88)
- Last-Iterate Convergence for Generalized Frank-Wolfe in Monotone Variational Inequalities (NeurIPS 2024 · similarity 0.87)
- Revisiting Frank-Wolfe for Structured Nonconvex Optimization (NeurIPS 2025 · similarity 0.85)
- Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search (NeurIPS 2024 · 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.