Results 221 to 230 of about 91,873 (257)

Rapid Assessment of Chemical Complementarity of Ligands for Protein Design

Woolfson D, Petrenas R, Ożga K, Chubb J, Romanyuk A, McManus J, Leggett G, Scrutton N, Oliver T.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Linear complementarity problems and bi-linear games

Applications of Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sengodan, Gokulraj, Arumugasamy, Chandrashekaran   +1 more
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., Schumacher, J.M., Weiland, S.   +2 more
openaire   +3 more sources

Generalized linear complementarity problems

Mathematical Programming, 1990
The generalization is twofold. First, the problem is defined for closed convex cones rather than for the non-negative orthant. Second, some, but not all, the results are stated for infinite-dimensional real Hilbert spaces. Two infinite-dimensional existence results are given.
Gowda, M. Seetharama, Seidman, Thomas I.
openaire   +2 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

Linearized Methods for Tensor Complementarity Problems

Journal of Optimization Theory and Applications, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Bo Guan, Dong-Hui Li
openaire   +2 more sources

On the Linear Complementarity Problem

Management Science, 1975
Consider the linear complementarity problem given in the system: [Formula: see text] where, W, Z and q are vectors of dimension n. M is a matrix of order n × n and ZT is the transpose of Z. Any (Z, W) satisfying (1), (2), and (3) is a complementary feasible solution to system (I).
openaire   +2 more sources

Continuous linear complementarity problem

Journal of Optimization Theory and Applications, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anderson, E. J., Aramendia, M.
openaire   +2 more sources