Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
DOI10.1007/S11081-020-09577-WzbMATH Open1484.65123OpenAlexW3096593449MaRDI QIDQ2129205FDOQ2129205
Mustafa Ç. Pınar, Can Kızılkale
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
Recommendations
- Sparse solutions of underdetermined linear systems
- On sparse solutions of underdetermined linear systems
- Sparse Solutions of Underdetermined Linear Systems and Their Applications
- Exact and approximate sparse solutions of underdetermined linear equations
- Sparse Approximation via Penalty Decomposition Methods
- Solution of Sparse Underdetermined Systems of Linear Equations
- On the Error of Estimating the Sparsest Solution of Underdetermined Linear Systems
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Minimizers of sparsity regularized Huber loss function
strictly convex quadratic programminglinear programmingcompressed sensinglinear system of equations\(\ell_1\)-normsparse solutionquadratic perturbationbasis pursuitHuber loss functionconvex quadratic splines
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Applications of mathematical programming (90C90) Linear equations (linear algebraic aspects) (15A06)
Cites Work
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- Atomic Decomposition by Basis Pursuit
- Robust Statistics
- Smooth minimization of non-smooth functions
- Introductory lectures on convex optimization. A basic course.
- Decoding by Linear Programming
- Sparse and Redundant Representations
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- Nomonotone spectral gradient method for sparse recovery
- A First-Order Smoothed Penalty Method for Compressed Sensing
- A mathematical introduction to compressive sensing
- On Sparse Representations in Arbitrary Redundant Bases
- Sparse Regularization via Convex Analysis
- A first-order augmented Lagrangian method for compressed sensing
- Nonlinear Perturbation of Linear Programs
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- Gradient-based method with active set strategy for $\ell _1$ optimization
- Complementarity Theorems for Linear Programming
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- On the characterization of quadratic splines
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Making do with less: an introduction to compressed sensing
- The Linear l1 Estimator and the Huber M-Estimator
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization
Cited In (2)
Uses Software
This page was built for publication: Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129205)
