The $l_1 $ Solution of Linear Equations Subject to Linear Constraints

DOI10.1137/0910021zbMath0667.65049OpenAlexW2056550768MaRDI QIDQ3819910

Achiya Dax

Publication date: 1989

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0910021

zbMATH Keywords

Numerical experimentsdegeneracylinear constraintssteepest descent methodactive set method\(l_ 1\)-solution of linear equationsbounded least squaresconstrained discrete \(\ell _ 1\)-approximationfeasible direction of steepest descent can be computed by solving the same least-squares subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Algorithms for approximation of functions (65D15)

Related Items (6)

Theorems of the alternative and duality ⋮ A new theorem of the alternative ⋮ A row relaxation method for large \(l_ 1\) problems ⋮ Loss and retention of accuracy in affine scaling methods ⋮ The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review ⋮ On degeneracy in linear programming and related problems

This page was built for publication: The $l_1 $ Solution of Linear Equations Subject to Linear Constraints