IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v120y2004i1d10.1023_bjota.0000012969.51013.2c.html
   My bibliography  Save this article

Global Convergence of the Newton Interior-Point Method for Nonlinear Programming

Author

Listed:
  • C. Durazzi

    (University of Ferrara)

  • V. Ruggiero

    (University of Ferrara)

Abstract

The aim of this paper is to show that the theorem on the global convergence of the Newton interior–point (IP) method presented in Ref. 1 can be proved under weaker assumptions. Indeed, we assume the boundedness of the sequences of multipliers related to nontrivial constraints, instead of the hypothesis that the gradients of the inequality constraints corresponding to slack variables not bounded away from zero are linearly independent. By numerical examples, we show that, in the implementation of the Newton IP method, loss of boundedness in the iteration sequence of the multipliers detects when the algorithm does not converge from the chosen starting point.

Suggested Citation

  • C. Durazzi & V. Ruggiero, 2004. "Global Convergence of the Newton Interior-Point Method for Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 120(1), pages 199-208, January.
    • Handle: RePEc:spr:joptap:v:120:y:2004:i:1:d:10.1023_b:jota.0000012969.51013.2c
    DOI: 10.1023/B:JOTA.0000012969.51013.2c
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOTA.0000012969.51013.2c
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/B:JOTA.0000012969.51013.2c?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Benedetta Morini & Valeria Simoncini, 2017. "Stability and Accuracy of Inexact Interior Point Methods for Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(2), pages 450-477, November.

    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:spr:joptap:v:120:y:2004:i:1:d:10.1023_b:jota.0000012969.51013.2c. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.