The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
type: Item
instance of: scholarly article
title: The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
zbMATH Open document ID: 1379.65039
author: Yongchao Yu
author: Ji-Gen Peng
published in: Applied Numerical Mathematics
publication date: 2017-12-21T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6820915
zbMATH Keywords: sparse recovery
zbMATH Keywords: \(\ell_1\)-minimization
zbMATH Keywords: Dantzig selector
zbMATH Keywords: proximity operator
zbMATH Keywords: total-variation
zbMATH Keywords: algorithm
zbMATH Keywords: compressive sensing
zbMATH Keywords: convex composite model
zbMATH Keywords: iterative scheme
zbMATH Keywords: numerical result
zbMATH Keywords: total-variation minimization problems
describes a project that uses: SPGL1
describes a project that uses: NESTA
describes a project that uses: Yall1
describes a project that uses: TFOCS
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: j.apnum.2017.11.001
OpenAlex ID: W2767151063
cites work: Convex analysis and monotone operator theory in Hilbert spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
cites work: Templates for convex cone problems with applications to sparse signal recovery
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
cites work: The restricted isometry property and its implications for compressed sensing
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Decoding by Linear Programming
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Atomic decomposition by basis pursuit
cites work: A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: De-noising by soft-thresholding
cites work: Compressed sensing
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Least angle regression. (With discussion)
cites work: Sparse and Redundant Representations
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
cites work: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
cites work: Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing
cites work: An alternating direction method for finding Dantzig selectors
cites work: Proximity algorithms for image models: denoising
cites work: Smooth minimization of non-smooth functions
cites work: An Iterative Regularization Method for Total Variation-Based Image Restoration
cites work: Fast linearized Bregman iteration for compressive sensing and sparse denoising
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
cites work: Q4864293
cites work: Probing the Pareto Frontier for Basis Pursuit Solutions
cites work: The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: Analysis and Generalizations of the Linearized Bregman Method
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: A unified primal-dual algorithm framework based on Bregman iteration
DOI: 10.1016/J.APNUM.2017.11.001
description: scientific article; zbMATH DE number 6820915