Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point

Adolphus Talman and Ludo Van der Heyden

No 600, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

Pages: 24 pages
Date: 1981-08
Note: CFP 599.
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Published in Homotopy Methods and Global Convergence, Nato Conference Series II, Plenum Press, 1983, pp. 267-285

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d06/d0600.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
Working Paper: Algorithms for the linear complementarity problem which allow an arbitrary starting point (1983)
Working Paper: Algorithms for the linear complementarity problem which allow an arbitrary starting point (1981)
Working Paper: Algorithms for the linear complementarity problem which allow an arbitrary starting point (1981)
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:cwl:cwldpp:600

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().