IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p97-11410.1023-a1018942131812.html
   My bibliography  Save this article

A path following method for LCP withsuperlinearly convergent iteration sequence

Author

Listed:
  • Florian Potra
  • Rongqin Sheng

Abstract

A new algorithm for solving linear complementarity problems with sufficient matrices isproposed. If the problem has a solution, the algorithm is superlinearly convergent from anypositive starting points, even for degenerate problems. Each iteration requires only onematrix factorization and at most two backsolves. Only one backsolve is necessary if theproblem is known to be nondegenerate. The algorithm generates points in a large neighborhoodof the central path and has the lowest iteration complexity obtained so far in theliterature. Moreover, the iteration sequence converges superlinearly to a maximal solutionwith the same Q-order as the complementarity sequence. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Florian Potra & Rongqin Sheng, 1998. "A path following method for LCP withsuperlinearly convergent iteration sequence," Annals of Operations Research, Springer, vol. 81(0), pages 97-114, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:97-114:10.1023/a:1018942131812
    DOI: 10.1023/A:1018942131812
    as

    Download full text from publisher

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

    More about this item

    Statistics

    Access and download statistics

    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:81:y:1998:i:0:p:97-114:10.1023/a:1018942131812. 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.