Reducing horizontal linear complementarity problems
From MaRDI portal
Publication:1894520
DOI10.1016/0024-3795(94)00147-6zbMath0835.90106OpenAlexW1967497904MaRDI QIDQ1894520
Reha H. Tütüncü, Michael J. Todd
Publication date: 24 July 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8955
Related Items (17)
The convergence of the modulus-based Jacobi (MJ) iteration method for solving horizontal linear complementarity problems ⋮ Reducing a monotone horizontal LCP to an LCP ⋮ A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix ⋮ On the extended linear complementarity problem ⋮ A generalized variant of two-sweep modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ The nonlinear lopsided PSS-like and HSS-like modulus-based matrix splitting iteration methods for horizontal linear complementarity problem ⋮ The relaxation modulus-based matrix splitting iteration method for horizontal linear complementarity problems ⋮ A preconditioned general modulus-based matrix splitting iteration method for solving horizontal linear complementarity problems ⋮ Local uniqueness of solutions to the extended linear complementarity problem ⋮ Splitting methods for a class of horizontal linear complementarity problems ⋮ On the convergence of modulus-based matrix splitting methods for horizontal linear complementarity problems in hydrodynamic lubrication ⋮ A generalization of irreducibility and diagonal dominance with applications to horizontal and vertical linear complementarity problems ⋮ 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 ⋮ A modulus-based nonsmooth Newton's method for solving horizontal linear complementarity problems ⋮ A sign-based linear method for horizontal linear complementarity problems ⋮ On the equivalence of linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Crashing a maximum-weight complementary basis
- The generalized linear complementarity problem and an algorithm to find all its solutions
- Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
- Some generalizations of positive definiteness and monotonicity
- Equivalence of LCP and PLS
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A useful generalization of theP 0 matrix concept
- A Partition Theorem for Euclidean n-Space
This page was built for publication: Reducing horizontal linear complementarity problems