Results 21 to 30 of about 880,886 (232)
New global error bound for extended linear complementarity problems
For the extended linear complementarity problem (ELCP), by virtue of a new residual function, we establish a new type of global error bound under weaker conditions.
Hongchun Sun, Min Sun, Yiju Wang
doaj +1 more source
Analysis of the implicit Euler time-discretization of passive linear descriptor complementarity systems [PDF]
This article is largely concerned with the time-discretization of descriptor-variable systems coupled to with complementarity constraints. They are named descriptor-variable linear complementarity systems (DVLCS).
Bernard Brogliato, Alexandre Rocca
doaj +1 more source
The Monomial Preconditioned SSOR Method for Linear Complementarity Problem
This paper aims to show that the existing preconditioned symmetric successive over-relaxation (SSOR) approach to solving the linear complementarity problem (LCP) is not valid.
Xinna Mao +3 more
doaj +1 more source
More on hidden Z-matrices and linear complementarity problem
In this article, we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Pták for the linear system in complementarity problem using game theoretic approach.
R. Jana, A. Dutta, A. K. Das
semanticscholar +1 more source
The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M-Matrix
The principal pivoting algorithm is a popular direct algorithm in solving the linear complementarity problem, and its block forms had also been studied by many authors.
Xi-Ming Fang +2 more
doaj +1 more source
The Distributionally Robust Optimization Reformulation for Stochastic Complementarity Problems
We investigate the stochastic linear complementarity problem affinely affected by the uncertain parameters. Assuming that we have only limited information about the uncertain parameters, such as the first two moments or the first two moments as well as ...
Liyan Xu, Bo Yu, Wei Liu
doaj +1 more source
A new search direction of IPM for horizontal linear complementarity problems
This study presents a new search direction for the horizontal linear complementarity problem. A vector-valued function is applied to the system of xy=μe, which defines the central path.
Xiaoyu Gong +4 more
doaj +1 more source
An infeasible interior-point algorithm for solving the $P_*$-matrix linear complementarity problem based on a kernel function with trigonometric barrier term is analyzed.
B. Kheirfam, M. Haghighi
doaj +1 more source
Analysis and Application of A One-Layer Neural Network for Solving Horizontal Linear Complementarity Problems [PDF]
In this paper, we analyze the stability and convergence of a one-layer neural network proposed by Gao and Wang, which is designed to solve a class of horizontal linear complementarity problems. The globally asymptotical stability and globally exponential
Xingbao Gao, Jing Wang
doaj +1 more source
The subject of the study is the contact interaction of deformable elements of linear complementarity problem (LCP). To solve the linear complementarity problem, the Lemke method with the introduction of an increasing parameter of external loading is used.
Alexander N. Popov, Alexander D. Lovtsov
doaj +1 more source

