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

DOI10.1080/0020716022000005519MaRDI QIDQ4709856zbMATH OpenOpenAlexFDO

Authors Shijian 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

base-point descent methodfinite step algorithmlinear \(l_1\) problemperturbation techniquesolution set

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for a nonlinear l₁ problem
• The l₁ Solution of Linear Equations Subject to Linear Constraints
• scientific article; zbMATH DE number 3848511
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• The _1 solution of linear inequalities

Cites work

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

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 ₁ 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)