Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method.
Joseph CzyzykRobert FourerSanjay MehrotraPublished in: SIAM J. Sci. Comput. (1998)
Keyphrases
- interior point methods
- linear program
- massively parallel
- preconditioned conjugate gradient method
- linear programming
- primal dual
- integer program
- coefficient matrix
- linear programming problems
- parallel computing
- simplex method
- optimal solution
- fine grained
- np hard
- interior point algorithm
- dynamic programming
- objective function
- column generation
- extreme points
- semidefinite programming
- convex optimization
- semidefinite
- mixed integer
- quadratic programming
- nonlinear programming
- parallel machines
- solving problems
- feasible solution
- image restoration
- image processing