Finiteness of Criss-Cross Method in Complementarity Problem
From MaRDI portal
Recommendations
- On the finiteness of the criss-cross method
- scientific article; zbMATH DE number 3934764
- The finite criss-cross method for hyperbolic programming
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method
- Finiteness of the criss-cross algorithm for the linear programming problem with s-monotone index selection rules
- On finite termination of an iterative method for linear complementarity problems
- scientific article; zbMATH DE number 4054939
- scientific article; zbMATH DE number 3974764
- Tensor complementarity problems with finite solution sets
Cites work
- A finite conformal-elimination free algorithm over oriented matroid programming
- A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
- Affine Pseudomonotone Mappings and the Linear Complementarity Problem
- Fully copositive matrices
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1748522 (Why is no real title available?)
- New Finite Pivoting Rules for the Simplex Method
- Notes on sufficient matrices
- On the classes of fully copositive and fully semimonotone matrices
- Positive subdefinite matrices, generalized monotonicity, and linear complementarity problems
- Some generalizations of the criss-cross method for quadratic programming
- Some Properties of Generalized Positive Subdefinite Matrices
- Subdefinite Matrices and Quadratic Forms
- The Criss-Cross Method for Solving Linear Programming Problems
- The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
- The Linear Complementarity Problem
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The principal pivoting method revisited
- Two characterizations of sufficient matrices
Cited in
(17)- On the finiteness of the criss-cross method
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- The finite criss-cross method for hyperbolic programming
- On hidden Z-matrix and interior point algorithm
- Iterative descent method for generalized Leontief model
- On column competent matrices and linear complementarity problem
- The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method
- On processability of Lemke's algorithm
- scientific article; zbMATH DE number 2099987 (Why is no real title available?)
- More on hidden Z-matrices and linear complementarity problem
- More on matrix splitting modulus-based iterative methods for solving linear complementarity problem
- Bounded homotopy path approach to the solution of linear complementarity problems
- On some properties of \(K\)-type block matrices in the context of complementarity problem
- On the solution set of semi-infinite tensor complementarity problem
- Error bound for the linear complementarity problem using plus function
- More on semipositive tensor and tensor complementarity problem
- On some properties of \({\omega}\)-uniqueness in tensor complementarity problem
This page was built for publication: Finiteness of Criss-Cross Method in Complementarity Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114998)