• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Distributed Computation for Linear Programming Problems Satisfying a CertainDiagonal Dominance Condition
【24h】

Distributed Computation for Linear Programming Problems Satisfying a CertainDiagonal Dominance Condition

机译：满足一定对角优势条件的线性规划问题的分布式计算

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A block-coordinate ascent method for a class of linear programming problems whoseconstraints satisfy a certain diagonal dominance condition is proposed. This method partitions the original linear program into subprograms where each subprogram corresponds uniquely to a subset of the decision variables of the problem. At each iteration, one of the subprograms is solved by adjusting its corresponding variables, while the other variables are held constant. The algorithmic mapping underlying this method is shown to be monotone and contractive. Using the contractive property, the method is shown to converge even when implemented in an asynchronous, distributed manner, and that its rate of convergence can be estimated from the synchronization parameter. Keywords: Reprints. (KR)

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号