Results 21 to 30 of about 8,709,898 (283)
On independent cliques and linear complementarity problems [PDF]
Submitted to the SIAM Journal on Discrete ...
Karan N. Chadha, Ankur A. Kulkarni
openaire +3 more sources
A note on fixed point method and linear complementarity problem
In this article, we present a general form of the fixed point method for processing the large and sparse linear complementarity problem, as well as a general condition for the method's convergence when the system matrix is a \(P\)-matrix and some ...
Bharat Kumar, Deepmala, Arup K Das
doaj +1 more source
Reducing Horizontal Linear Complementarity Problems [PDF]
Reducing Horizontal Linear Complementarity ...
Todd, M. J., Tutuncu, R. H.
core +6 more sources
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
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 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 Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the classical iterative methods to solve linear systems.
Cuiyu Liu, Chen-liang Li
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
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

