摘要
本文根据[3][4]中求解线性规划鞍点法的思想,将所谓“鞍面法”的迭代公式进行简化,并指出修正后的算法实际上是一个总体线性收敛的鞍点法。
In this paper,according to the idea about saddle point algorithm for linear programming in [3] [4], we simplied the iterative formula of the so called'saddle surface algorithm'and pointed out,that the modified algorithm in practice is a globally linearly convergent saddle point algorithm.
出处
《辽宁大学学报(自然科学版)》
CAS
1990年第3期53-61,共9页
Journal of Liaoning University:Natural Sciences Edition
关键词
鞍面法
鞍点法
线性收敛
“Saddle Surface algorithm”
Saddle point algorithm
Linear convergence