首页> 外文会议>International Conference on Computational Science and Its Applications(ICCSA 2006) pt.3; 20060508-11; Glasgow(GB) >A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks
【24h】

A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks

机译:非线性网络上近似次梯度法的恒定步长规则的一种变体

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

摘要

The efficiency of the network flow techniques can be exploited in the solution of nonlinearly constrained network flow problems (NCNFP) by means of approximate subgradient methods (ASM). We propose to solve the dual problem by an ASM that uses a variant of the well-known constant step rule of Shor. In this work the kind of convergence of this method is analyzed and its efficiency is compared with that of other approximate subgradient methods over NCNFP.
机译:通过近似次梯度法(ASM),可以在非线性约束网络流量问题(NCNFP)的解决方案中利用网络流量技术的效率。我们建议通过ASM解决双重问题,该ASM使用众所周知的Shor恒定步长规则的变体。在这项工作中,分析了这种方法的收敛性,并将其效率与NCNFP上其他近似次梯度方法的效率进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号