IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v120y2004i3d10.1023_bjota.0000025707.93792.be.html
   My bibliography  Save this article

Local Convergence of the Interior-Point Newton Method for General Nonlinear Programming

Author

Listed:
  • M. M. El-Alem

    (University of Alexandria
    United Arab Emirates University)

  • S. El-Sayed

    (University of Banha)

  • B. El-Sobky

    (University of Alexandria)

Abstract

In this paper, a formulation for an interior-point Newton method of general nonlinear programming problems is presented. The formulation uses the Coleman-Li scaling matrix. The local convergence and the q-quadratic rate of convergence for the method are established under the standard assumptions of the Newton method for general nonlinear programming.

Suggested Citation

  • M. M. El-Alem & S. El-Sayed & B. El-Sobky, 2004. "Local Convergence of the Interior-Point Newton Method for General Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 120(3), pages 487-502, March.
    • Handle: RePEc:spr:joptap:v:120:y:2004:i:3:d:10.1023_b:jota.0000025707.93792.be
    DOI: 10.1023/B:JOTA.0000025707.93792.be
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:JOTA.0000025707.93792.be
    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.0000025707.93792.be?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. Khalid Abdulaziz Alnowibet & Salem Mahdi & Mahmoud El-Alem & Mohamed Abdelawwad & Ali Wagdy Mohamed, 2022. "Guided Hybrid Modified Simulated Annealing Algorithm for Solving Constrained Global Optimization Problems," Mathematics, MDPI, vol. 10(8), pages 1-25, April.

    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:3:d:10.1023_b:jota.0000025707.93792.be. 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.