A Finite Smoothing Algorithm for Linear l₁ Estimation
From MaRDI portal
Recommendations
Cited in
(44)- On orthogonal linear \(\ell_1\) approximation
- A simple solution to the ^ 1 optimization problem
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- On Newton's method for Huber's robust M-estimation problems in linear regression
- New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
- Piecewise-linear pathways to the optimal solution set in linear programming
- A penalty continuation method for the _ solution of overdetermined linear systems
- Approximation in normed linear spaces
- An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
- On the characterization of quadratic splines
- Implementing a parallel constrained \(l_ 1\) approximation algorithm
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Smoothing methods for convex inequalities and linear complementarity problems
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Image restoration from noisy incomplete frequency data by alternative iteration scheme
- Quantile regression neural networks: a Bayesian approach
- Fully smoothed _1-TV models: bounds for the minimizers and parameter choice
- Modelling and estimation of nonlinear quantile regression with clustered data
- Huber approximation for the non-linear \(l_{1}\) problem
- Finite algorithms for robust linear regression
- Smoothed penalty algorithms for optimization of nonlinear models
- Gauss-Seidal algorithm to L₁ minimization
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- A Globally Convergent Method for l_p Problems
- An on-line adaptation for discrete<tex>l_{1}</tex>linear estimation
- Censored Discrete Linear l₁ Approximation
- Piecewise Polynomial Solutions Without a priori Break Points
- l1 solution of linear inequalities
- scientific article; zbMATH DE number 1349149 (Why is no real title available?)
- scientific article; zbMATH DE number 1124620 (Why is no real title available?)
- Least absolute value regression: recent contributions
- A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
- Quantile regression via iterative least squares computations
- A finite hyperplane traversal algorithm for 1-dimensional \(L^1pTV\) minimization, for \(0<p\leq 1\)
- Bayesian quantile regression for ordinal models
- Linear programming and \(\ell _ 1\) regression: A geometric interpretation
- The best least absolute deviations line -- properties and two efficient methods for its derivation
- Bayesian quantile regression for longitudinal count data
- Numerical algorithms for nonlinear \(L_p\)-norm problem and its extreme case
- Huberization image restoration model from incomplete multiplicative noisy data
- Shrinkage estimation of varying covariate effects based on quantile regression
- An iterative algorithm for \(l_1\)-norm approximation in dynamic estimation problems
- Minimizers of sparsity regularized Huber loss function
- Multiple criteria linear regression
This page was built for publication: A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287100)
