| 解约束优化问题的一个新方法 |
| |
| 引用本文： | 陶培华,韦增欣.解约束优化问题的一个新方法[J].曲阜师范大学学报,1991,17(4):55-59. |
| |
| 作者姓名： | 陶培华 韦增欣 |
| |
| 作者单位： | 广西大学，广西大学 |
| |
| 摘 要： | 本文用 Lagrange 函数作为下降函数,给出了求解一般约束优化问题的一个SQP 方法,在一定的假设条件下证明了该方法具有全局收敛性和局部超线性收敛性.
|
| 关 键 词： | 非线性规划 全局收敛 超线性收敛 |
A New Method of Solving the Optimized Problem with Constraints |
| |
| Tao Peihua Wei Zeng Xin.A New Method of Solving the Optimized Problem with Constraints[J].Journal of Qufu Normal University(Natural Science),1991,17(4):55-59. |
| |
| Authors: | Tao Peihua Wei Zeng Xin |
| |
| Institution: | Guangxi Normal University |
| |
| Abstract: | In this paper,we give a SQP algorithm to solve the optimized problemwith equality and inequality constraints and use Lagrange function to theline-search in the every iterative steps.Under some assumptions of this paper,we prove that the algorithm hasthe property of the global convergence and rocally superlinear convergencerate. |
| |
| Keywords: | nonlinear programming superlinear covergence |
| 本文献已被 CNKI 维普 等数据库收录！ |
