IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v28y2017i2p290-306.html
   My bibliography  Save this article

Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimisation

Author

Listed:
  • Maryam Zangiabadi
  • Soodabeh Asadi
  • Hossein Mansouri

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.

Suggested Citation

  • Maryam Zangiabadi & Soodabeh Asadi & Hossein Mansouri, 2017. "Modified polynomial-time full-NT-step infeasible interior-point algorithm for symmetric optimisation," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 28(2), pages 290-306.
    • Handle: RePEc:ids:ijores:v:28:y:2017:i:2:p:290-306
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=81470
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:28:y:2017:i:2:p:290-306. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.