Results 21 to 30 of about 105,781 (281)
Asymptotic Analysis for One-Stage Stochastic Linear Complementarity Problems and Applications
One-stage stochastic linear complementarity problem (SLCP) is a special case of a multi-stage stochastic linear complementarity problem, which has important applications in economic engineering and operations management.
Shuang Lin, Jie Zhang, Chen Qiu
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
Generalized AOR Algorithms for Linear Complementarity Problem
In this paper, we propose a class of generalized accelerated overrelaxation (GAOR) methods, in which one special case reduces to the generalized successive overrelaxation(GSOR) methods, for solving a linear complementarity problem LCP ( M, q ...
Dongjin Yuan, Hui Zhang
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
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
Counting Unique-Sink Orientations [PDF]
Unique-sink orientations (USOs) are an abstract class of orientations of the n-cube graph. We consider some classes of USOs that are of interest in connection with the linear complementarity problem.
Bernd Gärtner +27 more
core +3 more sources
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
Combined approach to solve linear complementarity problem
In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence ...
Kebbiche Zakia, Roumili Hayet
doaj +2 more sources

