位置:成果数据库 > 期刊 > 期刊详情页
Nonmonotonic Trust Region Algorithm via the Conjugate Gradient Path for Unconstrained Generalized Geometric Programming
  • ISSN号:1002-0462
  • 期刊名称:《数学季刊:英文版》
  • 时间:0
  • 分类:O221.15[理学—运筹学与控制论;理学—数学]
  • 作者机构:[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
  • 相关基金: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
中文摘要:

在这份报纸,根据充分利用非强迫的概括几何编程(GGP ) 的特征,我们为解决非强迫的 GGP 问题经由 conjugate 路径建立一个非单调的信任区域算法。冷凝作用问题的一种新类型被介绍,然后详细规格结合路径为这个问题,我们由非单调的信任区域算法沿着得到这个问题的近似答案被构造,并且进一步证明算法有全球集中和二次的集中性质。

英文摘要:

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.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《数学季刊:英文版》
  • 北大核心期刊(2004版)
  • 主管单位:
  • 主办单位:河南大学
  • 主编:胡和生 林群
  • 地址:河南省开封市明伦街85号河南大学
  • 邮编:475001
  • 邮箱:
  • 电话:0378-3881698
  • 国际标准刊号:ISSN:1002-0462
  • 国内统一刊号:ISSN:41-1102/O1
  • 邮发代号:36-170
  • 获奖情况:
  • 1998年河南省优秀科技期刊二等奖. 2000年河南省优...
  • 国内外数据库收录:
  • 美国数学评论(网络版),德国数学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版)
  • 被引量:468