High Order Long-Step Methods for Solving Linear Complementarity Problems

Josef Stoer ()

Annals of Operations Research, 2001, vol. 103, issue 1, 149-159

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

Keywords: complementarity problems; interior-point methods; long-step methods; high order convergence (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1012951021320 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:103:y:2001:i:1:p:149-159:10.1023/a:1012951021320

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1012951021320

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().