Fast and efficient linear programming and linear least-squares computations

DOI10.1016/0898-1221(86)90006-4MaRDI QIDQ3028716zbMATH OpenOpenAlexFDO

Authors Victor Y. Pan, J. Reif

Publication date 1986

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(86)90006-4

zbMATH Keywords

parallel algorithmlinear least-squares problemblow-up transformation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 3967813
• Efficient parallel linear programming
• Faster least squares approximation
• A geometric property of the least squares solution of linear equations
• scientific article; zbMATH DE number 37926

Cites work

• scientific article; zbMATH DE number 3852305 (Why is no real title available?)
• scientific article; zbMATH DE number 4215266 (Why is no real title available?)
• scientific article; zbMATH DE number 3965444 (Why is no real title available?)
• scientific article; zbMATH DE number 4011931 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• A new polynomial-time algorithm for linear programming
• Dioïds and semirings: Links to fuzzy sets and other applications
• Fast finite methods for a system of linear inequalities
• Generalized Nested Dissection
• How to multiply matrices faster
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• On the asymptotic complexity of rectangular matrix multiplication
• On the complexity of a pivot step of the revised simplex algorithm

Cited in

(9)

• scientific article; zbMATH DE number 3967813 (Why is no real title available?)
• scientific article; zbMATH DE number 5066284 (Why is no real title available?)
• Fast and efficient solution of path algebra problems
• Fast and efficient parallel solution of dense linear systems
• Fast least squares approximation using tensor products of functions and linear forms
• Efficient parallel linear programming
• Solving Linear Programs in the Current Matrix Multiplication Time
• On the complexity of a pivot step of the revised simplex algorithm
• scientific article; zbMATH DE number 6378086 (Why is no real title available?)

This page was built for publication: Fast and efficient linear programming and linear least-squares computations

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