Global error bound estimates algorithm for an R₀-type generalized LCP over polyhedral cone and its applications
From MaRDI portal
Publication:6653534
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
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
- A comparison of error bounds for linear complementarity problems of \(H\)-matrices
- A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone
- A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
- Componentwise error bounds for linear complementarity problems
- Computation of error bounds for P-matrix linear complementarity problems
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Error bounds for linear complementarity problems for \(B\)-matrices
- Error bounds for linear complementarity problems for \(SB\)-matrices
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- Error bounds for linear complementarity problems of Nekrasov matrices
- Error bounds for linear complementarity problems of \(DB\)-matrices
- Error bounds for monotone linear complementarity problems
- Error bounds for nondegenerate monotone linear complementarity problems
- Error bounds for the linear complementarity problem with a P-matrix
- Error bounds for the linear complementarity problem with a \(\Sigma \)-SDD matrix
- Error bounds in mathematical programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- General variational inequalities
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- Inexact Newton methods for the nonlinear complementarity problem
- New Error Bounds for the Linear Complementarity Problem
- New error bounds for the linear complementarity problem with an \(SB\)-matrix
- New improved error bounds for the linear complementarity problem
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the resolution of the generalized nonlinear complementarity problem
- Some new error bounds for linear complementarity problems of H-matrices
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)
