IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v61y2005i1p41-55.html
   My bibliography  Save this article

Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms

Author

Listed:
  • Zheng-Hai Huang

Abstract

In this paper we propose a non-interior-point smoothing algorithm for solving the monotone nonlinear complementarity problem (NCP). The proposed algorithm is simpler than many existing non-interior-point smoothing algorithms in the sense that it only needs to solve one system of linear equations and to perform one line search at each iteration. We show that the proposed algorithm is globally convergent under the assumption that the NCP concerned has a nonempty solution set. Such assumption is weaker than those required by most other non-interior-point smoothing algorithms. In particular, we prove that the solution obtained by the proposed algorithm is a maximally complementary solution of the NCP concerned. Preliminary numerical results are reported. Copyright Springer-Verlag 2005

Suggested Citation

  • Zheng-Hai Huang, 2005. "Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(1), pages 41-55, March.
    • Handle: RePEc:spr:mathme:v:61:y:2005:i:1:p:41-55
    DOI: 10.1007/s001860400384
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400384
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400384?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.

    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:mathme:v:61:y:2005:i:1:p:41-55. 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.