primal-dual interior point algorithm 原对偶内点法
Karmarkar interior point algorithm Karmarkar内点算法
infeasible interior-point algorithm 不可行内点算法
nonlinear primal-dual interior point algorithm 非线性原对偶内点算法
an interior-point algorithm 内点算法
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.
最后还对原-对偶内点算法中的计算瓶颈做出了分析，给出了相应的优化解决方案，并展望了该算法的应用前景。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
应用推荐