Results 251 to 260 of about 3,215,324 (277)
Some of the next articles are maybe not open access.

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

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.
M. Seetharama Gowda, Roman Sznajder
exaly   +4 more sources

A Linear Complementarity Problem with a P-Matrix

SIAM Review, 2004
Summary: We present an application of a linear complementarity problem where \(M\) is a P-matrix but, in general, is neither an H-matrix nor a positive definite matrix. This application occurs originally by \textit{J. Rohn} [Linear Algebra Appl. 126, 39--78 (1989; Zbl 0712.65029)], which is less known to the LCP community. Its focus is in computing the
openaire   +2 more sources

Pivoting in Linear Complementarity

2009
We study the behavior of simple principal pivoting methods for the P-matrix linear complementarity problem (P-LCP). We solve an open problem of Morris by showing that Murty's least-index pivot rule (under any fixed index order) leads to a quadratic number of iterations on Morris's highly cyclic P-LCP examples.
Foniok, Jan   +3 more
openaire   +1 more source

The Linear Complementarity Problem

Journal of the London Mathematical Society, 1970
openaire   +2 more sources

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

Characterization of Linear Complementarity Problems as Linear Programs

Mathematical Programming, 1978
O L Mangasarian
exaly  

A Non-Interior-Point Continuation Method for Linear Complementarity Problems

SIAM Journal on Matrix Analysis and Applications, 1993
Patrick T. Harker, Bintong Chen
exaly  

Note on Error Bounds for Linear Complementarity Problems for B-Matrices

Applied Mathematics Letters, 2016
Chaoqian Li, Yaotang Li
exaly  

Home - About - Disclaimer - Privacy