Error Bounds for Regularized Complementarity Problems

1999 ◽  
pp. 247-274 ◽  
Author(s):  
Paul Tseng
Keyword(s):  
Error Bounds ◽  
Complementarity Problems

scholarly journals New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices

2019 ◽  
Vol 17 (1) ◽  
pp. 1599-1614
Author(s):  
Zhiwu Hou ◽  
Xia Jing ◽  
Lei Gao
Keyword(s):  
Linear Algebra ◽  
Error Bound ◽  
Linear Complementarity Problem ◽  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Examples ◽  
Numer Algor ◽  
Better Than

Abstract A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola and Peña [Linear Algebra Appl., 2013, 438, 1339–1446] in some cases. Based on the obtained results, we also give an error bound for the LCP of SB-matrices. It is proved that the new bound is sharper than that provided by Dai et al. [Numer. Algor., 2012, 61, 121–139] under certain assumptions.

On error bounds of polynomial complementarity problems with structured tensors

Optimization ◽  
2017 ◽  
Vol 67 (2) ◽  
pp. 341-358 ◽  
Author(s):  
Liyun Ling ◽  
Hongjin He ◽  
Chen Ling
Keyword(s):  
Error Bounds ◽  
Complementarity Problems

Note on error bounds for linear complementarity problems of Nekrasov matrices

2019 ◽  
Vol 83 (1) ◽  
pp. 355-372 ◽  
Author(s):  
Chaoqian Li ◽  
Shaorong Yang ◽  
Hui Huang ◽  
Yaotang Li ◽  
Yimin Wei
Keyword(s):  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Nekrasov Matrices
Sign in / Sign up

Export Citation Format

Share Document