The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
From MaRDI portal
Publication:4579333
Abstract: In the area of sparse recovery, numerous researches hint that non-convex penalties might induce better sparsity than convex ones, but up until now those corresponding non-convex algorithms lack convergence guarantees from the initial solution to the global optimum. This paper aims to provide performance guarantees of a non-convex approach for sparse recovery. Specifically, the concept of weak convexity is incorporated into a class of sparsity-inducing penalties to characterize the non-convexity. Borrowing the idea of the projected subgradient method, an algorithm is proposed to solve the non-convex optimization problem. In addition, a uniform approximate projection is adopted in the projection step to make this algorithm computationally tractable for large scale problems. The convergence analysis is provided in the noisy scenario. It is shown that if the non-convexity of the penalty is below a threshold (which is in inverse proportion to the distance between the initial solution and the sparse signal), the recovered solution has recovery error linear in both the step size and the noise term. Numerical simulations are implemented to test the performance of the proposed approach and verify the theoretical analysis.
Cited in
(19)- Weak fault detection of tapered rolling bearing based on penalty regularization approach
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- A survey on some recent developments of alternating direction method of multipliers
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- scientific article; zbMATH DE number 7306909 (Why is no real title available?)
- Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
- On high-dimensional Poisson models with measurement error: hypothesis testing for nonlinear nonconvex optimization
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
- On choosing initial values of iteratively reweighted \(\ell_1\) algorithms for the piece-wise exponential penalty
- A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization
- Adaptive Huber trace regression with low-rank matrix parameter via nonconvex regularization
- A new generalized shrinkage conjugate gradient method for sparse recovery
- A Bregman ADMM for robust fused Lasso estimation with doubly nonconvex regularizers
- Two types of two-step inertial ADMM algorithms and their applications in multi-block optimization problems
This page was built for publication: The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579333)
