9 citations · 29 across the 8 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2020★ 9 cited
Randomized Bregman Coordinate Descent Methods for Non-Lipschitz Optimization
Tianxiang Gao, Songtao Lu, Jia Liu +1
We propose a new \textit{randomized Bregman (block) coordinate descent} (RBCD) method for minimizing a composite problem, where the objective function could be either convex or non…
math.OC2019★ 5 cited
Leveraging Two Reference Functions in Block Bregman Proximal Gradient Descent for Non-convex and Non-Lipschitz Problems
Tianxiang Gao, Songtao Lu, Jia Liu +1
In the applications of signal processing and data analytics, there is a wide class of non-convex problems whose objective function is freed from the common global Lipschitz continu…