首页> 外文期刊>Mathematical Programming >Dual versus primal-dual interior-point methods for linear and conic programming
【24h】

Dual versus primal-dual interior-point methods for linear and conic programming

机译:线性和圆锥编程的对偶与原始对偶内点方法

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

摘要

We observe a curious property of dual versus primal-dual path-following interior-point methods when applied to unbounded linear or conic programming problems in dual form. While primal-dual methods can be viewed as implicitly following a central path to detect primal infeasibility and dual unboundedness, dual methods can sometimes implicitly move away from the analytic center of the set of infeasibility/unboundedness detectors.
机译:当我们以对偶形式应用于无界线性或圆锥编程问题时,我们观察到对偶与原始对偶路径遵循内点方法的奇异特性。虽然原始对偶方法可以视为隐式遵循检测原始不可行性和双重无界性的中心路径,但是双重方法有时可以隐式地移离不可行/无边界检测器集的分析中心。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号