4 papers · 1 filter
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…
The Behavior of Error Bounds via Moreau Envelopes
Yu Wang, Shengjie Li, Yaohua Hu +2
In this paper, we first establish the equivalence of three types of error bounds: uniformized Kurdyka-Łojasiewicz (u-KL) property, uniformized level-set subdifferential error bound…
Convergence Rates of Subgradient Methods for Quasi-convex Optimization Problems
Yaohua Hu, Jiawen Li, Carisa Kwok Wai Yu
Quasi-convex optimization acts a pivotal part in many fields including economics and finance; the subgradient method is an effective iterative algorithm for solving large-scale qua…
Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
Yaohua Hu, Chong Li, Kaiwen Meng +1
The regularization problem with has been widely studied for finding sparse solutions of linear inverse problems and gained successful applications in various mat…