Pages that link to "Item:Q3657800"
From MaRDI portal
The following pages link to Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's (Q3657800):
Displayed 3 items.
- Conjugate gradient method for the linear complementarity problem withs-matrix (Q1007676) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
