Minimizers of sparsity regularized Huber loss function
DOI10.1007/S10957-020-01745-3zbMATH Open1466.62366OpenAlexW3087278047MaRDI QIDQ831370FDOQ831370
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
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
regularizationglobal minimizerlocal minimizerHuber loss functionL0-normsparse solution of linear systems
Linear regression; mixed models (62J05) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Robust statistics for signal processing
- Atomic Decomposition by Basis Pursuit
- Robust Statistics
- Decoding by Linear Programming
- Just relax: convex programming methods for identifying sparse signals in noise
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and redundant representations. From theory to applications in signal and image processing.
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- A mathematical introduction to compressive sensing
- On Sparse Representations in Arbitrary Redundant Bases
- Title not available (Why is that?)
- Iterative thresholding for sparse approximations
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Description of the minimizers of least squares regularized with \(\ell_0\)-norm. Uniqueness of the global minimizer
- Sparse Regularization via Convex Analysis
- Testing the nullspace property using semidefinite programming
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- Linear Huber M-estimator under ellipsoidal data uncertainty
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Regression analysis: likelihood, error and entropy
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem
- Making do with less: an introduction to compressed sensing
- The Linear l1 Estimator and the Huber M-Estimator
- Proximal mapping for symmetric penalty and sparsity
- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
Cited In (2)
Uses Software
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)
