Improved error bounds based on $\alpha (M)$ for the linear complementarity problem

DOI10.1016/j.laa.2019.12.009OpenAlexW2995092806MaRDI QIDQ2174476

Publication date: 21 April 2020

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

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

zbMATH Keywords

solution error bound linear complementarity problem (LCP)

Mathematics Subject Classification ID

Roundoff error (65G50) Algorithms with automatic result verification (65G20)

Related Items (1)

New error bounds for the tensor complementarity problem

Cites Work

Unnamed Item
Unnamed Item
Some new error bounds for linear complementarity problems of H-matrices
Error bounds for linear complementarity problems of $MB$-matrices
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
Error bounds for the linear complementarity problem with a P-matrix
A comparison of error bounds for linear complementarity problems of $H$-matrices
Solution of nonsymmetric, linear complementarity problems by iterative methods
An interior point potential reduction algorithm for the linear complementarity problem
Chaotic iterative methods for the linear complementarity problems
New improved error bounds for the linear complementarity problem
Two-stage multisplitting iteration methods using modulus-based matrix splitting as inner iteration for linear complementarity problems
Computation of error bounds for P-matrix linear complementarity problems
Complementary pivot theory of mathematical programming
On the number of solutions to the complementarity problem and spanning properties of complementary cones
New error bounds for the linear complementarity problem with an $SB$-matrix
On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
Componentwise error bounds for linear complementarity problems
Modulus-based matrix splitting iteration methods for linear complementarity problems
Perturbation Bounds of P-Matrix Linear Complementarity Problems
Matrix multisplitting relaxation methods for linear complementarity problems
Engineering and Economic Applications of Complementarity Problems
Error bounds for monotone linear complementarity problems
The general modulus-based Jacobi iteration method for linear complementarity problems
Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: Improved error bounds based on $\alpha (M)$ for the linear complementarity problem

Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem