A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems

DOI10.1016/j.laa.2021.03.016zbMath1470.65121OpenAlexW3136534692MaRDI QIDQ2020709

Francesco Mezzadri, Emanuele Galligani

Publication date: 24 April 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2021.03.016

zbMATH Keywords

linear complementarity problemsirreducibilitydiagonal dominancecolumn representative matricesrow representative matrices

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical linear algebra (65F99) Numerical methods for variational inequalities and related problems (65K15)

Related Items (10)

Projected splitting methods for vertical linear complementarity problems ⋮ A modulus-based formulation for the vertical linear complementarity problem ⋮ A new kind of modulus-based matrix splitting methods for vertical linear complementarity problems ⋮ A generalized variant of two-sweep modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem ⋮ Modulus-based synchronous multisplitting iteration methods without auxiliary variable for solving vertical linear complementarity problems ⋮ Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems ⋮ A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ New convergence results of the modulus-based methods for vertical linear complementarity problems ⋮ A generalization of the equivalence relations between modulus-based and projected splitting methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducing a monotone horizontal LCP to an LCP
• A neural network for the linear complementarity problem
• Splitting methods for a class of horizontal linear complementarity problems
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• Reducing horizontal linear complementarity problems
• The extended linear complementarity problem
• On the solution of general absolute value equations
• On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
• Modulus-based matrix splitting methods for horizontal linear complementarity problems
• Some generalizations of positive definiteness and monotonicity
• Complementary pivot theory of mathematical programming
• A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
• The Linear Complementarity Problem
• Matrix Analysis
• A linear complementarity problem with an n by 2n “P”-matrix
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• The Generalized Order Linear Complementarity Problem
• On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
• The Extended Linear Complementarity Problem
• Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers
• A generalization of the linear complementarity problem
• A useful generalization of theP 0 matrix concept

This page was built for publication: A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems