JM Peng, Z Lin - Mathematical Programming, 1999 - Springer
In this paper, we propose a non-interior continuation method for solving generalized linear complementarity problems (GLCP) introduced by Cottle and Dantzig. The method is based …
HD Qi, LZ Liao - SIAM Journal on Matrix Analysis and Applications, 1999 - SIAM
In this paper, we reformulate the extended vertical linear complementarity problem (EVLCP (m, q)) as a nonsmooth equation H (t, x)= 0, where H:\smallBbbR^n+1→\smallBbbR^n+1 …
SL Wu, W Li, HH Wang - Journal of the Operations Research Society of …, 2024 - Springer
In this paper, we discuss the perturbation analysis of the extended vertical linear complementarity problem (EVLCP). Under the assumption of the row W-property, we derive …
CX Li, SL Wu - Journal of Global Optimization, 2024 - Springer
In this paper, we further study the projected-type method for the extended vertical linear complementarity problem. By making use of some basic absolute value inequalities, some …
SR Mohan, SK Neogy, R Sridhar - Mathematical Programming, 1996 - Springer
Given a vertical block matrix A, we consider in this paper the generalized linear complementarity problem VLCP (q, A) introduced by Cottle and Dantzig. We formulate this …
Q Jia, ZH Huang, Y Wang - Journal of Optimization Theory and …, 2024 - Springer
This paper generalizes the multilinear game where the payoff tensor of each player is fixed to the generalized multilinear game where the payoff tensor of each player is selected from a …
D Yu, Y Yuan, Y Zhang, P Bao - Journal of Computational and Applied …, 2024 - Elsevier
The vertical linear complementarity problem (VLCP) with an arbitrary number l of matrices is related to many practical problems, of which the state-of-the-art modulus-based matrix …
B Hou, J Zhang, C Qiu - AIMS Mathematics, 2022 - aimspress.com
In this paper, an efficient artificial neural network is proposed for solving a generalized vertical complementarity problem. Based on the properties of log-exponential function, the …
C Zhang, X Chen, N Xiu - Computational Optimization and Applications, 2009 - Springer
A new necessary and sufficient condition for the row W-property is given. By using this new condition and a special row rearrangement, we provide two global error bounds for the …