```
Liu Zhongyi, Sun, Wenyu, and Tian Fangbao.
```*A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function*. United States: N. p., 2009.
Web. doi:10.1007/S00245-009-9069-X.

```
Liu Zhongyi, Sun, Wenyu, & Tian Fangbao.
```*A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function*. United States. doi:10.1007/S00245-009-9069-X.

```
Liu Zhongyi, Sun, Wenyu, and Tian Fangbao. Thu .
"A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function". United States.
doi:10.1007/S00245-009-9069-X.
```

```
@article{osti_21241844,
```

title = {A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function},

author = {Liu Zhongyi and Sun, Wenyu and Tian Fangbao},

abstractNote = {This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim. 16(4):1110-1136, 2006). The main iteration of the algorithm consists of a feasibility step and several centrality steps. We introduce a kernel function in the algorithm to induce the feasibility step. For parameter p element of [0,1], the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods, that is, O(nlog n/{epsilon})},

doi = {10.1007/S00245-009-9069-X},

journal = {Applied Mathematics and Optimization},

number = 2,

volume = 60,

place = {United States},

year = {Thu Oct 15 00:00:00 EDT 2009},

month = {Thu Oct 15 00:00:00 EDT 2009}

}