Abstract
In this paper, we design a primal-dual infeasible interior-point method for circular optimization that uses only full Nesterov-Todd steps. Each main iteration of the algorithm consisted of one so-called feasibility step. Furthermore, giving a complexity analysis of the algorithm, we derive the currently best-known iteration bound for infeasible interior-point methods.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
