most citedMinimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method

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

collaborators

2 papers

math.OC2024

Alternating Iteratively Reweighted and Subspace Newton Algorithms for Nonconvex Sparse Optimization

Hao Wang, Xiangyu Yang, Yichen Zhu

This paper presents a novel hybrid algorithm for minimizing the sum of a continuously differentiable loss function and a nonsmooth, possibly nonconvex, sparse regularization functi…

math.OC2021★ 1 cited

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method

Xiangyu Yang, Hao Wang, Yichen Zhu +1

We investigate a class of nonconvex optimization problems characterized by a feasible set consisting of level-bounded nonconvex regularizers, with a continuously differentiable obj…