A Base-Point Descent Algorithm For Solving The Linear l 1 Problem

DOI10.1080/0020716022000005519zbMath1032.65064OpenAlexW2103443931MaRDI QIDQ4709856

Shi-Jian Yan

Publication date: 8 March 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716022000005519

zbMATH Keywords

solution setperturbation techniquefinite step algorithmbase-point descent methodlinear \(l_1\) problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Best approximation, Chebyshev systems (41A50)

Related Items

Weighted Median of the Data in Solving Least Absolute Deviations Problems ⋮ Application of growth functions in the prediction of live weight of domestic animals ⋮ 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

Cites Work

• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
• On conditions for optimality of the nonlinearl 1 problem
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System

This page was built for publication: A Base-Point Descent Algorithm For Solving The Linear l 1 Problem