On the Complexity Analysis of Randomized Block-Coordinate Descent Methods

21 May 2013

Papers citing "On the Complexity Analysis of Randomized Block-Coordinate Descent Methods"

8 / 8 papers shown

Title
MoFO: Momentum-Filtered Optimizer for Mitigating Forgetting in LLM Fine-Tuning Yupeng Chen Senmiao Wang Zhihang Lin Zhihang Lin Yushun Zhang Tian Ding Ruoyu Sun Ruoyu Sun CLL 125 3 0 30 Jul 2024
Accelerated Primal-Dual Proximal Block Coordinate Updating Methods for Constrained Convex Optimization Yangyang Xu Shuzhong Zhang 50 23 0 17 Feb 2017
Coordinate Friendly Structures, Algorithms and Applications Zhimin Peng Tianyu Wu Yangyang Xu Ming Yan W. Yin 57 74 0 05 Jan 2016
A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming Zhaosong Lu Lin Xiao 56 32 0 25 Jun 2013
Inexact Coordinate Descent: Complexity and Preconditioning R. Tappenden Peter Richtárik J. Gondzio 62 100 0 19 Apr 2013
Parallel Coordinate Descent Methods for Big Data Optimization Peter Richtárik Martin Takáč 94 487 0 04 Dec 2012
Proximal Stochastic Dual Coordinate Ascent Shai Shalev-Shwartz Tong Zhang 61 111 0 12 Nov 2012
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function Peter Richtárik Martin Takáč 86 769 0 14 Jul 2011