Results 261 to 270 of about 791,497 (327)

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

Γ-robust linear complementarity problems

Optimization Methods and Software, 2020
Complementarity problems are often used to compute equilibria made up of specifically coordinated solutions of different optimization problems.
Vanessa Krebs, Martin Schmidt
openaire   +1 more source

Equivalence of the Generalized Vertical Block Linear Complementarity Problems and Linear Complementarity Problems

Mediterranean Journal of Mathematics, 2005
In this paper, generalization of a vertical block linear complementarity problem associated with two different types of matrices, one of which is a square matrix and the other is a vertical block matrix, is proposed. The necessary and sufficient conditions for the existence of the solution of the generalized vertical block linear complementarity ...
Bidushi Chakraborty, Sudarshan Nanda, Mahendra Prasad Biswal   +2 more
openaire   +1 more source

A modulus-based formulation for the vertical linear complementarity problem

Numerical Algorithms, 2022
F. Mezzadri
semanticscholar   +1 more source

The Linear Order Complementarity Problem

Mathematics of Operations Research, 1989
The classical complementarity problem in Euclidean space can be viewed alternatively as a variational inequality or as a lattice orthogonality problem. Generalizations of the former have been extensively studied, but infinite-dimensional analogues of the latter have been largely ignored.
J. M. Borwein, M. A. H. Dempster
openaire   +1 more source

On semidefinite linear complementarity problems

Mathematical Programming, 2000
The paper deals with the SemiDefinite Linear Complementarity Problem (SDLCP\((L,S^n_+)\): find a matrix \(X \in S^n_+\) such that \(Y=L(x)+Q \in S^n_+\) and and \(\langle X,Y\rangle=0\), where \(S^n\) (\(S^n_+\)) denote the set of symmetric (positive semidefinite) matrices, \(L: S^n \rightarrow S^n\) is a linear transformation, \(Q \in S^n\) and ...
Gowda, M. Seetharama, Song, Yoon
openaire   +2 more sources

A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem

Journal of Optimization Theory and Applications, 2021
Xiaoni Chi, Guoqiang Wang
semanticscholar   +1 more source

The integer linear complementarity problem

International Journal of Computer Mathematics, 1990
In this paper we consider the case of the linear complementarity problem where all or some of the variables are required to take integer values. We discuss several applications to economic equilibrium problems and polymatrix games. When the integer variables are bounded, then the problem can be solved using an equivalent linear integer formulation. For
Nagurney, Anna, Pardalosa, Panos M
openaire   +1 more source

The Linear Complementarity Problem

1994
This paper discusses a number of observations and conclusions drawn from ongoing research into more efficient algorithms for solving nonconvex linear complementarity problems (LCP). We apply interior point approaches and partitioning techniques to classes of problems that can be solved efficiently.
openaire   +1 more source

On the Parametric Linear Complementarity Problem

Journal of Optimization Theory and Applications, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source