Minimizers of sparsity regularized Huber loss function

DOI10.1007/S10957-020-01745-3MaRDI QIDQ831370zbMATH OpenOpenAlexFDO

Authors Deniz Akkaya, Mustafa Ç. Pınar

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

regularizationglobal minimizerlocal minimizerHuber loss functionL0-normsparse solution of linear systems

Mathematics Subject Classification ID

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

Recommendations

• Description of the minimizers of least squares regularized with \(\ell_0\)-norm. Uniqueness of the global minimizer
• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• Stability of the minimizers of least squares with a non-convex regularization. I: Local behavior
• Sparse regularization with the ℓ0 norm
• Loss functions for finite sets

Cites work

• scientific article; zbMATH DE number 1821400 (Why is no real title available?)
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• A mathematical introduction to compressive sensing
• Atomic Decomposition by Basis Pursuit
• Compressed sensing
• Decoding by Linear Programming
• Description of the minimizers of least squares regularized with \(\ell_0\)-norm. Uniqueness of the global minimizer
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Iterative thresholding for sparse approximations
• Just relax: convex programming methods for identifying sparse signals in noise
• Linear Huber M-estimator under ellipsoidal data uncertainty
• Making do with less: an introduction to compressed sensing
• New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
• New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
• On Sparse Representations in Arbitrary Redundant Bases
• Proximal mapping for symmetric penalty and sparsity
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• Regression analysis: likelihood, error and entropy
• Robust Statistics
• Robust statistics for signal processing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• 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
• Testing the nullspace property using semidefinite programming
• The Linear l₁ Estimator and the Huber M-Estimator

Cited in

(2)

• Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
• Loss functions for finite sets

Describes a project that uses

Uses Software

• PDCO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831370)