Algorithms for the Generalized Linear Complementarity Problem with a Vertical BlockZ-Matrix

DOI10.1137/S1052623494275586zbMath0868.90125OpenAlexW2034712404MaRDI QIDQ4717553

S. K. Neogy, S. R. Mohan

Publication date: 1 December 1996

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623494275586

zbMATH Keywords

generalized linear complementarityvertical block \(Z\)-matrixmodified simplex algorithmalmost proper basis matrixsecondary proper ray

Mathematics Subject Classification ID

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

Related Items (5)

Projected splitting methods for vertical linear complementarity problems ⋮ A modulus-based formulation for the vertical linear complementarity problem ⋮ Sufficient matrices and the linear complementarity problem ⋮ Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems ⋮ Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem

This page was built for publication: Algorithms for the Generalized Linear Complementarity Problem with a Vertical BlockZ-Matrix