Results 41 to 50 of about 4,990,685 (299)
Modulus-based matrix splitting methods for horizontal linear complementarity problems
Numerical Algorithms, 2019 In this paper, we extend modulus-based matrix splitting iteration methods to horizontal linear complementarity problems. We consider both standard and accelerated methods and analyze their convergence. In this context, we also generalize existing results
F. Mezzadri, E. Galligani
semanticscholar +1 more source
Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems [PDF]
Mathematical programming, 2017 In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed.
Xiaojun Chen, Hailin Sun, Huifu Xu
semanticscholar +1 more source
A note on fixed point method and linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2023 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
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
Linear complementarity problems solvable as linear programs
Journal of Numerical Analysis and Approximation Theory, 2018 In this paper, we present a theoretical and numerical study of linear complementary problems solvable as linear programs. We give several examples of linear complementarity problems which can be solved as linear programs using linear programming ...
Zakia Kebbiche
doaj +2 more sources
OPTIMIZATION WITH LINEAR COMPLEMENTARITY CONSTRAINTS [PDF]
Pesquisa Operacional, 2014 A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics
openaire +4 more sources
Journal of Mathematics, 2014 We consider a class of absolute-value linear complementarity problems. We propose a new approximation reformulation of absolute value linear complementarity problems by using a nonlinear penalized equation.
Yuan Li, Hai-Shan Han, Dan-Dan Yang
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
Frictional contact problem in building constructions analysis
Magazine of Civil Engineering, 2020 The article discusses the contact interaction of deformable building constructions or their parts. Such interaction is realized for example at: hydraulic structures; suspension pile foundations, girder, raft, sheet piling; friction bearings and kinematic
Aleksandr Popov, Alexander Lovtsov
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