Pages that link to "Item:Q1877024"
From MaRDI portal
The following pages link to New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024):
Displaying 5 items.
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules (Q5413871) (← links)
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870) (← links)
