A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
From MaRDI portal
Abstract: The success of compressed sensing relies essentially on the ability to efficiently find an approximately sparse solution to an under-determined linear system. In this paper, we developed an efficient algorithm for the sparsity promoting -regularized least squares problem by coupling the primal dual active set strategy with a continuation technique (on the regularization parameter). In the active set strategy, we first determine the active set from primal and dual variables, and then update the primal and dual variables by solving a low-dimensional least square problem on the active set, which makes the algorithm very efficient. The continuation technique globalizes the convergence of the algorithm, with provable global convergence under restricted isometry property (RIP). Further, we adopt two alternative methods, i.e., a modified discrepancy principle and a Bayesian information criterion, to choose the regularization parameter. Numerical experiments indicate that our algorithm is very competitive with state-of-the-art algorithms in terms of accuracy and efficiency.
Recommendations
- A unified primal dual active set algorithm for nonconvex sparse recovery
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- scientific article; zbMATH DE number 7668285
- Nesterov's algorithm solving dual formulation for compressed sensing
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- A time continuation based fast approximate algorithm for compressed sensing related optimization
- On the Doubly Sparse Compressed Sensing Problem
Cited in
(24)- An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with L^1-control cost
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- High-dimensional linear regression with hard thresholding regularization: theory and algorithm
- A data-driven line search rule for support recovery in high-dimensional data analysis
- Numerical solution of time-dependent component with sparse structure of source term for a time fractional diffusion equation
- A ``nonconvex+nonconvex approach for image restoration with impulse noise removal
- An alternating direction method with continuation for nonconvex low rank minimization
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Recovering network topologies via Taylor expansion and compressive sensing
- An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions
- CT image reconstruction algorithms based on the Hanke Raus parameter choice rule
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- scientific article; zbMATH DE number 7626740 (Why is no real title available?)
- A primal dual active set with continuation algorithm for high-dimensional nonconvex SICA-penalized regression
- An inverse source problem with sparsity constraint for the time-fractional diffusion equation
- Truncated \(L_1\) regularized linear regression: theory and algorithm
- Tikhonov regularisation method for simultaneous inversion of the source term and initial data in a time-fractional diffusion equation
- Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions
- Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
- A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
- A second order primal-dual dynamical system for a convex-concave bilinear saddle point problem
- L 0 -regularized high-dimensional sparse multiplicative models
This page was built for publication: A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579613)
