A fast proximal point algorithm for _1-minimization problem in compressed sensing

DOI10.1016/J.AMC.2015.08.082MaRDI QIDQ670842zbMATH OpenOpenAlexFDO

Authors Yun Zhu, J. Wu, Gaohang Yu

Publication date 20 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.08.082

zbMATH Keywords

\(\ell_{1}\)-regularized least squarecompressed sensingproximal point algorithm

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Fast L1-L2 minimization via a proximal operator
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• A Projection Proximal-Point Algorithm for ℓ¹Minimization
• A dual split Bregman method for fast \(\ell ^{1}\) minimization
• An adaptive inverse scale space method for compressed sensing

Cites work

• A first-order primal-dual algorithm for convex problems with applications to imaging
• A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Bregmanized nonlocal regularization for deconvolution and sparse reconstruction
• Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• Hölder metric subregularity with applications to proximal point method
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Monotone Operators and the Proximal Point Algorithm
• Proximal-point algorithm using a linear proximal term
• The Split Bregman Method for L1-Regularized Problems

Cited in

(11)

• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
• Smoothed _1-regularization-based line search for sparse signal recovery
• Fast L1-L2 minimization via a proximal operator
• Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• An accelerated proximal augmented Lagrangian method and its application in compressive sensing
• A relaxed-PPA contraction method for sparse signal recovery
• Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators
• A proximal splitting method for separable convex programming and its application to compressive sensing
• A New Insight on Augmented Lagrangian Method with Applications in Machine Learning
• A generalized multi-parameterized proximal point algorithm for linearly constrained convex optimization problem

This page was built for publication: A fast proximal point algorithm for \(\ell_{1}\)-minimization problem in compressed sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670842)