Results 31 to 40 of about 150,702 (264)
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
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
LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
Summary: A combinatorial abstraction of the linear complementarity theory in the setting of oriented matroids was first considered by \textit{M. J. Todd} [SIAM J. Algebraic Discrete Methods 5, 467-485 (1984; Zbl 0556.05016)]. We take a fresh look at this abstraction, and attempt to give a simple treatment of the combinatorial theory of linear ...
Fukuda, Komei, Terlaky, Tamás
openaire +2 more sources
Linear complementarity problems solvable as linear programs
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
Quitting Games and Linear Complementarity Problems [PDF]
We prove that every multiplayer quitting game admits a sunspot ε-equilibrium for every ε>0, that is, an ε-equilibrium in an extended game in which the players observe a public signal at every stage. We also prove that, if a certain matrix that is derived from the payoffs in the game is not a Q-matrix in the sense of linear complementarity problems,
Solan, Eilon, Solan, Omri N.
openaire +2 more sources
Novel Global Harmony Search Algorithm for General Linear Complementarity Problem
Linear complementarity problem (LCP) is studied. After reforming general LCP as the system of nonlinear equations by NCP-function, LCP is equivalent to solving an unconstrained optimization model, which can be solved by a recently proposed algorithm ...
Longquan Yong
doaj +1 more source
Strong Stationarity Conditions for Optimal Control of Hybrid Systems
We present necessary and sufficient optimality conditions for finite time optimal control problems for a class of hybrid systems described by linear complementarity models.
Goulart, Paul +2 more
core +1 more source
New error bound for linear complementarity problem of S-SDDS-B matrices
S-SDDS-B matrices is a subclass of P-matrices which contains B-matrices. New error bound of the linear complementarity problem for S-SDDS-B matrices is presented, which improves the corresponding result in [1].
Lanlan Liu , Pan Han, Feng Wang
doaj +1 more source
In this paper, we present a predictor-corrector interior-point algorithm for $ P_{*}(\kappa) $-weighted linear complementarity problems. Based on the kernel function $ \varphi(t) = \sqrt{t} $, the search direction of the algorithm is obtained.
Lu Zhang +3 more
doaj +1 more source

