Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
From MaRDI portal
Publication:2129205
DOI10.1007/s11081-020-09577-wzbMath1484.65123OpenAlexW3096593449MaRDI QIDQ2129205
Can Kızılkale, Mustafa Çelebi Pinar
Publication date: 22 April 2022
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/75913
linear programmingcompressed sensinglinear system of equations\(\ell_1\)-normsparse solutionquadratic perturbationbasis pursuitHuber loss functionstrictly convex quadratic programmingconvex quadratic splines
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Quadratic programming (90C20) Linear equations (linear algebraic aspects) (15A06)
Related Items
Uses Software
Cites Work
- Smooth minimization of non-smooth functions
- Nomonotone spectral gradient method for sparse recovery
- A mathematical introduction to compressive sensing
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Introductory lectures on convex optimization. A basic course.
- On the characterization of quadratic splines
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- Making Do with Less: An Introduction to Compressed Sensing
- A First-Order Augmented Lagrangian Method for Compressed Sensing
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- A First-Order Smoothed Penalty Method for Compressed Sensing
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- On Sparse Representations in Arbitrary Redundant Bases
- Decoding by Linear Programming
- Sparse and Redundant Representations
- Nonlinear Perturbation of Linear Programs
- Atomic Decomposition by Basis Pursuit
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- The Linear l1 Estimator and the Huber M-Estimator
- Gradient-based method with active set strategy for $\ell _1$ optimization
- Sparse Regularization via Convex Analysis
- A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Complementarity Theorems for Linear Programming
- Robust Statistics
- Compressed sensing
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
