Results 231 to 240 of about 192,429 (283)

Generalized complementarity problem

Journal of Optimization Theory and Applications, 1971
A general complementarity problem with respect to a convex cone and its polar in a locally convex, vector-topological space is defined. It is observed that, in this general setting, the problem is equivalent to a variational inequality over a convex cone. An existence theorem is established for this general case, from which several of the known results
openaire   +4 more sources

The complementarity problem

Cybernetics, 1989
Summary: The nonlinear complementarity problem is considered and its close connection with the linear problem of moments is established. New existence conditions are derived in this framework. An algorithm for the solution of the nonlinear complementarity problem is proposed and some convergence propositions are proved.
Pshenichnyj, B. N., Sosnovskij, A. A.
openaire   +2 more sources

Complementarity problems in linear complementarity systems

Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207), 1998
Complementarity systems are described by differential and algebraic equations and inequalities similar to those appearing in the linear complementarity problem (LCP) of mathematical programming. Typical examples of such systems include mechanical systems subject to unilateral constraints, electrical networks with diodes, processes subject to relays and/
Heemels, W.P.M.H.   +2 more
openaire   +3 more sources

Generalized Linear Complementarity Problems

Mathematics of Operations Research, 1995
We introduce the concept of the generalized (monotone) linear complementarity problem (GLCP) in order to unify LP, convex QP, monotone LCP, and mixed monotone LCP. We establish the basic properties of GLCP and develop canonical forms for its representation. We show that the GLCP reduces to a monotone LCP in the same variables.
openaire   +2 more sources

The Linear Complementarity Problem

Management Science, 1971
This study centers on the task of efficiently finding a solution of the linear complementarity problem: Ix − My = q, x ≥ 0, y ≥ 0, x ⊥ y. The main results are: (1) It is shown that Lemke's algorithm will solve (or show no solution exists) the problem for M ∈ L where L is a class of matrices, which properly includes (i) certain copositive matrices, (ii)
openaire   +2 more sources

Nonlinear complementarity problem

Optimization, 1992
In suggested paper the nonlinear complementarity problem (CP) is considered with relatively new position. Given the continuous mappings of real n-space into itself, find a vector such that g(x) ⩾0f(x) ⩾0g(x)T f(x)=0. The relationship of the CP with the linear problem of the moments is investigated.
B.N. Pshenichnyi, A.A. Sosnovsky
openaire   +1 more source

Tensor Z-eigenvalue complementarity problems

Computational Optimization and Applications, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Home - About - Disclaimer - Privacy