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
Improved convergence theorems of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems
Hua Zheng,Seakweng Vong +1 more
TL;DR: The convergence conditions of the two-step modulus-based matrix splitting and synchronous multisplitting iteration methods for solving linear complementarity problems of H-matrices are weakened and the convergence domain given by the proposed theorems is larger than the existing ones.
Journal ArticleDOI
Time finite element based Moreau‐type integrators
TL;DR: In this article, a variational framework for describing the dynamics of finite dimensional mechanical systems which contain frictional contact interactions is proposed, where the constitutive laws for the impulsive and non-impulsive contact forces are treated on velocity-level by using a discrete contact law for percussion increments in the sense of Moreau.
Journal ArticleDOI
Provision of Public Goods on Networks: On Existence, Uniqueness, and Centralities
Parinaz Naghizadeh,Mingyan Liu +1 more
TL;DR: This work provides a graph-theoretical interpretation of agents’ efforts at the Nash equilibrium, as well as the Pareto efficient outcomes and semi-cooperative equilibria, by linking an agent's decision to her centrality in the interaction network.
Journal ArticleDOI
Iterative methods for linear complementarity problems with interval data
Götz Alefeld,U. Schäfer +1 more
TL;DR: This paper considers modifications of those methods, which under certain assumptions on the starting vector deliver nested sequences converging to [x*], and shows, that [ x*] is optimal in a precisely defined sense.
Journal ArticleDOI
A two-phase algorithm for the multiparametric linear complementarity problem
TL;DR: A new two-phase method for solving the multi-parametric linear complementarity problem (mpLCP) with sufficient matrices is presented and the worst-case complexity of the presented algorithms matches that ofCurrent methods for nondegenerate problems and is lower than that of current methods for degenerate problems.