A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY
Keyword(s):
AbstractWe introduce a full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular function to provide the feasibility step and to measure proximity to the central path. The result of polynomial complexity coincides with the best known iteration bound for infeasible interior-point methods.
2016 ◽
Vol 09
(03)
◽
pp. 1650059
◽
2009 ◽
Vol 26
(03)
◽
pp. 365-382
◽
2015 ◽
Vol 08
(04)
◽
pp. 1550071
◽
2016 ◽
Vol 4
(6)
◽
pp. 316
◽
Keyword(s):
2016 ◽
Vol 09
(02)
◽
pp. 1650039
2018 ◽
Vol 96
(10)
◽
pp. 1979-1992
◽
Keyword(s):