首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类具约束选址模型的组合算法
引用本文:杨益民.一类具约束选址模型的组合算法[J].应用数学,2003,16(3):70-74.
作者姓名:杨益民
作者单位:南京财经大学统计系,江苏,南京,210003
摘    要:针对一般具闭凸集约束的单址选址模型,提出具全局收敛性的组合算法.算法在迭代中先采用信赖域技巧,当出现“内循环”时,则改用不做线搜索的梯度法.该算法既具有信赖域算法的优越性,又避免了出现“内循环”时速成的隐迭代.同时,该算法通常不需进行线搜索,较之其它组合算法更加简捷实用.

关 键 词:组合算法  闭凸集约束  全局收敛性  单址选址模型  信赖域  梯度法  “内循环”  隐迭代  Fermat场址问题  最优解
文章编号:1001-9847(2003)03-0074-05
修稿时间:2002年8月5日

Combining Algorithm for a Kind of Constrained Location Model
YANG Yi,min.Combining Algorithm for a Kind of Constrained Location Model[J].Mathematica Applicata,2003,16(3):70-74.
Authors:YANG Yi  min
Abstract:For very general single location on a closed convex domain,propose a combining algorithm which has global convergence.The aogorithm uses the TR technique first,but it takes the gradient method which doesn't use the linear search instead of resolving the subproblem when the trial step is not successful.The algorithm overcomes the drawback that the original gradient methods are ineffective when an iterative point is an extreme point,and may not usually make a linear search.The algorithm has good quality as TR algorithm,but it avoid the "inner cycle" which may arise in TR algorithm.
Keywords:Closed convex domain  Single location model  TR method  Combining algorithm  Global convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号