Pages that link to "Item:Q3707784"
From MaRDI portal
The following pages link to Linear complementarity problems solvable by a polynomially bounded pivoting algorithm (Q3707784):
Displaying 17 items.
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- CP-rays in simplicial cones (Q811413) (← links)
- Generalizations of the hidden Minkowski property (Q947672) (← links)
- Good hidden \(P\)-matrix sandwiches (Q996290) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On the convergence of the block principal pivotal algorithm for the LCP (Q1290721) (← links)
- On some classes of matrices related to solving linear complementarity problems as linear programs (Q1328655) (← links)
- Extended \(P\)-pairs (Q1355215) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- Counting unique-sink orientations (Q2434730) (← links)
- A class of polynomially solvable linear complementarity problems (Q2492703) (← links)
- 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)
- Two counterexamples on the polynomial solvability of the linear complementarity problem (Q3809598) (← links)
- Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables (Q6161304) (← links)
- On some properties of \(K\)-type block matrices in the context of complementarity problem (Q6629106) (← links)
