A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
From MaRDI portal
The author firstly discusses the structure of the solution set of the linear \(l_1\) problem. Based on the optimal condition of the linear \(l_1\) problem, an effective algorithm -- the base-point descent method, which is a finite step algorithm -- is presented. Furthemore, it is also discussed how to deal with the degenerate linear \(l_1\) problem, and an algorithm by using a perturbation technique is given.
Recommendations
Cites work
Cited in
(7)- A simple solution to the ^ 1 optimization problem
- Application of growth functions in the prediction of live weight of domestic animals
- Weighted Median of the Data in Solving Least Absolute Deviations Problems
- The l₁ Solution of Linear Equations Subject to Linear Constraints
- A remark on Bartels and Conn's linearly constrained, discrete l 1 problems
- An algorithm for a nonlinear l₁ problem
- Searching for a best least absolute deviations solution of an overdetermined system of linear equations motivated by searching for a best least absolute deviations hyperplane on the basis of given data
This page was built for publication: A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709856)