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.











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)