首页> 外文期刊>Journal of Global Optimization >Behavior of DCA sequences for solving the trust-region subproblem
【24h】

Behavior of DCA sequences for solving the trust-region subproblem

机译:DCA序列用于解决信任区域子问题的行为

获取原文
获取原文并翻译 | 示例
       

摘要

From our results it follows that any DCA sequence for solving the trust-region subproblem (see Pham Dinh and Le Thi, in SIAM J Optim 8:476-505, 1998) is convergent provided that the basic matrix of the problem is nonsingular and it does not have multiple negative eigenvalues. Besides, under this additional assumption, there exists such an open set Ω containing the global minimizers and the unique local-nonglobal minimizer (if such exists) that any DCA sequence with the initial point from Ω is contained in the set and converges to a global minimizer or the local-nonglobal minimizer. Various examples are given to illustrate the limiting behavior and stability of the DCA sequences. Structure of the KKT point set of the trust-region subproblem is also analyzed.
机译:从我们的结果可以得出,只要问题的基本矩阵是非奇异的,那么任何用于求解信任区域子问题的DCA序列(请参见Pham Dinh和Le Thi,在SIAM J Optim 8:476-505,1998中)都是收敛的。没有多个负特征值。此外,在此附加假设下,存在一个包含全局最小化子和唯一局部-非全局最小化子(如果存在)的开放集Ω,以至于集合中包含任何以Ω为初始点的DCA序列,并收敛到全局最小化器或局部非全局最小化器。给出了各种示例来说明DCA序列的限制行为和稳定性。还分析了信任区域子问题的KKT点集的结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号