| 无约束最优化问题中梯度路径的一种简单求法 |
| |
| 引用本文： | 刘刚,秦体恒,彭玉成.无约束最优化问题中梯度路径的一种简单求法[J].信阳师范学院学报(自然科学版),1998,11(2):123-126. |
| |
| 作者姓名： | 刘刚 秦体恒 彭玉成 |
| |
| 作者单位： | 1. 河南机电高等专科学校,河南,新乡,453002
2. 信阳师范学院数学系,河南,信阳,464000 |
| |
| 摘 要： | 基于对称矩阵的Ｂｕｎｃｋ－Ｐａｒｌｅｔｔ分解，将信赖域子问题转换成一修造是的信赖域子问题。
|
| 关 键 词： | 信赖域方法 无约束优化 最佳化 梯度路径 |
A Simpler Method to Construct Gradient Path for Unconstrained Optimization |
| |
| Liu Gang,Qin Tiheng.A Simpler Method to Construct Gradient Path for Unconstrained Optimization[J].Journal of Xinyang Teachers College(Natural Science Edition),1998,11(2):123-126. |
| |
| Authors: | Liu Gang Qin Tiheng |
| |
| Abstract: | This essay bases on Bunch-parlett factorization and changs the subproblem of trust region into its equivalent subproblem,thus result in an easier method to construct the gradient paths. The Hessian Matrix does not need to be and the merits of trust region methods are remained.It is obvious that gradient path search methods to solve trust region problems arising from unconstrained optimization problems is more proctical. |
| |
| Keywords: | Trust region method Unconstrained optimization Gradient path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
