Results 171 to 180 of about 880,886 (232)

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

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

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 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

Cycling in linear complementarity problems

Mathematical Programming, 1979
A bound for the minimum length of a cycle in Lemke's Algorithm is derived. An example illustrates that this bound is sharp, and that the fewest number of variables is seven.
openaire   +2 more sources

A Fixed Point Iterative Method for Third-order Tensor Linear Complementarity Problems

Journal of Optimization Theory and Applications, 2023
Xuezhong Wang, Ping Wei, Yimin Wei
semanticscholar   +1 more source

Degeneracy in linear complementarity problems: a survey

Annals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources