.png){kind=icon}
返回
Generalized affine scaling algorithms for linear programming problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2019.104807.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Interior Point Methods are widely used to solve Linear Programming problems. In this work, we present two primal Affine Scaling algorithms to achieve faster convergence in solving Linear Programming problems. In the first algorithm, we integrate Nesterov's restarting strategy in the primal Affine Scaling method with an extra parameter, which in turn generalizes the original primal Affine Scaling method. We provide the proof of convergence for the proposed generalized algorithm considering long step size. We also provide the proof of convergence for the primal and dual sequence without the degeneracy assumption. This convergence result generalizes the original convergence result for the Affine Scaling methods and it gives us hints about the existence of a new family of methods. Then, we introduce a second algorithm to accelerate the convergence rate of the generalized algorithm by integrating a non-linear series transformation technique. Our numerical results show that the proposed algorithms outperform the original primal Affine Scaling method. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Interior point methods
Affine scaling
Nesterov acceleration
Dikin process
Shanks series transformation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
2.2W
机构
引用论文
Changes in Compositional Properties during Fruit Development and On‐Tree Ripening of Two Common Apricot (Prunus armeniaca L.) Cultivars两种常见杏(Prunus armeniaca L.)品种在果实发育和树上成熟期间的组分性质变化
PREAI
分享收藏Association of a Common Oxytocin Receptor Gene Polymorphism with Self-Reported ‘Empathic Concern’ in a Large Population of Healthy Volunteers.png)
PLOS ONEOAAI
PLOS ONEIF0
OAAI分享收藏
查看更多内容