A parallel formulation of interior point algorithms
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Hi-index | 0.00 |
The augmented Lagrangian and Generalized Newton methods are used to simultaneously solve the primal and dual linear programming (LP) problems. We propose parallel implementation of the method to solve the primal linear programming problem with very large number (≈ 2 ·106) of nonnegative variables and a large (≈ 2 ·105) number of equality type constraints.