Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone

DOI10.1007/s10957-013-0290-zzbMath1288.90112MaRDI QIDQ382913

Hongchun Sun, Y. J. Wang

Publication date: 22 November 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0290-z

zbMATH Keywords

global error bound; reformulation; GLCP

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Related Items

Generalized Tensor Complementarity Problems Over a Polyhedral Cone, A complementarity model and algorithm for multi-commodity flow supply chain network equilibrium with random demands, A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions, New global error bound for extended linear complementarity problems, Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems, Strictly semi-positive tensors and the boundedness of tensor complementarity problems, An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone, Structural properties of tensors and complementarity problems, A complementarity model and algorithm for direct multi-commodity flow supply chain network equilibrium problem, Generalized polynomial complementarity problems over a polyhedral cone, Optimal ordering policy for inventory mechanism with a stochastic short-term price discount, Quadratic optimization over a polyhedral cone

Cites Work

• Unnamed Item
• Unnamed Item
• 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 error bound for the generalized linear complementarity problem over a polyhedral cone
• Error bounds in mathematical programming
• A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
• On the Resolution of the Generalized Nonlinear Complementarity Problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Global projection-type error bounds for general variational inequalities