Probing the Pareto Frontier for Basis Pursuit Solutions
From MaRDI portal
Publication:3558672
DOI10.1137/080714488zbMath1193.49033OpenAlexW2083042020MaRDI QIDQ3558672
Michael P. Friedlander, Ewout van den Berg
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
Newton's methoddualityconvex programsparse solutionsroot-findingprojected gradientbasis pursuitone-norm regularization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods involving duality (49M29)
Related Items (only showing first 100 items - show all)
Sparsity optimization in design of multidimensional filter networks ⋮ A fast \(\ell_1\)-solver and its applications to robust face recognition ⋮ Fusion of sparse reconstruction algorithms for multiple measurement vectors ⋮ Projections onto the canonical simplex with additional linear inequalities ⋮ Global sensitivity analysis based on high-dimensional sparse surrogate construction ⋮ A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm ⋮ Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique ⋮ Numerical Integration in Multiple Dimensions with Designed Quadrature ⋮ Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions ⋮ Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation ⋮ An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing ⋮ A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging ⋮ A General Theory of Singular Values with Applications to Signal Denoising ⋮ Extracting Sparse High-Dimensional Dynamics from Limited Data ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis ⋮ Nonlinear regularization techniques for seismic tomography ⋮ A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems ⋮ Group SLOPE – Adaptive Selection of Groups of Predictors ⋮ The modified accelerated Bregman method for regularized basis pursuit problem ⋮ An Iterative Reduction FISTA Algorithm for Large-Scale LASSO ⋮ Generalized conditional gradient method for elastic-net regularization ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ Performance comparisons of greedy algorithms in compressed sensing ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ Analysis of sparse recovery for Legendre expansions using envelope bound ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization ⋮ Matrix-Free Convex Optimization Modeling ⋮ A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ A simple homotopy proximal mapping algorithm for compressive sensing ⋮ Basis adaptive sample efficient polynomial chaos (BASE-PC) ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Super-resolution radar ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ Polynomial approximation via compressed sensing of high-dimensional functions on lower sets ⋮ Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures ⋮ A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems ⋮ Compressive Sensing ⋮ Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing ⋮ A greedy Newton-type method for multiple sparse constraint problem ⋮ AAA interpolation of equispaced data ⋮ Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification ⋮ Calibration of reduced-order model for a coupled Burgers equations based on PC-EnKF ⋮ Optimized Sampling for Multiscale Dynamics ⋮ A projected gradient method for αℓ 1 − βℓ 2 sparsity regularization ** ⋮ An Introduction to Compressed Sensing ⋮ Accelerating Sparse Recovery by Reducing Chatter ⋮ A fast homotopy algorithm for gridless sparse recovery ⋮ Discrete chirp-Fourier transform and its application to chirp rate estimation ⋮ Inexact primal–dual gradient projection methods for nonlinear optimization on convex set ⋮ Error Localization of Best $L_{1}$ Polynomial Approximants ⋮ Relaxed Regularization for Linear Inverse Problems ⋮ Simultaneous-shot inversion for PDE-constrained optimization problems with missing data ⋮ Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices ⋮ IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems ⋮ Penalty Methods for a Class of Non-Lipschitz Optimization Problems ⋮ Gradient descent and fast artificial time integration ⋮ Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ ⋮ Lattice-Based Patterned Fabric Inspection by Using Total Variation with Sparsity and Low-Rank Representations ⋮ Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere ⋮ Linearized alternating directions method for \(\ell_1\)-norm inequality constrained \(\ell_1\)-norm minimization ⋮ Faster gradient descent and the efficient recovery of images ⋮ A Practical Guide to the Recovery of Wavelet Coefficients from Fourier Measurements ⋮ An Efficient Proximal Block Coordinate Homotopy Method for Large-Scale Sparse Least Squares Problems ⋮ CURVELET-WAVELET REGULARIZED SPLIT BREGMAN ITERATION FOR COMPRESSED SENSING ⋮ Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals ⋮ Unnamed Item ⋮ On the Probabilistic Cauchy Theory for Nonlinear Dispersive PDEs ⋮ Exact Clustering of Weighted Graphs via Semidefinite Programming ⋮ Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Relaxed Regularization for Linear Inverse Problems ⋮ The Gap between Theory and Practice in Function Approximation with Deep Neural Networks ⋮ Accelerated Iterative Regularization via Dual Diagonal Descent ⋮ Stochastic Collocation Algorithms Using $l_1$-Minimization for Bayesian Solution of Inverse Problems ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems ⋮ Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions ⋮ Alternating direction method of multipliers for solving dictionary learning models ⋮ Recovering Wavelet Coefficients from Binary Samples Using Fast Transforms ⋮ Primal–dual first-order methods for a class of cone programming ⋮ An Algorithm Solving Compressive Sensing Problem Based on Maximal Monotone Operators ⋮ Sparse Solutions of a Class of Constrained Optimization Problems ⋮ On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels ⋮ An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint ⋮ Nonuniform recovery of fusion frame structured sparse signals ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems ⋮ A modified Newton projection method for \(\ell _1\)-regularized least squares image deblurring ⋮ Solving Basis Pursuit ⋮ Combining line search and trust-region methods forℓ1-minimization ⋮ Algorithms that satisfy a stopping criterion, probably ⋮ Efficient projection algorithms onto the weighted \(\ell_1\) ball
Uses Software
This page was built for publication: Probing the Pareto Frontier for Basis Pursuit Solutions
