Results 251 to 260 of about 7,878,130 (281)

Backward errors of the linear complementarity problem

Numerical Algorithms, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xian-Ping Wu, Ri-Huan Ke
openaire   +2 more sources

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

Newton's method for linear complementarity problems

Mathematical Programming, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

NP-Completeness of the linear complementarity problem

Journal of Optimization Theory and Applications, 1989
We consider the linear complementarity problem (q,M) for which the data is the integer column vector \(q\in R^ n\) and the integer square matrix M of order n. GLCP is the decision problem: Does (q,M) have a solution? We show that GLCP is NP-complete in the strong sense.
openaire   +1 more source

A note on an open problem in linear complementarity

Mathematical Programming, 1977
LetK be the class ofn × n matricesM such that for everyn-vectorq for which the linear complementarity problem (q, M) is feasible, then the problem (q, M) has a solution. Recently, a characterization ofK has been obtained by Mangasarian [5] in his study of solving linear complementarity problems as linear programs.
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

Standard embedding for linear complementarity problems

Kybernetika, 2004
Summary: We propose a modified standard embedding for solving the linear complementarity problem (LCP). This embedding is a special one-parametric optimization problem \(P(t)\), \(t\in [0,1]\). Under the conditions (A3) the Mangasarian-Fromovitz constraint qualification is satisfied for the feasible set \(M(t)\) depending on the parameter \(t\), (A4) \(
Sira Allende Allonso, Jürgen Guddat, Dieter Nowack   +2 more
openaire   +2 more sources

The Linear Complementarity Problem

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

New Convergence Results of the Modulus-Based Methods for Vertical Linear Complementarity Problems

Applied Mathematics Letters, 2023
Hua Zheng, Xiaofei Peng
exaly  

Characterization of Linear Complementarity Problems as Linear Programs

Mathematical Programming, 1978
O L Mangasarian
exaly