AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Linear Convergence of Randomized Primal-Dual Coordinate Method for Large-scale Linear Constrained Convex Programming

Daoli Zhu, Lei Zhao

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
randomized block-coordinate updates (RPDC) instead of updating all blocks each iteration (APP-AL)SVM problem with heart scale and ionosphere scale datasets · SVM (heart scale, ionosphere scale)total iterations to reach suboptimality/feasibilityImproved
randomized block-coordinate updates (RPDC) instead of updating all blocks each iteration (APP-AL)SVM problem · SVM (heart scale, ionosphere scale)average computation time per iterationImproved
randomized coordinate descent (RCD) baseline replacing the primal-dual schemeSVM problem · SVM (heart scale, ionosphere scale)total iterations to convergenceHurt
linear convergence under global strong metric subregularity of the KKT mappingRPDC on SVM and MLP problems · SVM and MLPconvergence rateImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy