Minimizers of sparsity regularized Huber loss function

DOI10.1007/s10957-020-01745-3zbMath1466.62366OpenAlexW3087278047MaRDI QIDQ831370

Deniz Akkaya, Mustafa Çelebi Pinar

Publication date: 11 May 2021

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/75483

zbMATH Keywords

regularizationlocal minimizerglobal minimizerHuber loss functionL0-normsparse solution of linear systems

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Uses Software

• PDCO

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• Testing the nullspace property using semidefinite programming
• Iterative thresholding for sparse approximations
• New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
• Regression analysis: likelihood, error and entropy
• Linear Huber M-estimator under ellipsoidal data uncertainty
• New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
• Making Do with Less: An Introduction to Compressed Sensing
• Description of the Minimizers of Least Squares Regularized with $\ell_0$-norm. Uniqueness of the Global Minimizer
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• Just relax: convex programming methods for identifying sparse signals in noise
• Sparse and Redundant Representations
• Atomic Decomposition by Basis Pursuit
• The Linear l₁ Estimator and the Huber M-Estimator
• Proximal Mapping for Symmetric Penalty and Sparsity
• Sparse Regularization via Convex Analysis
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• Robust Statistics for Signal Processing
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Robust Statistics
• Compressed sensing
• Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing

This page was built for publication: Minimizers of sparsity regularized Huber loss function