13 citations · 38 across the 17 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.OC2022
Accelerated projected gradient algorithms for sparsity constrained optimization problems
Jan Harold Alcantara, Ching-pei Lee
We consider the projected gradient algorithm for the nonconvex best subset selection problem that minimizes a given empirical loss function under an -norm constraint. Throu…
cs.LG2022★ 1 cited
Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
Ching-pei Lee, Ling Liang, Tianyun Tang +1
This work proposes a rapid algorithm, BM-Global, for nuclear-norm-regularized convex and low-rank matrix optimization problems. BM-Global efficiently decreases the objective value…
math.OC2022
Global convergence and acceleration of projection methods for feasibility problems involving union convex sets
Jan Harold Alcantara, Ching-pei Lee
We prove global convergence of classical projection algorithms for feasibility problems involving union convex sets, which refer to sets expressible as the union of a finite number…