Criss-cross methods: A fresh view on pivot algorithms
From MaRDI portal
Publication:1365063
DOI10.1007/BF02614325zbMath0887.90113WikidataQ55880167 ScholiaQ55880167MaRDI QIDQ1365063
Publication date: 1 June 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
90C20: Quadratic programming
90C05: Linear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
The sagitta method for solving linear programs, A simplex based algorithm to solve separated continuous linear programs, Pivot versus interior point methods: Pros and cons, New variants of finite criss-cross pivot algorithms for linear programming, A phase-1 approach for the generalized simplex algorithm, The finite criss-cross method for hyperbolic programming, New variants of the criss-cross method for linearly constrained convex quadratic programming, A primal deficient-basis simplex algorithm for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Linear quadratic programming in oriented matroids
- A new polynomial-time algorithm for linear programming
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- A finite crisscross method for oriented matroids
- The simplex method. A probabilistic analysis
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- Symmetry and positive definiteness in oriented matroids
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
- Sufficient matrices and the linear complementarity problem
- On the finiteness of the criss-cross method
- On anti-cycling pivoting rules for the simplex method
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A general deterministic pivot method for oriented matroid programming
- Orientability of matroids
- A combinatorial abstraction of linear programming
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- Pivot rules for linear programming: A survey on recent theoretical developments
- On extremal behaviors of Murty's least index method
- The simplex algorithm with a new primal and dual pivot rule
- Interior point methods of mathematical programming
- EP theorems and linear complementarity problems
- The finite criss-cross method for hyperbolic programming
- Finding all common bases in two matroids
- \(P_ *\)-matrices are just sufficient
- Complementary pivot theory of mathematical programming
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- The Criss-Cross Method for Solving Linear Programming Problems
- Complementarity in Oriented Matroids
- A convergent criss-cross method
- The d-Step Conjecture and Its Relatives
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
- Computational complexity of parametric linear programming
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- A Note on Convergence of the Ford-Fulkerson Flow Algorithm
- New Finite Pivoting Rules for the Simplex Method
- Some generalizations of the criss-cross method for quadratic programming
- A new proof for the criss-cross method for quadratic programming
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Symmetric dual quadratic programs
- Equilibrium Points of Bimatrix Games
- Some Empirical Tests of the Criss-Cross Method
- Optimality and Degeneracy in Linear Programming
