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 26 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)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- A short proof of finiteness of Murty's principal pivoting algorithm (Q1262225) (← links)
- On the convergence of the block principal pivotal algorithm for the LCP (Q1290721) (← links)
- A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point (Q1322558) (← links)
- On some classes of matrices related to solving linear complementarity problems as linear programs (Q1328655) (← links)
- A support submatrix for the generalized linear complementarity problem (Q1343546) (← links)
- Extended \(P\)-pairs (Q1355215) (← links)
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems (Q1611006) (← links)
- A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem (Q1939694) (← links)
- Pivoting in linear complementarity: Two polynomial-time cases (Q2391195) (← 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)
- Principal pivoting method for solving column sufficient complementarity problems (Q2706272) (← links)
- A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
- Two counterexamples on the polynomial solvability of the linear complementarity problem (Q3809598) (← links)
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP (Q3842984) (← 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)
