A Finite Smoothing Algorithm for Linear $l_1 $ Estimation

From MaRDI portal
Revision as of 21:11, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5287100

DOI10.1137/0803010zbMath0781.65115OpenAlexW2048245744MaRDI QIDQ5287100

Kaj Madsen, Hans Bruun Nielsen

Publication date: 11 August 1993

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0803010




Related Items (26)

Bayesian quantile regression for longitudinal count dataSparse solutions to an underdetermined system of linear equations via penalized Huber lossMinimizers of sparsity regularized Huber loss functionNew characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equationsPiecewise-linear pathways to the optimal solution set in linear programmingSmoothed penalty algorithms for optimization of nonlinear modelsMultiple criteria linear regressionSmoothing methods for convex inequalities and linear complementarity problemsA penalty continuation method for the \(\ell_\infty\) solution of overdetermined linear systemsModelling and estimation of nonlinear quantile regression with clustered dataImage restoration from noisy incomplete frequency data by alternative iteration schemeHuberization image restoration model from incomplete multiplicative noisy dataQuantile regression neural networks: a Bayesian approachBayesian quantile regression for ordinal modelsPiecewise Polynomial Solutions Without a priori Break PointsQuantile regression via iterative least squares computationsLeast absolute value regression: recent contributionsOn the characterization of quadratic splinesShrinkage estimation of varying covariate effects based on quantile regressionA class of smoothing functions for nonlinear and mixed complementarity problemsOn Newton's method for Huber's robust M-estimation problems in linear regressionNecessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic SplinesTHE BEST LEAST ABSOLUTE DEVIATIONS LINE – PROPERTIES AND TWO EFFICIENT METHODS FOR ITS DERIVATIONApproximation in normed linear spacesHuber approximation for the non-linear \(l_{1}\) problemAn \(L_{1}\) estimation algorithm with degeneracy and linear constraints.







This page was built for publication: A Finite Smoothing Algorithm for Linear $l_1 $ Estimation