38 citations · 77 across the 21 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.LG2019★ 38 cited
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery
Jicong Fan, Lijun Ding, Yudong Chen +1
This paper develops a new class of nonconvex regularizers for low-rank matrix recovery. Many regularizers are motivated as convex relaxations of the matrix rank function. Our new f…
math.OC2019★ 1 cited
Bundle Method Sketching for Low Rank Semidefinite Programming
Lijun Ding, Benjamin Grimmer
In this paper, we show that the bundle method can be applied to solve semidefinite programming problems with a low rank solution without ever constructing a full matrix. To accompl…
math.OC2019★ 12 cited
An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity
Lijun Ding, Alp Yurtsever, Volkan Cevher +2
This paper develops a new storage-optimal algorithm that provably solves generic semidefinite programs (SDPs) in standard form. This method is particularly effective for weakly con…