An interval programming algorithm for discrete linear \(L_ 1\) approximation problems

DOI10.1016/0021-9045(69)90001-XzbMath0211.52101MaRDI QIDQ2544339

P. D. Robers, Adi Ben-Israel

Publication date: 1969

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Interval and finite arithmetic (65G30) Algorithms for approximation of functions (65D15)

Related Items (10)

Explicit solutions for interval semidefinite linear programs ⋮ An iterative row-action method for interval convex programming ⋮ Minimization technique for a convex function with application to multiple regression model ⋮ Explicit solvability of dual pairs of infinite linear programs. ⋮ On the discrete linear L\(_1\) approximation and L\(_1\) solutions of overdetermined linear equations ⋮ A primal algorithm for interval linear-programming problems ⋮ Linear programming for weighted deviation problems using compact basis techniques ⋮ New algorithm for optimal parameter estimation with linear constraints ⋮ Approximation in normed linear spaces ⋮ On the use of the simplex algorithm for the absolute deviation curve fitting problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• A suboptimization method for interval linear programming: A new method for linear programming
• Linear Programming Techniques for Regression Analysis
• Methods—Old and New—for Solving the Tchebycheff Approximation Problem
• An Explicit Solution of a Special Class of Linear Programming Problems
• A Decomposition Method for Interval Linear Programming
• Applications of Linear Programming to Numerical Analysis
• Technical Note—Explicit Solutions of Interval Linear Programs
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation

This page was built for publication: An interval programming algorithm for discrete linear \(L_ 1\) approximation problems