Research map / Optimization / Nonconvex and smooth optimization
Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives
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
- Memory-Constrained Algorithms for Convex Optimization (NeurIPS 2023 · similarity 0.90)
- Fast Projection-Free Approach (without Optimization Oracle) for Optimization over Compact Convex Set (NeurIPS 2025 · similarity 0.87)
- Linear-Memory and Decomposition-Invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes (NeurIPS 2016 · similarity 0.87)
- Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes (NeurIPS 2021 · similarity 0.87)
- Blended Conditonal Gradients (ICML 2019 · similarity 0.87)
- 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.