| 广义几何规划的压缩共轭梯度路径非单调信赖域算法(英文) |
| |
| 引用本文： | 党亚峥,景书杰,李煜.广义几何规划的压缩共轭梯度路径非单调信赖域算法(英文)[J].数学季刊,2011(2):285-289. |
| |
| 作者姓名： | 党亚峥 景书杰 李煜 |
| |
| 作者单位： | School of Management;University of Shanghai for Science and Technology;College of Mathematics and Information Science;Henan Polytechnic University; |
| |
| 基金项目： | Supported by the National Science Foundation of China(10671126); Supported by the Shanghai Municipal Government Project(S30501); Supported by the Innovation Fund Project for Graduate Student of Shanghai(JWCXSL1001); Supported by the Youth Foundation of Henan Polytechnic University(Q20093); Supported by the Applied Mathematics Provinciallevel Key Discipline of Henan Province; Supported by Operational Research and Control Theory Key Discipline of Henan Polytechnic University |
| |
| 摘 要： | In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming（GGP）,we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and quadratic convergence properties.
|
| 关 键 词： | generalized geometric programming condensation conjugate path trust region |
Nonmonotonic Trust Region Algorithm via the Conjugate Gradient Path for Unconstrained Generalized Geometric Programming |
| |
| DANG Ya-zheng,JING Shu-jie,LI Yu.Nonmonotonic Trust Region Algorithm via the Conjugate Gradient Path for Unconstrained Generalized Geometric Programming[J].Chinese Quarterly Journal of Mathematics,2011(2):285-289. |
| |
| Authors: | DANG Ya-zheng JING Shu-jie LI Yu |
| |
| Institution: | DANG Ya-zheng1,2,JING Shu-jie2,LI Yu1(1.School of Management,University of Shanghai for Science and Technology,Shanghai 200093,China,2.College of Mathematics and Information Science,Henan Polytechnic University,Jiaozuo 454000,China) |
| |
| Abstract: | In this paper,on the basis of making full use of the characteristics of unconstrained generalized geometric programming(GGP),we establish a nonmonotonic trust region algorithm via the conjugate path for solving unconstrained GGP problem.A new type of condensation problem is presented,then a particular conjugate path is constructed for the problem,along which we get the approximate solution of the problem by nonmonotonic trust region algorithm,and further prove that the algorithm has global convergence and q... |
| |
| Keywords: | generalized geometric programming condensation conjugate path trust region |
| 本文献已被 CNKI 维普 等数据库收录！ |
