An extension for identifying search directions for interior-point methods in linear optimization
2018 ◽
Vol 13
(01)
◽
pp. 2050014
Keyword(s):
In this paper, based on the transformation [Formula: see text] introduced by Darvay and Takács [New method for determining search directions for interior-point algorithms in linear optimization, Optim. Lett. 12(5) (2018) 1099–1116], we present a full-Newton step interior-point method for linear optimization. They consider the case [Formula: see text]. Here, we extend this to the case [Formula: see text] to obtain our search directions. We show that the iterates lie in the neighborhood of the local quadratic convergence of the proximity measure. Finally, the polynomial complexity of the proposed algorithm is proved.
2014 ◽
Vol 07
(01)
◽
pp. 1450018
2009 ◽
Vol 145
(2)
◽
pp. 271-288
◽
2015 ◽
Vol 25
(1)
◽
pp. 57-72
◽
2016 ◽
Vol 73
(1)
◽
pp. 27-42
◽
Keyword(s):
Keyword(s):
2016 ◽
Vol 09
(03)
◽
pp. 1650059
◽
2010 ◽
Vol 38
(2)
◽
pp. 147-151
◽
Keyword(s):