Computational experience with an algorithm for discrete L_ 1 approximation
From MaRDI portal
Computational experience with an algorithm for discrete \(L 1\) approximation
Recommendations
Cites work
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- $L_p $-Criteria for the Estimation of Location Parameters
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Computational experiences with discrete L\(_p\)-approximation
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
- On the convergence of an algorithm for discrete \(L_p\) approximation
Cited in
(8)- Implementing a parallel constrained \(l_ 1\) approximation algorithm
- scientific article; zbMATH DE number 3880457 (Why is no real title available?)
- An Improved Algorithm for Discrete $l_1 $ Linear Approximation
- Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes
- Nonlinear eigenvector algorithms for local optimization in multivariate data analysis
- scientific article; zbMATH DE number 4141380 (Why is no real title available?)
- On computing a best discrete \(L_ 1\) approximation using the method of vanishing Jacobians
- scientific article; zbMATH DE number 4050841 (Why is no real title available?)
This page was built for publication: Computational experience with an algorithm for discrete \(L_ 1\) approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1151717)
