.png){kind=icon}
返回
Primal-dual target-following algorithms for linear programming
.png){kind=icon}
PRE
AI
DOI：10.1007/BF02206817.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a method for linear programming with the property that, starting from an initial non-central point, it generates iterates that simultaneously get closer to optimality and closer to centrality. The iterates follow paths that in the limit are tangential to the central path. Together with the convergence analysis, we provide a general framework which enables us to analyze various primal-dual algorithms in the literature in a short and uniform way.
Keyword:
interior-point method
primal-dual method
target-following
centering
Dikin steps
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
暂无机构信息
引用论文
Current Concepts on the Clinical and Economic Impact of Periprosthetic Joint Infections围手术期关节感染的当前临床和经济影响概念
PREAI
分享收藏分享收藏Results of the regional key comparison EUROMET.M.P-K1.a in the pressure range from 0.1 Pa to 1000 Pa.png)
Metrologia
MetrologiaIF0
PREAI
分享收藏Mechanical Properties of Fibre Reinforced Polymers under Elevated Temperatures: An OverviewPolymers
OAAI
PolymersIF0
OAAI分享收藏
查看更多内容