Pages that link to "Item:Q4327908"
From MaRDI portal
The following pages link to Some generalizations of the criss-cross method for quadratic programming (Q4327908):
Displaying 13 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Inverses of \(2\times 2\) block matrices (Q1609046) (← links)
- New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
- New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
- On solving parametric multiobjective quadratic programs with parameters in general locations (Q2678592) (← links)
- Finiteness of Criss-Cross Method in Complementarity Problem (Q5114998) (← links)
- Sufficient matrices: properties, generating and testing (Q6596334) (← links)
