Research map / Optimization / Nonconvex and smooth optimization
Linear Convergence of Randomized Feasible Descent Methods Under the Weak Strong Convexity Assumption
Chenxin Ma, Rachael Tappenden, Martin Takáč
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
- Random extrapolation for primal-dual coordinate descent (ICML 2020 · similarity 0.90)
- Linear Convergence of Randomized Primal-Dual Coordinate Method for Large-scale Linear Constrained Convex Programming (ICML 2020 · similarity 0.88)
- Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization (NeurIPS 2017 · similarity 0.88)
- Coordinate Descent Methods for DC Minimization: Optimality Conditions and Global Convergence (AAAI 2023 · similarity 0.88)
- Dykstra's Algorithm, ADMM, and Coordinate Descent: Connections, Insights, and Extensions (NeurIPS 2017 · similarity 0.87)
- Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems (NeurIPS 2026 · 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.
