3 citations · 8 across the 9 of their papers we have counts for
10 papers
Stochastic Trust-Region Methods for Over-parameterized Models
Aike Yang, Hao Wang
Under interpolation-type assumptions such as the strong growth condition, stochastic optimization methods can attain convergence rates comparable to full-batch methods, but their p…
Regularization for Sparse Optimization: Consistency and Global Convergence
Yaohua Hu, Hao Wang, Xiaoqi Yang
The regularization method has a strong sparsity promoting capability in approaching sparse solutions of linear inverse problems and gained successful applicatio…
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…
Avoiding strict saddle points of nonconvex regularized problems
Luwei Bai, Yaohua Hu, Hao Wang +1
In this paper, we consider a class of non-convex and non-smooth sparse optimization problems, which encompass most existing nonconvex sparsity-inducing terms. We show the second-or…
A Screening Strategy for Structured Optimization Involving Nonconvex Regularization
Tiange Li, Xiangyu Yang, Hao Wang
In this paper, we develop a simple yet effective screening rule strategy to improve the computational efficiency in solving structured optimization involving nonconvex …
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…
Relating lp regularization and reweighted l1 regularization
Hao Wang, Hao Zeng, Jiashan Wang
We propose a general framework of iteratively reweighted l1 methods for solving lp regularization problems. We prove that after some iteration k, the iterates generated by the prop…