Basing on the advantage of ACCPM alogrithms and the character of Semi-Infinite programming, a new ACCPM algorithm for convex Semi-Infinite programming is proposed in this paper. The convergence proof was also given at the end of the paper.%基于非线性规划和割平面方法,给出了凸半无限规划问题的一个分析中央割平面算法(ACCPM).该算法不需要在每一次迭代时计算所有的约束数值,而只需要求解一个中央割平面,从而使得问题的求解规模变小,这种算法对于求解可行域结构比较复杂的半无限规划非常有效,最后给出算法的收敛性证明.
展开▼
