IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v103y2001i1p149-15910.1023-a1012951021320.html
   My bibliography  Save this article

High Order Long-Step Methods for Solving Linear Complementarity Problems

Author

Listed:
  • Josef Stoer

Abstract

The paper is concerned with methods for solving linear complementarity problems (LCP) that are monotone or at least sufficient in the sense of Cottle, Pang and Venkateswaran (1989). A basic concept of interior-point-methods is the concept of (perhaps weighted) feasible or infeasible interior-point paths. They converge to a solution of the LCP if a natural path parameter, usually the current duality gap, tends to 0. After reviewing some basic analyticity properties of these paths it is shown how these properties can be used to devise also long-step path-following methods (and not only predictor–corrector type methods) for which the duality gap converges Q-superlinearly to 0 with an arbitrarily high order. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • Josef Stoer, 2001. "High Order Long-Step Methods for Solving Linear Complementarity Problems," Annals of Operations Research, Springer, vol. 103(1), pages 149-159, March.
    • Handle: RePEc:spr:annopr:v:103:y:2001:i:1:p:149-159:10.1023/a:1012951021320
    DOI: 10.1023/A:1012951021320
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1012951021320
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1012951021320?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. Florian A. Potra, 2016. "Sufficient weighted complementarity problems," Computational Optimization and Applications, Springer, vol. 64(2), pages 467-488, June.

    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:annopr:v:103:y:2001:i:1:p:149-159:10.1023/a:1012951021320. 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.