2015-06-21

An $O (n L)$ Infeasible-Interior-Point Algorithm for Linear Programming

Yaguang YangMakoto Yamashita

文献摘要

In this paper, we propose an arc-search infeasible-interior-point algorithm. We show that this algorithm is polynomial and the polynomial bound is ${\cal O}(nL)$ which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.

生成讲解博客的中文版本

生成AI智能校验的中文版本

加载中…

2015-06-21

Yaguang YangMakoto Yamashita

In this paper, we propose an arc-search infeasible-interior-point algorithm. We show that this algorithm is polynomial and the polynomial bound is ${\cal O}(nL)$ which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.

生成讲解博客的中文版本

生成AI智能校验的中文版本