New criss-cross type algorithms for linear complementarity problems with sufficient matrices

DOI10.1080/10556780500095009zbMath1095.90109OpenAlexW2115992951WikidataQ56504899 ScholiaQ56504899MaRDI QIDQ5478870

Zsolt Csizmadia, Tibor Illés

Publication date: 13 July 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500095009

zbMATH Keywords

Linear complementarity problemAlternative and EP theoremsCriss-cross algorithmSufficient matrix

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation, Market exchange models and geometric programming, Exterior point simplex-type algorithms for linear and network optimization problems, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, A polynomial path-following interior point algorithm for general linear complementarity problems, Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied, EP theorem for dual linear complementarity problems, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique

Cites Work

• NP-completeness of the linear complementarity problem
• Sufficient matrices and the linear complementarity problem
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• EP theorems and linear complementarity problems
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• Criteria for sufficient matrices
• The role of pivoting in proving some fundamental theorems of linear algebra
• A convergent criss-cross method