提出了一种解线性不等式约束凸规划问题的势下降算法,并在一定的假设条件下,证明了该算法的收敛性,最后通过数值实验验证了该算法的有效性.
In this paper, a potential reduction interior-point algorithm for the linear convex programming problem with inequality constraints is presented and the convergence of the algorithm is proved under some assumptions. Experiments with real data verify the effectiveness of the algorithm.