The \(\ell_1\) solution of linear inequalities

DOI10.1016/j.csda.2004.07.007zbMath1429.65122OpenAlexW1480920844MaRDI QIDQ959132

Achiya Dax

Publication date: 11 December 2008

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2004.07.007

zbMATH Keywords

dualitylinear inequalitiesleast absolute deviationsaffine scalinginconsistent systemsa new theorem of the alternative

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (4)

2nd special issue on matrix computations and statistics ⋮ The distance between two convex sets ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ Nonparametric and robust methods. (Editorial)

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A simultaneous projections method for linear inequalities
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• A computational solution of the inverse problem in radiation-therapy treatment planning
• New methods for linear inequalities
• Global convergence of the affine scaling methods for degenerate linear programming problems
• On the convergence of the affine-scaling algorithm
• The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
• A simplified global convergence proof of the affine scaling algorithm
• Theorems of the alternative and duality
• Affine-scaling for linear programs with free variables
• An implementation of Karmarkar's algorithm for linear programming
• The smallest correction of an inconsistent system of linear inequalities
• Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
• Superlinear convergence of the affine scaling algorithm
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Loss and retention of accuracy in affine scaling methods
• A variation on Karmarkar’s algorithm for solving linear programming problems
• The Affine Scaling Algorithm Fails for Stepsize 0.999
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Computer-Intensive Methods in Statistical Regression
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
• A relaxation method for reconstructing objects from noisy X-rays
• Numerical Optimization
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
• Computing projections via Householder transformations and Gram–Schmidt orthogonalizations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(\ell_1\) solution of linear inequalities