Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimisation
by Maryam Zangiabadi; Soodabeh Asadi; Hossein Mansouri
International Journal of Operational Research (IJOR), Vol. 28, No. 2, 2017

Abstract: In this paper, we improve the full Nesterov-Todd (NT)-step infeasible-interior-point algorithm for symmetric optimisation of Gu et al. (2011). Our proposed algorithm differs from Gu et al.'s algorithm such that it has the advantage that no centring steps are needed. In each main iteration of Gu et al.'s algorithm, one feasibility and a few centring steps are needed to get feasible iterates for a pair of perturbed problems, close enough to its central path. In this paper, we perform only one full-NT-step in each main iteration of the algorithm. Despite eliminating the centring steps, the complexity bound of our algorithm matches the best obtained one for symmetric optimisation.

Online publication date: Tue, 10-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com