Criss-cross methods: A fresh view on pivot algorithms
From MaRDI portal
Publication:1365063
DOI10.1007/BF02614325zbMATH Open0887.90113DBLPjournals/mp/FukudaT97OpenAlexW1965826347WikidataQ55880167 ScholiaQ55880167MaRDI QIDQ1365063FDOQ1365063
Authors: Komei Fukuda, Tamás Terlaky 
Publication date: 1 June 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614325
Recommendations
- New variants of finite criss-cross pivot algorithms for linear programming
- scientific article; zbMATH DE number 1226265
- The criss-cross method can take \(\Omega(n^d)\) pivots
- scientific article
- Analysis of the Diagonal Pivoting Method
- Comparing pivoting strategies for almost strictly sign regular matrices
- Pivot vector method and its applications
- The Criss-Cross Method for Solving Linear Programming Problems
- The principal pivoting method revisited
Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- \(P_ *\)-matrices are just sufficient
- Title not available (Why is that?)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Complementary pivot theory of mathematical programming
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- Equilibrium Points of Bimatrix Games
- Sufficient matrices and the linear complementarity problem
- Pivot rules for linear programming: A survey on recent theoretical developments
- New Finite Pivoting Rules for the Simplex Method
- The generalized simplex method for minimizing a linear form under linear inequality restraints
- Optimality and Degeneracy in Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- The simplex method. A probabilistic analysis
- A finite crisscross method for oriented matroids
- A convergent criss-cross method
- The d-Step Conjecture and Its Relatives
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Symmetric dual quadratic programs
- Title not available (Why is that?)
- A new proof for the criss-cross method for quadratic programming
- Computational complexity of parametric linear programming
- The Criss-Cross Method for Solving Linear Programming Problems
- On the finiteness of the criss-cross method
- Orientability of matroids
- The simplex algorithm with a new primal and dual pivot rule
- EP theorems and linear complementarity problems
- The finite criss-cross method for hyperbolic programming
- Complementarity in Oriented Matroids
- LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
- Some generalizations of the criss-cross method for quadratic programming
- Some Empirical Tests of the Criss-Cross Method
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
- What is the worst case behavior of the simplex algorithm?
- A combinatorial abstraction of linear programming
- Symmetry and positive definiteness in oriented matroids
- Linear quadratic programming in oriented matroids
- Title not available (Why is that?)
- Interior point methods of mathematical programming
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
- On anti-cycling pivoting rules for the simplex method
- Title not available (Why is that?)
- Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
- A general deterministic pivot method for oriented matroid programming
- Finding all common bases in two matroids
- A Note on Convergence of the Ford-Fulkerson Flow Algorithm
- On extremal behaviors of Murty's least index method
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- The finite criss-cross method for hyperbolic programming
- New variants of the criss-cross method for linearly constrained convex quadratic programming
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Exact methods for large-scale multi-period financial planning problems
- The sagitta method for solving linear programs
- A simplex based algorithm to solve separated continuous linear programs
- Diameters of cocircuit graphs of oriented matroids: an update
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Tropicalizing the simplex algorithm
- Exterior point simplex-type algorithms for linear and network optimization problems
- Combinatorial redundancy detection
- On the existence of a short pivoting sequence for a linear program
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Title not available (Why is that?)
- A convergent criss-cross method
- A phase-1 approach for the generalized simplex algorithm
- Edges versus circuits: a hierarchy of diameters in polyhedra
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Circuit walks in integral polyhedra
- A primal deficient-basis simplex algorithm for linear programming
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
- Pivot versus interior point methods: Pros and cons
- New variants of finite criss-cross pivot algorithms for linear programming
- The criss-cross method can take \(\Omega(n^d)\) pivots
This page was built for publication: Criss-cross methods: A fresh view on pivot algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365063)
