2 citations · 5 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization
Hao Wang, Ye Wang, Xiangyu Yang
This paper considers the problem of minimizing the sum of a smooth function and the Schatten- norm of the matrix. Our contribution involves proposing accelerated iteratively rew…
An Iteratively Reweighted Method for Sparse Optimization on Nonconvex Ball
Hao Wang, Xiangyu Yang, Wei Jiang
This paper is intended to solve the nonconvex -ball constrained nonlinear optimization problems. An iteratively reweighted method is proposed, which solves a sequence of…
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…
Towards An Efficient Approach for the Nonconvex Ball Projection: Algorithm and Analysis
Xiangyu Yang, Jiashan Wang, Hao Wang
This paper primarily focuses on computing the Euclidean projection of a vector onto the ball in which . Such a problem emerges as the core building block in s…