Our recent demonstration that many eukaryotic mRNAs contain sequences complementary to rRNA led to the hypothesis that these sequences might mediate specific interactions between mRNAs and ribosomes and thereby affect translation. In the present experiments, the ability of complementary sequences to bind to rRNA was investigated by using photochemical cross-linking. RNA probes with perfect comp...

In this paper we consider the extended semide nite linear complementarity problem (XSDLCP). We propose merit functions that can constitute minimization problems equivalent to XSDLCP and show some properties of these functions. We also consider the semide nite nonlinear complementarity problem (SDNCP) and give new su cient conditions that guarantee the existence of a solution to SDNCP.

In this paper, we study some basic properties of the monotone semide nite nonlinear complementarity problem (SDCP). We show that the trajectory continuously accumulates into the solution set of the SDCP passing through the set of the infeasible but positive de nite matrices under certain conditions. Especially, for the monotone semide nite linear complementarity problem, the trajectory converge...

This paper proposes a globally convergent predictor-corrector infeasible-interiorpoint algorithm for the monotone semide nite linear complementarity problem using the AlizadehHaeberly-Overton search direction, and shows its quadratic local convergence under the strict complementarity condition.

Techniques for transforming convex quadratic programs (QPs) into monotone linear complementarity problems (LCPs) and vice versa are well known. We describe a class of LCPs for which a reduced QP formulation|one that has fewer constraints than the \stan-dard" QP formulation|is available. We mention several instances of this class, including the known case in which the coeecient matrix in the LCP...

We show that the problem of finding optimal strategies for both players in a simple stochastic game reduces to the generalized linear complementarity problem (GLCP) with a P-matrix, a well-studied problem whose hardness would imply NP = co-NP. This makes the rich GLCP theory and numerous existing algorithms available for simple stochastic games. As a special case, we get a reduction from binary...

The extended linear complementarity problem and linear complementary-slackness systems * B. De Schutter If you want to cite this report, please use the following reference instead: B. De Schutter, " The extended linear complementarity problem and linear complementary-slackness systems, "

In this paper we study a rst-order and a high-order algorithm for solving linear complementarity problems. These algorithms are implicitly associated with a large neighborhood whose size may depend on the dimension of the problems. The complexity of these algorithms depends on the size of the neighborhood. For the rst order algorithm, we achieve the complexity bound which the typical large-step...

In this paper we define the Extended Linear Complementarity Problem (ELCP), an extension of the well-known Linear Complementarity Problem (LCP). We show that the ELCP can be viewed as a kind of unifying framework for the LCP and its various generalizations. We study the general solution set of an ELCP and we develop an algorithm to find all its solutions. We also show that the general ELCP is a...