A Scaled Central Path for Linear Optimization
2011 ◽
Vol 204-210
◽
pp. 683-686
Keyword(s):
The central path is the most important in the design of interior-point algorithm for linear optimization. By an equivalence reformulation for the classical Newton direction, we give a new scaled central path, from which a new search direction is obtained. We derive the complexity bound for the full-step interior point algorithm based on this searching direction and the resulting complexity bound is the best-known for linear optimization.
2019 ◽
Vol 12
(07)
◽
pp. 2050001
2015 ◽
Vol 25
(1)
◽
pp. 57-72
◽
2007 ◽
Vol 22
(3)
◽
pp. 519-530
◽
2017 ◽
Vol 94
(12)
◽
pp. 2271-2282
2011 ◽
Vol 88
(15)
◽
pp. 3163-3185
◽
2015 ◽
Vol 166
(2)
◽
pp. 605-618
◽
2014 ◽
Vol 07
(01)
◽
pp. 1450018