Research map / Optimization / Nonconvex and smooth optimization
RandProx: Primal-Dual Optimization Algorithms with Randomized Proximal Updates
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
- A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization (NeurIPS 2018 · similarity 0.91)
- Proximal and Federated Random Reshuffling (ICML 2022 · similarity 0.90)
- Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints (ICML 2025 · similarity 0.90)
- Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization (ICML 2025 · similarity 0.88)
- Universality of AdaGrad Stepsizes for Stochastic Optimization: Inexact Oracle, Acceleration and Variance Reduction (NeurIPS 2024 · similarity 0.87)
- Non-convex Stochastic Composite Optimization with Polyak Momentum (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.