Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
11005587 | Operations Research Letters | 2018 | 14 Pages |
Abstract
Based on a similar kernel function, we present an infeasible version of the interior-point algorithm for linear optimization introduced by Wang et al. (2016). The property of exponential convexity is still important to simplify the analysis of the algorithm. The iteration bound coincides with the currently best iteration bound for infeasible interior-point algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Weiwei Wang, Hongwei Liu, Hongmei Bi,