Templates for convex cone problems with applications to sparse signal recovery
type: Item
instance of: scholarly article
title: Templates for convex cone problems with applications to sparse signal recovery
zbMATH Open document ID: 1257.90042
author: S. Becker
author: Emmanuel J. Candès
author: Michael C. Grant
published in: Mathematical Programming Computation
publication date: 2012-11-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1009.2065
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 62J07
zbMATH DE Number: 6110466
zbMATH Keywords: optimal first-order methods
zbMATH Keywords: Nesterov's accelerated descent algorithms
zbMATH Keywords: proximal algorithms
zbMATH Keywords: conic duality
zbMATH Keywords: smoothing by conjugation
zbMATH Keywords: Dantzig selector
zbMATH Keywords: LASSO
zbMATH Keywords: nuclear-norm minimization
describes a project that uses: FPC_AS
describes a project that uses: SPGL1
describes a project that uses: PROPACK
describes a project that uses: Mosek
describes a project that uses: NESTA
describes a project that uses: ParNes
describes a project that uses: L1-MAGIC
describes a project that uses: L1TestPack
describes a project that uses: CVX
describes a project that uses: PDCO
describes a project that uses: glmnet
MaRDI profile type: Publication
OpenAlex ID: W2119058682
arXiv ID: 1009.2065
cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3079664
cites work: NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
cites work: Probing the Pareto Frontier for Basis Pursuit Solutions
cites work: Q4830373
cites work: Q4821526
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Compressed sensing with coherent and redundant dictionaries
cites work: New multiscale transforms, minimum total variation synthesis: Applications to edge-preserving image reconstruction
cites work: Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
cites work: Exact matrix completion via convex optimization
cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Dualization of signal recovery problems
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
cites work: Least angle regression. (With discussion)
cites work: Analysis versus synthesis in signal priors
cites work: Exact Regularization of Convex Programs
cites work: A generalized proximal point algorithm for certain non-convex minimization problems
cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis
cites work: ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
cites work: Q4273942
cites work: DASSO: Connections Between the Dantzig Selector and Lasso
cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
cites work: An implementable proximal point algorithmic framework for nuclear norm minimization
cites work: Constructing Test Instances for Basis Pursuit Denoising
cites work: Nonlinear Perturbation of Linear Programs
cites work: Proximité et dualité dans un espace hilbertien
cites work: Q3809587
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smooth minimization of non-smooth functions
cites work: Fast linearized Bregman iteration for compressive sensing and sparse denoising
cites work: Convex Analysis
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Nonlinear total variation based noise removal algorithms
cites work: Wavelets and curvelets for image deconvolution: a combined approach
cites work: Q4864293

Templates for convex cone problems with applications to sparse signal recovery (cites work)
cites work: Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing

Templates for convex cone problems with applications to sparse signal recovery (cites work)
cites work: A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation

Templates for convex cone problems with applications to sparse signal recovery (cites work)
cites work: Sparse Reconstruction by Separable Approximation

Templates for convex cone problems with applications to sparse signal recovery (cites work)
cites work: Analysis and Generalizations of the Linearized Bregman Method

Templates for convex cone problems with applications to sparse signal recovery (cites work)
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

Templates for convex cone problems with applications to sparse signal recovery (DOI)
DOI: 10.1007/S12532-011-0029-5