Global error bound estimates algorithm for an R₀-type generalized LCP over polyhedral cone and its applications
From MaRDI portal
Publication:6653534
DOI10.1016/J.CAM.2024.116288MaRDI QIDQ6653534FDOQ6653534
Authors: Hongchun Sun, Yiju Wang, Jiakang Du 
Publication date: 16 December 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Recommendations
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- Further discussion on the error bound for generalized linear 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 linear complementarity problem over a polyhedral cone under weaker conditions
- A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Error bounds for linear complementarity problems for \(SB\)-matrices
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- 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
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- 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
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- 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
- Error bounds for nondegenerate monotone linear complementarity problems
- A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
- Error bounds for monotone linear complementarity problems
- 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 linear complementarity problem over a polyhedral cone under weaker conditions
This page was built for publication: Global error bound estimates algorithm for an \(R_0\)-type generalized LCP over polyhedral cone and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653534)
