Journal article
A note on the Talman, Van der Heyden linear complementarity algorithm
Mathematical programming, Vol.25(1), pp.122-124
1983
DOI: 10.1007/BF02591722
Abstract
Talman and Van der Heyden have recently proposed a pivoting algorithm for linear complementarity problems which generalizes Lemke's procedure and allows arbitrary starting points. (Lemke's method starts at the origin). This note shows that the new algorithm will work on a wider class of problems than those considered by Talman and Van der Heyden.
Details
- Title: Subtitle
- A note on the Talman, Van der Heyden linear complementarity algorithm
- Creators
- Philip C. Jones - Northwestern University
- Resource Type
- Journal article
- Publication Details
- Mathematical programming, Vol.25(1), pp.122-124
- DOI
- 10.1007/BF02591722
- ISSN
- 0025-5610
- eISSN
- 1436-4646
- Publisher
- ELSEVIER SCIENCE BV; AMSTERDAM
- Number of pages
- 3
- Language
- English
- Date published
- 1983
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963099902771
Metrics
1 Record Views