Global error bound estimates algorithm for an \(R_0\)-type generalized LCP over polyhedral cone and its applications

DOI10.1016/J.CAM.2024.116288MaRDI QIDQ6653534

Yiju Wang, Jiakang Du, Hongchun Sun

Publication date: 16 December 2024

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear convergenceglobal error boundGLCP

Mathematics Subject Classification ID

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?)
• Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
• Error bounds for linear complementarity problems for \(SB\)-matrices
• Error bounds for linear complementarity problems involving \(B^S\)-matrices
• Some new error bounds for linear complementarity problems of H-matrices
• Error bounds for linear complementarity problems of Nekrasov matrices
• Error bounds for linear complementarity problems of \(DB\)-matrices
• A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
• 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 linear complementarity problems for \(B\)-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
• General variational inequalities
• New improved error bounds for the linear complementarity problem
• Error bounds in mathematical programming
• Error bounds for the linear complementarity problem with a \(\Sigma \)-SDD matrix
• Computation of error bounds for P-matrix linear complementarity problems
• A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
• New error bounds for the linear complementarity problem with an \(SB\)-matrix
• On the resolution of the generalized nonlinear complementarity problem
• Componentwise error bounds for linear complementarity problems
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• New Error Bounds for the Linear Complementarity Problem
• Error bounds for monotone linear complementarity problems
• Inexact Newton methods for the nonlinear complementarity problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems

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)