The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems

DOI10.2478/ausi-2014-0007zbMath1297.49055OpenAlexW2130900556MaRDI QIDQ5167105

Zsolt Csizmadia, Adrienn Nagy, Tibor Illés

Publication date: 9 July 2014

Published in: Acta Universitatis Sapientiae, Informatica (Search for Journal in Brave)

Full work available at URL: http://www.acta.sapientia.ro/acta-info/C5-1/info51-7.pdf

zbMATH Keywords

linear complementarity problemsufficient matrixbi-matrix gamescriss-cross algorithmArrow-Debreu market equilibrium problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50)

Related Items (5)

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 ⋮ Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial path-following interior point algorithm for general linear complementarity problems
• EP theorem for dual linear complementarity problems
• A finite conformal-elimination free algorithm over oriented matroid programming
• NP-completeness of the linear complementarity problem
• Sufficient matrices and the linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• EP theorems and linear complementarity problems
• Co-NP-completeness of some matrix classification problems
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• Criteria for sufficient matrices
• \(P_ *\)-matrices are just sufficient
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• A path to the Arrow-Debreu competitive market equilibrium
• The role of pivoting in proving some fundamental theorems of linear algebra
• A convergent criss-cross method
• LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
• Equilibrium Points of Bimatrix Games
• Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices
• Existence of an Equilibrium for a Competitive Economy

This page was built for publication: The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems