首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。
Finally, according to the bottleneck of Primal-Dual Interior-Point Algorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.
应用推荐