A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION
2014 ◽
Vol 07
(01)
◽
pp. 1450018
Keyword(s):
This paper deals with an infeasible interior-point algorithm with full-Newton step for linear optimization based on a kernel function, which is an extension of the work of the first author and coworkers (J. Math. Model Algorithms (2013); DOI 10.1007/s10852-013-9227-7). The main iteration of the algorithm consists of a feasibility step and several centrality steps. The centrality step is based on Darvay's direction, while we used a kernel function in the algorithm to induce the feasibility step. For the kernel function, the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods.
2015 ◽
Vol 25
(1)
◽
pp. 57-72
◽
2009 ◽
Vol 145
(2)
◽
pp. 271-288
◽
2018 ◽
Vol 13
(01)
◽
pp. 2050014
2015 ◽
Vol 08
(03)
◽
pp. 1550037
◽
Keyword(s):
Keyword(s):