A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
DOI10.1007/S11784-018-0556-ZzbMATH Open1391.90591OpenAlexW2801864408WikidataQ129917894 ScholiaQ129917894MaRDI QIDQ721216FDOQ721216
Authors: Hongchun Sun, M. Sun, Yiju Wang, S. J. Li 
Publication date: 18 July 2018
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11784-018-0556-z
Recommendations
- A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- Global error bound estimation for the generalized nonlinear complementarity problem over a closed convex cone
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Title not available (Why is that?)
- Error bounds for linear complementarity problems for \(SB\)-matrices
- Error bounds for linear complementarity problems of \(DB\)-matrices
- Error bounds for linear complementarity problems for \(B\)-matrices
- General variational inequalities
- New improved error bounds for the linear complementarity problem
- Error bounds in mathematical programming
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- Computation of error bounds for P-matrix linear complementarity problems
- New error bounds for the linear complementarity problem with an \(SB\)-matrix
- Error bounds for linear complementarity problems of Nekrasov matrices
- Error bounds for the linear complementarity problem with a P-matrix
- A comparison of error bounds for linear complementarity problems of \(H\)-matrices
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- On the resolution of the generalized nonlinear complementarity problem
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- Global projection-type error bounds for general variational inequalities
- Error bounds for nondegenerate monotone linear complementarity problems
- A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
- Global \(s\)-type error bound for the extended linear complementarity problem and applications.
- Error bounds for monotone linear complementarity problems
- Global error bound estimation for the generalized nonlinear complementarity problem over a closed convex cone
- Some new error bounds for linear complementarity problems of H-matrices
- Error bounds for the linear complementarity problem with a \(\Sigma \)-SDD matrix
- Inexact Newton methods for the nonlinear complementarity problem
- Componentwise error bounds for linear complementarity problems
- New Error Bounds for the Linear Complementarity Problem
- A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
Cited In (8)
- A complementarity model and algorithm for direct multi-commodity flow supply chain network equilibrium problem
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- Error bound estimation of the generalized linear complementarity problem over a polyhedral cone
- A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone
- Global error bounds for the extended vertical LCP
- Global error bound estimates algorithm for an \(R_0\)-type generalized LCP over polyhedral cone and its applications
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
This page was built for publication: A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721216)
