|
|||||
|
|
Simplified infeasible interior-point algorithm for linear optimization based on a simple function |
|
| Authors: | Weiwei Wang Hongwei Liu Hongmei Bi |
| Affiliation: | 1. School of Mathematics and Statistics, Xidian University, Xi’an, China;2. School of Science, Xi’an Technological University, Xi’an, China;3. School of Science, Air Force Engineering University, Xi’an, China |
| 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: | Linear optimization Infeasible interior-point algorithm Kernel function Exponential convexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |