Results 241 to 250 of about 150,702 (264)

Continuous linear complementarity problem

Journal of Optimization Theory and Applications, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anderson, E. J., Aramendia, M.
openaire   +2 more sources

Linearized Methods for Tensor Complementarity Problems

Journal of Optimization Theory and Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bo Guan, Dong-Hui Li
openaire   +2 more sources

Integral Solutions of Linear Complementarity Problems

Mathematics of Operations Research, 1998
We characterize the class of integral square matrices M having the property that for every integral vector q the linear complementarity problem with data M, q has only integral basic solutions. These matrices, called principally unimodular matrices, are those for which every principal nonsingular submatrix is unimodular. As a consequence, we show that
Cunningham, William H., Geelen, James F.
openaire   +2 more sources

Stochastic $R_0$ Matrix Linear Complementarity Problems

SIAM Journal on Optimization, 2007
The authors consider the expected residual minimization method (ERM) for solving stochastic linear complementarity problems \[ x \geq 0 , ~~ M(\omega) x + q(\omega) \geq 0, ~~ x^T(M(\omega) x + q(\omega)) = 0 . \] This problem is transformed to a minimization problem \(\min G(x) \text{ s.t. } x \geq 0\). The study is based on the concept of stochastic \
Fang, Haitao, Chen, Xiaojun, Fukushima, Masao   +2 more
openaire   +2 more sources

SOLVING STRONGLY MONOTONE LINEAR COMPLEMENTARITY PROBLEMS

International Game Theory Review, 2013
Given a linear transformation L on a finite dimensional real inner product space V to itself and an element q ∈ V we consider the general linear complementarity problem LCP (L, K, q) on a proper cone K ⊆ V. We observe that the iterates generated by any closed algorithmic map will converge to a solution for LCP (L, K, q), whenever L is strongly monotone.
A. CHANDRASHEKARAN, T. PARTHASARATHY, V. VETRIVEL   +2 more
openaire   +2 more sources

The Generalized Order Linear Complementarity Problem

SIAM Journal on Matrix Analysis and Applications, 1994
Summary: The generalized order linear complementarity problem (in the setting of a finite-dimensional vector lattice) is the problem of finding a solution to the piecewise-linear system \[ x\wedge (M_1 x+ q_1)\wedge (M_2 x+ q_2)\wedge\cdots\wedge (M_k x+ q_k)= 0, \] where \(M_i\)'s are linear transformations and \(q_i\)'s are vectors.
Gowda, M. Seetharama, Sznajder, Roman
openaire   +2 more sources

Integer Solution for Linear Complementarity Problem

Mathematics of Operations Research, 1998
We consider the problem of finding an integer solution to a linear complementarity problem. We introduce the class I of matrices for which the corresponding linear complementarity problem has an integer complementary solution for every vector, q, for which it has a solution.
Chandrasekaran, R., Kabadi, S. N., Sridhar, R.   +2 more
openaire   +2 more sources

Sparse Linear Complementarity Problems

2013
In this paper, we study the sparse linear complementarity problem, denoted by k-LCP: the coefficient matrix has at most k nonzero entries per row. It is known that 1-LCP is solvable in linear time, while 3-LCP is strongly NP-hard. We show that 2-LCP is strongly NP-hard, while it can be solved in O(n 3 logn) time if it is sign-balanced, i.e., each row ...
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino   +2 more
openaire   +1 more source

Convexification Techniques for Linear Complementarity Constraints

Journal of Global Optimization, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nguyen, Trang T., Richard, Jean-Philippe P., Tawarmalani, Mohit   +2 more
openaire   +1 more source

Mode Selection in Linear Complementarity Systems

IFAC Proceedings Volumes, 1998
Abstract In this paper, the object of study is the class of 'linear complementarity systems' given by differential equations and inequalities similar as in the Linear Complementarity Problem of mathematical programming. In the description of the evolution of such systems, a key role is played by the set of inequalities that hold with equality.
Heemels, W.P.M.H., Schumacher, J.M., Weiland, S.   +2 more
openaire   +3 more sources