Fast and efficient linear programming and linear least-squares computations

DOI10.1016/0898-1221(86)90006-4zbMath0625.90053OpenAlexW2075488866MaRDI QIDQ3028716

Pan, Victor Y., John H. 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

linear least-squares problemparallel algorithmblow-up transformation

Mathematics Subject Classification ID

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

Related Items

Efficient parallel linear programming, Fast and efficient solution of path algebra problems, Fast and efficient parallel solution of dense linear systems, On the complexity of a pivot step of the revised simplex algorithm

Cites Work

• A new polynomial-time algorithm for linear programming
• How to multiply matrices faster
• On the complexity of a pivot step of the revised simplex algorithm
• On the asymptotic complexity of rectangular matrix multiplication
• Fast finite methods for a system of linear inequalities
• Dioïds and semirings: Links to fuzzy sets and other applications
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item