摘要
本文根据作者所提出的鞍点逼近算法,提出两种新型算法,统称 JK 鞍点算法.这两种算法有如下重要意义:①将计算鞍点问题转化为求二次极值问题;②用新方法计算鞍点可以在有限步达到最优解;③用新方法求解线性规划问题具有多项式算法性质;④引出差梯度的新概念.
In this paper,two new algorithms are presented according to the saddle point approximate algorithm from the reference [1],[2],[3].Their import- ant signfiance is as follows. ①Transfer new algoxithms finding saddle point into solving quadratic extremum ②The optimal solution can be found in limited iterative steps; ③Linear progrmming problem sloved by the new algorithms has polynom- ial algorithm characteristic; ④The difference gradient concept is presented
出处
《沈阳化工学院学报》
1990年第1期34-40,共7页
Journal of Shenyang Institute of Chemical Technolgy
关键词
线性规划
鞍点法
梯度法
gradient method
conjugate gradient method
saddle point method
linear programming
nonlinear programming
