$Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach$

Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$ : A Primal-Dual Homotopy Smoothing Approach

5 September 2018

Papers citing "Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach"

3 / 3 papers shown

Title
Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates Dong Yin Yudong Chen Kannan Ramchandran Peter L. Bartlett OOD FedML 113 1,492 0 05 Mar 2018
Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than $O(1/ε)$ Yi Tian Xu Yan Yan Qihang Lin Tianbao Yang 62 25 0 13 Jul 2016
A Proximal-Gradient Homotopy Method for the Sparse Least-Squares Problem Lin Xiao Tong Zhang 76 146 0 14 Mar 2012