Open AccessBook
Linear complementarity, linear and nonlinear programming
About:
The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.read more
Citations
More filters
Journal ArticleDOI
Fast Dating Using Least-Squares Criteria and Algorithms
TL;DR: Very fast dating algorithms, based on a Gaussian model closely related to the Langley–Fitch molecular-clock model, are presented, showing that this model is robust to uncorrelated violations of the molecular clock.
Journal ArticleDOI
On total functions, existence theorems and computational complexity
TL;DR: Nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist form an interesting complexity class between P and NP, which is called TFNP and contains a host of important problems, whose membership in P is currently not known.
Journal ArticleDOI
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
TL;DR: Linear and nonlinear variational inequality problems over a polyhedral convex set are analyzed parametrically and Robinson's notion of strong regularity, as a criterion for the solution set to be a singleton depending Lipschitz continuously on the parameters, is characterized in terms of a new ``critical face'' condition.
Journal ArticleDOI
Efficient Computation of Equilibria for Extensive Two-Person Games
TL;DR: In this paper, a two-person non-zero-sum game with perfect recall is considered, and an equilibrium is found efficiently by Lemke's algorithm, a generalization of the Lemke-Howson method.
Journal ArticleDOI
Modulus‐based matrix splitting iteration methods for linear complementarity problems
TL;DR: Numerical results show that the modulus-based relaxation methods are superior to the projected relaxation methods as well as the modified modulus method in computing efficiency.