New RGraSP framework for efficient non-convex optimization.
problem Large-scale non-convex sparsity-constrained optimization problems.
method Relaxed gradient support pursuit with semi-stochastic gradient hard thresholding.
result Our algorithms converge faster with lower per-iteration cost.