Finiteness of Criss-Cross Method in Complementarity Problem

DOI10.1007/978-981-10-4642-1_15zbMath1435.65093OpenAlexW2607337407MaRDI QIDQ5114998

No author found.

Publication date: 29 June 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-10-4642-1_15

zbMATH Keywords

Lemke's algorithmcomplementarity problemcriss-cross methodfully copositive matrixpositive subdefinite matrixgeneralized positive subdefinite matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (7)

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 hidden \(Z\)-matrix and interior point algorithm ⋮ Iterative descent method for generalized Leontief model ⋮ On column competent matrices and linear complementarity problem ⋮ Unnamed Item ⋮ More on hidden Z-matrices and linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• The principal pivoting method revisited
• A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
• A finite conformal-elimination free algorithm over oriented matroid programming
• Two characterizations of sufficient matrices
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• Fully copositive matrices
• Notes on sufficient matrices
• Positive Subdefinite Matrices, Generalized Monotonicity, and Linear Complementarity Problems
• The Criss-Cross Method for Solving Linear Programming Problems
• The Linear Complementarity Problem
• The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
• New Finite Pivoting Rules for the Simplex Method
• Some generalizations of the criss-cross method for quadratic programming
• Some Properties of Generalized Positive Subdefinite Matrices
• Subdefinite Matrices and Quadratic Forms
• Affine Pseudomonotone Mappings and the Linear Complementarity Problem
• On the classes of fully copositive and fully semimonotone matrices

This page was built for publication: Finiteness of Criss-Cross Method in Complementarity Problem