Pages that link to "Item:Q344960"
From MaRDI portal
The following pages link to Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960):
Displaying 3 items.
- Linear complementarity model predictive control with limited iterations for box-constrained problems (Q2663927) (← links)
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)
