New characterizations of _ 1 solutions to overdetermined systems of linear equations
From MaRDI portal
Publication:1342287
Recommendations
- Strict Discrete Approximation in the L 1 and L ∞ Norms
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- Huber approximation for the non-linear \(l_{1}\) problem
Cites work
- A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
- Complementarity Theorems for Linear Programming
- Finite algorithms for robust linear regression
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- Robust Statistics
- The Mathematical Structure of Huber’s M-Estimator
Cited in
(11)- Duality in robust linear regression using Huber's M-estimator
- 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.
- Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines
- scientific article; zbMATH DE number 37926 (Why is no real title available?)
- A characterization of the optimal set of linear programs based on the augmented lagrangian
- Letters to the Editor
- Minimizers of sparsity regularized Huber loss function
This page was built for publication: New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342287)