Sparse solutions to an underdetermined system of linear equations via penalized Huber loss

DOI10.1007/S11081-020-09577-WzbMATH Open1484.65123OpenAlexW3096593449MaRDI QIDQ2129205FDOQ2129205

Authors Can Kızılkale, Mustafa Ç. Pınar 

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

zbMATH Keywords

strictly convex quadratic programminglinear programmingcompressed sensinglinear system of equations\(\ell_1\)-normsparse solutionquadratic perturbationbasis pursuitHuber loss functionconvex quadratic splines

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Applications of mathematical programming (90C90) Linear equations (linear algebraic aspects) (15A06)

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

Cites work

• A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation
• A fast conjugate gradient algorithm with active set prediction for ℓ₁ optimization
• A first-order augmented Lagrangian method for compressed sensing
• A first-order smoothed penalty method for compressed sensing
• A mathematical introduction to compressive sensing
• A preconditioned conjugate gradient method with active set strategy for \(\ell_1\)-regularized least squares
• Atomic Decomposition by Basis Pursuit
• Complementarity Theorems for Linear Programming
• Compressed sensing
• Decoding by Linear Programming
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Gradient-based method with active set strategy for \(\ell _1\) optimization
• Introductory lectures on convex optimization. A basic course.
• Making do with less: an introduction to compressed sensing
• Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
• New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
• Nomonotone spectral gradient method for sparse recovery
• Nonlinear Perturbation of Linear Programs
• On Sparse Representations in Arbitrary Redundant Bases
• On the characterization of quadratic splines
• Proximal Newton-type methods for minimizing composite functions
• Robust Statistics
• Smooth minimization of non-smooth functions
• Sparse Regularization via Convex Analysis
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
• The Linear l₁ Estimator and the Huber M-Estimator

Cited in

(3)

• Minimizers of sparsity regularized Huber loss function
• New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
• Modeling and optimization: theory and applications (MOPTA) 2019 -- selected works

Describes a project that uses

Uses Software

• PDCO
• FPC_AS

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)