A note on the Talman, Van der Heyden linear complementarity algorithm

DOI10.1007/BF02591722zbMath0493.90085MaRDI QIDQ3956765

Philip C. Jones

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problemcopositive matrixLemke's algorithmsolution algorithmsymmetric positive semidefinite matrixarbitrary starting pointsTalman-Van der Heyden algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositivity and sparsity relations using spectral properties

Cites Work

• An economic model of short-rotation forestry
• Computing an Optimal Invariant Capital Stock
• Computing stationary points
• More with the Lemke complementarity algorithm

This page was built for publication: A note on the Talman, Van der Heyden linear complementarity algorithm