Componentwise error bounds for linear complementarity problems

DOI10.1093/imanum/drp026zbMath1209.90331OpenAlexW2033368599MaRDI QIDQ3078369

Zhengyu Wang, Ya-Xiang Yuan

Publication date: 18 February 2011

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/drp026

zbMATH Keywords

convex quadratic programming

Mathematics Subject Classification ID

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

Related Items (6)

New global error bound for extended linear complementarity problems ⋮ Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem ⋮ Strictly semi-positive tensors and the boundedness of tensor complementarity problems ⋮ A Parallel Iterative Algorithm for Differential Linear Complementarity Problems ⋮ Newton iterations in implicit time-stepping scheme for differential linear complementarity systems ⋮ A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions

This page was built for publication: Componentwise error bounds for linear complementarity problems