凸可分规划的内椭球方法

凸可分规划的内椭球方法 AN INTERIOR ELLIPSOID METHOD FOR CONVEX SEPARABLE PROGRAMMING 张明望 Zhang Mingwang 1 first-author 武汉水利电力大学应用数学系 武汉水利电力大学应用数学系 Department of Applied Mathemathics, Wuhan University of Hydraulic and Electrical Engineering Department of Applied Mathemathics, Wuhan University of Hydraulic and Electrical Engineering 用内椭球方法的思想对线性约束的凸可分规划提出了一种新的算法，并证明了此算法是一个多项式时间算法． This paper presents a new interior point algroithm for convex separable programming which is based upon interior ellipsoid method. It is shown that the method is a polynomial time algorithm. 凸可分规划 内凸球算法 多项式算法 convex separable programming interior ellipsoid method polynomial time algorithm O221.1 1998-03-01 2021-04-01 3