| 非线性规划的拟罚函数—强次可行方向法 |
| |
| 引用本文： | 简金宝. 非线性规划的拟罚函数—强次可行方向法[J]. 经济数学, 1996, 0(1) |
| |
| 作者姓名： | 简金宝 |
| |
| 作者单位： | 广西大学数学与信息科学系 |
| |
| 基金项目： | 广西自治区青年科学基金,广西教委科学基金 |
| |
| 摘 要： | 本文首先提出非线性规划的拟Ｋｕｈｎ—Ｔｕｃｋｅｒ点和拟罚函数法的概念和思想，然后结合强次可行方向法思想给出问题的两个新型算法，称之为拟罚函数—强次可行方向法．证明了该算法收敛到原问题的拟Ｋｕｈｎ—Ｔｕｃｋｅｒ点．
|
| 关 键 词： | 非线性规划，拟Kuhn—Tucker点，拟罚函数法，强次可行方向法，收敛性 |
Quasi-Penalty Function-Strongly Subfeasible Directions Methods for Nonlinear Programming |
| |
| Jian Jinbao. Quasi-Penalty Function-Strongly Subfeasible Directions Methods for Nonlinear Programming[J]. Mathematics in Economics, 1996, 0(1) |
| |
| Authors: | Jian Jinbao |
| |
| Abstract: | The new concept and idea of quasi-Kuhn-Tucker point and quasi-Penalty function method are put forward in this paper,then two new algorithms are presented by combining the idea of strongly subfeasible directions method,they are called quasi-Penalty functionstrongly sub feasible directions methods.TIt two algotithm are proved to converge to the primal problem's quasi-kuhn-Tucker point. |
| |
| Keywords: | Nonlinear programming quasi-Kuhn-Tucker point quasi-Penalty function method strongly sub feasible directions method convergence. |
| 本文献已被 CNKI 等数据库收录！ |
