摘要
考虑凸二次规划问题,给出了一个新的算法。
A new algorithm for convex quadratic programming, which is an interiorpoint method based on the predictor-corrector procedure is given. It is shown that this algo-rithm requries O()iterations,and the total complexity is O(n ̄(3,5)L).
出处
《曲阜师范大学学报(自然科学版)》
CAS
1995年第2期1-6,共6页
Journal of Qufu Normal University(Natural Science)
关键词
凸二次规划
P-C算法
线性规划
内点算法
Convex quadratic programming predictor-corrector algorithm interiorpoint algorithm primal-dual complexity