The following pages link to A convergent criss-cross method (Q3703581):
Displayed 25 items.
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- A finite crisscross method for oriented matroids (Q1073036) (← links)
- A new algorithm for quadratic programming (Q1097172) (← links)
- On the finiteness of the criss-cross method (Q1176822) (← links)
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems (Q1177915) (← links)
- A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← 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)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
- A phase-1 approach for the generalized simplex algorithm (Q1612514) (← 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)
- A projective simplex algorithm using LU decomposition (Q1975340) (← links)
- The role of pivoting in proving some fundamental theorems of linear algebra (Q2644727) (← links)
- Optimizing of sums and products of linear fractional functions under linear constraints (Q2785387) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- A new proof for the criss-cross method for quadratic programming (Q4327956) (← links)
- Variants of the Hungarian method for solving linear programming problems (Q4729607) (← links)
- The theory of linear programming:skew symmetric self-dual problems and the central path<sup>*</sup> (Q4764897) (← links)
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices (Q5478870) (← links)