Componentwise error bounds for linear complementarity problems

DOI10.1093/IMANUM/DRP026MaRDI QIDQ3078369zbMATH OpenOpenAlexFDO

Authors Zhengyu Wang, Yaxiang 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)

Recommendations

• A comparison of error bounds for linear complementarity problems of \(H\)-matrices
• The refined error bounds for linear complementarity problems of \(H_+\)-matrices
• Some new error bounds for linear complementarity problems of H-matrices
• Computation of error bounds for P-matrix linear complementarity problems
• Error bounds for linear complementarity problems of \(MB\)-matrices

Cited in

(18)

• New global error bound for extended linear complementarity problems
• Componentwise error bounds and direct linear system solving
• Error bounds for the solution sets of quadratic complementarity problems
• The refined error bounds for linear complementarity problems of \(H_+\)-matrices
• Exact computation of an error bound for the balanced linear complementarity problem with unique solution
• Strictly semi-positive tensors and the boundedness of tensor complementarity problems
• A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
• A comparison of error bounds for linear complementarity problems of \(H\)-matrices
• New Error Bounds for the Linear Complementarity Problem
• Some new error bounds for linear complementarity problems of H-matrices
• Error bounds for nonlinear complementarity problems with band structure
• Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem
• Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
• Bounding the error for approximate solutions of almost linear complementarity problems using feasible vectors
• Global error bound estimates algorithm for an R₀-type generalized LCP over polyhedral cone and its applications
• Computation of error bounds for P-matrix linear complementarity problems
• A parallel iterative algorithm for differential linear complementarity problems
• On a global projection-type error bound for the linear complementarity problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3078369)