Results 21 to 30 of about 10,196 (258)
The Monomial Preconditioned SSOR Method for Linear Complementarity Problem
IEEE Access, 2019 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]
Journal of Nonsmooth Analysis and Optimization, 2022 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
Advances in Mathematical Physics, 2019 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
Abstract and Applied Analysis, 2014 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
Frontiers in Energy Research, 2023 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
Communications in Combinatorics and Optimization, 2018 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]
International Journal of Computational Intelligence Systems, 2014 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
Combined approach to solve linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2016 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
A Preconditioned Multisplitting and Schwarz Method for Linear Complementarity Problem
Journal of Applied Mathematics, 2014 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
Structural Mechanics of Engineering Constructions and Buildings, 2023 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