Journal of Applied Sciences ›› 2004, Vol. 22 ›› Issue (4): 549-552.

• Articles • Previous Articles     Next Articles

A Parallel Primal-Dual Interior Point Algorithm Based on the QR Decomposition

CHEN Zheng-hong, YU Song-nian   

  1. School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China
  • Received:2003-07-10 Revised:2003-09-15 Online:2004-12-31 Published:2004-12-31

Abstract: This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized. Next the theory of the QR decomposition is also detailed. It also points out how to use the QR decomposition to solve the linear simultaneous equations parallelly. In conclusion, it proposes a parallel primal-dual interior point algorithm based on the QR decomposition and lists some test results.

Key words: parallelism, primal-dual interior point algorithm

CLC Number: