Probing the Pareto frontier for basis pursuit solutions

DOI10.1137/080714488zbMATH Open1193.49033OpenAlexW2083042020MaRDI QIDQ3558672FDOQ3558672

Authors: Ewout van den Berg, Michael P. Friedlander

Publication date: 6 May 2010

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/67410b26b2d54f78b9fd06ee6100572ef288a810

Recommendations

Atomic Decomposition by Basis Pursuit
On the stability of the basis pursuit in the presence of noise
Atomic decomposition by basis pursuit
A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

duality sparse solutions Newton's method root-finding projected gradient basis pursuit convex program one-norm regularization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29)

Cited In (only showing first 100 items - show all)

Reconstruction of jointly sparse vectors via manifold optimization
Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
The modified accelerated Bregman method for regularized basis pursuit problem
Optimized Sampling for Multiscale Dynamics
Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
Sparsity optimization in design of multidimensional filter networks
Sparse approximate solution of partial differential equations
Numerical methods for $A$-optimal designs with a sparsity constraint for ill-posed inverse problems
A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
A cyclic projected gradient method
Greedy subspace pursuit for joint sparse recovery
A performance guarantee for orthogonal matching pursuit using mutual coherence
On efficiently solving the subproblems of a level-set method for fused lasso problems
The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with $l_1$-norm
A level-set method for convex optimization with a feasible solution path
Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
A perturbation view of level-set methods for convex optimization
Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
Level set methods for stochastic discontinuity detection in nonlinear problems
A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
The distance between convex sets with Minkowski sum structure: application to collision detection
New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints
Enhancing sparsity of Hermite polynomial expansions by iterative rotations
Alternating direction method of multipliers for solving dictionary learning models
Numerical analysis for conservation laws using $l_1$ minimization
Optimality properties of an augmented Lagrangian method on infeasible problems
Analysis of basis pursuit via capacity sets
A practical guide to the recovery of wavelet coefficients from Fourier measurements
GPU accelerated greedy algorithms for compressed sensing
Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
Recovery of seismic wavefields by an $l_{q}$-norm constrained regularization method
Fusion of sparse reconstruction algorithms for multiple measurement vectors
Optimal dual certificates for noise robustness bounds in compressive sensing
A note on the spectral gradient projection method for nonlinear monotone equations with applications
Underdetermined separation of speech mixture based on sparse Bayesian learning
A regularized semi-smooth Newton method with projection steps for composite convex programs
Linearized alternating directions method for $\ell_1$-norm inequality constrained $\ell_1$-norm minimization
Extracting Sparse High-Dimensional Dynamics from Limited Data
A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
Performance comparisons of greedy algorithms in compressed sensing.
Sampling in the analysis transform domain
Super-resolution radar
Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
Primal-dual first-order methods for a class of cone programming
Polyak's gradient method for split feasibility problem constrained by level sets
Basis adaptive sample efficient polynomial chaos (BASE-PC)
Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
The matrix splitting based proximal fixed-point algorithms for quadratically constrained $\ell_{1}$ minimization and Dantzig selector
Sparse representation based two-dimensional direction of arrival estimation using co-prime array
Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique
Combining line search and trust-region methods forℓ1-minimization
CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
An active-set proximal-Newton algorithm for $\ell_1$ regularized optimization problems with box constraints
A pseudo-heuristic parameter selection rule for $l^1$-regularized minimization problems
Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
Numerical integration in multiple dimensions with designed quadrature
Compressive sensing with cross-validation and stop-sampling for sparse polynomial chaos expansions
Stochastic collocation methods via $\ell_1$ minimization using randomized quadratures
Randomized block proximal damped Newton method for composite self-concordant minimization
Compressive Sensing
Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
Iterative choice of the optimal regularization parameter in TV image restoration
Sparse polynomial chaos expansions: literature survey and benchmark
Easy implementation of advanced tomography algorithms using the ASTRA toolbox with spot operators
Two-dimensional random projection
Fixed point and Bregman iterative methods for matrix rank minimization
Iterative reweighted minimization methods for $l_p$ regularized unconstrained nonlinear programming
Gradient descent and fast artificial time integration
Algorithms that satisfy a stopping criterion, probably
Accelerated linearized Bregman method
Infinite-dimensional compressed sensing and function interpolation
A gradient enhanced $\ell_{1}$-minimization for sparse approximation of polynomial chaos expansions
On the representation of functions with Gaussian wave packets
A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
Stochastic collocation algorithms using $l_1$-minimization for Bayesian solution of inverse problems
Phase transitions for greedy sparse approximation algorithms
Generalized Kalman smoothing: modeling and algorithms
$L^1$ regularization method in electrical impedance tomography by using the $L^1$-curve (Pareto frontier curve)
Penalty methods for a class of non-Lipschitz optimization problems
A non-adapted sparse approximation of PDEs with stochastic inputs
A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron
Fast projection onto the simplex and the $l_1$ ball
Convergence of fixed-point continuation algorithms for matrix rank minimization
Sparse identification of nonlinear dynamical systems via reweighted $\ell_1$-regularized least squares
Primal and dual alternating direction algorithms for $\ell _{1}$-$\ell _{1}$-norm minimization problems in compressive sensing
Sparse solutions of a class of constrained optimization problems
A projection method for convex constrained monotone nonlinear equations with applications
ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
Matrix-free interior point method for compressed sensing problems
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
Level-set methods for convex optimization
A numerical exploration of compressed sampling recovery
An efficient projection method for nonlinear inverse problems with sparsity constraints
Sparse high-dimensional FFT based on rank-1 lattice sampling

Uses Software

SeDuMi
NBI
Spot
Sparco

This page was built for publication: Probing the Pareto frontier for basis pursuit solutions

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