Research map / Optimization / Nonconvex and smooth optimization
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent
Huan Li, Zhouchen Lin
Read the paperCheck your idea against 137,217 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
- Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization (NeurIPS 2017 · similarity 0.90)
- Random extrapolation for primal-dual coordinate descent (ICML 2020 · similarity 0.90)
- Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints (NeurIPS 2024 · similarity 0.89)
- Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints (ICML 2025 · similarity 0.88)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · similarity 0.88)
- Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique (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.
