Research map / Optimization / Nonconvex and smooth optimization
Memory-Constrained Algorithms for Convex Optimization
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
- Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives (NeurIPS 2018 · similarity 0.90)
- Smooth Convex Optimization Using Sub-Zeroth-Order Oracles (AAAI 2021 · similarity 0.89)
- An Ellipsoid Algorithm for Online Convex Optimization (NeurIPS 2025 · similarity 0.89)
- Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity (NeurIPS 2022 · similarity 0.88)
- A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles (ICML 2024 · similarity 0.87)
- A Study of First-Order Methods with a Deterministic Relative-Error Gradient Oracle (ICML 2024 · similarity 0.87)
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.