An interval programming algorithm for discrete linear L_ 1 approximation problems

DOI10.1016/0021-9045(69)90001-XMaRDI QIDQ2544339zbMATH OpenFDO

Authors P. D. Robers, Adi Ben-Israel

Publication date 1969

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

Full work available at URL https://doi.org/10.1016/0021-9045(69)90001-X

Mathematics Subject Classification ID

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

Cites work

• A Decomposition Method for Interval Linear Programming
• A suboptimization method for interval linear programming: A new method for linear programming
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• An Explicit Solution of a Special Class of Linear Programming Problems
• An Improved Algorithm for Discrete l₁ Linear Approximation
• Applications of Linear Programming to Numerical Analysis
• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3209723 (Why is no real title available?)
• scientific article; zbMATH DE number 3298477 (Why is no real title available?)
• Linear Programming Techniques for Regression Analysis
• Methods—Old and New—for Solving the Tchebycheff Approximation Problem
• Note on Jordan elimination, linear programming and Tchebyscheff approximation
• Technical Note—Explicit Solutions of Interval Linear Programs

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544339)