Fast finite methods for a system of linear inequalities

DOI10.1016/0898-1221(85)90060-4zbMath0614.65066MaRDI QIDQ1819897

Pan, Victor Y.

Publication date: 1985

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

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

zbMATH Keywords

convergence; simplex; Newton; Karmarkar

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C20: Quadratic programming

90C05: Linear programming

Related Items

On the complexity of a pivot step of the revised simplex algorithm, Efficient parallel linear programming, Fast and efficient linear programming and linear least-squares computations

Cites Work

• How to multiply matrices faster
• Worst case behavior of the steepest edge simplex method
• Projection methods in constrained optimisation and applications to optimal policy decisions
• The simplex algorithm with the pivot rule of maximizing criterion improvement
• On the average number of steps of the simplex method of linear programming
• Khachiyan’s algorithm for linear programming
• Feature Article—The Ellipsoid Method: A Survey
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
• A bad network problem for the simplex method and other minimum cost flow algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item