Doubly iteratively reweighted algorithm for constrained compressed sensing models
From MaRDI portal
Abstract: We propose a new algorithmic framework for constrained compressed sensing models that admit nonconvex sparsity-inducing regularizers including the log-penalty function as objectives, and nonconvex loss functions such as the Cauchy loss function and the Tukey biweight loss function in the constraint. Our framework employs iteratively reweighted and schemes to construct subproblems that can be efficiently solved by well-developed solvers for basis pursuit denoising such as SPGL1 [6]. We propose a new termination criterion for the subproblem solvers that allows them to return an infeasible solution, with a suitably constructed feasible point satisfying a descent condition. The feasible point construction step is the key for establishing the well-definedness of our proposed algorithm, and we also prove that any accumulation point of this sequence of feasible points is a stationary point of the constrained compressed sensing model, under suitable assumptions. Finally, we compare numerically our algorithm (with subproblems solved by SPGL1 or the alternating direction method of multipliers) against the SCP in [41] on solving constrained compressed sensing models with the log-penalty function as the objective and the Cauchy loss function in the constraint, for badly-scaled measurement matrices. Our computational results show that our approaches return solutions with better recovery errors, and are always faster.
Recommendations
- Iterative \({\ell_1}\) minimization for non-convex compressed sensing
- Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing
- Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
- Compressed sensing recovery via nonconvex shrinkage penalties
- An iteratively reweighted least squares algorithm for sparse regularization
Cites work
- A coordinate gradient descent method for nonsmooth separable minimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A mathematical introduction to compressive sensing
- Accelerated and inexact forward-backward algorithms
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An augmented Lagrangian approach for sparse principal component analysis
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- Convex Analysis
- DC programming and DCA: thirty years of developments
- Decoding by Linear Programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- First-order methods in optimization
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Level-set methods for convex optimization
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- MM optimization algorithms
- Monitoring robust regression
- Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Probing the Pareto frontier for basis pursuit solutions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust Estimation of a Location Parameter
- Robust techniques for signal processing: A survey
- Signal Recovery by Proximal Forward-Backward Splitting
- Smooth minimization of non-smooth functions
- Techniques for nonlinear least squares and robust regression
- Templates for convex cone problems with applications to sparse signal recovery
- Variational Analysis
Cited in
(3)
This page was built for publication: Doubly iteratively reweighted algorithm for constrained compressed sensing models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6097766)
