Qing Ling

most citedSolving Non-smooth Constrained Programs with Lower Complexity than

O (1/ ε)

: A Primal-Dual Homotopy Smoothing Approach

7 citations · 9 across the 2 of their papers we have counts for

collaborators

2 papers

math.OC2018★ 7 cited

Solving Non-smooth Constrained Programs with Lower Complexity than $O (1/ ε)$ : A Primal-Dual Homotopy Smoothing Approach

Xiaohan Wei, Hao Yu, Qing Ling +1

We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly con…

cs.IT2015★ 2 cited

Recoverability of Group Sparse Signals from Corrupted Measurements via Robust Group Lasso

Xiaohan Wei, Qing Ling, Zhu Han

This paper considers the problem of recovering a group sparse signal matrix $Y = [y_{1}, \dots, y_{L}]$ from sparsely corrupted measurements $\mathbf{M} = […

Solving Non-smooth Constrained Programs with Lower Complexity than O(1/ε): A Primal-Dual Homotopy Smoothing Approach

Recoverability of Group Sparse Signals from Corrupted Measurements via Robust Group Lasso

Solving Non-smooth Constrained Programs with Lower Complexity than $O (1/ ε)$ : A Primal-Dual Homotopy Smoothing Approach