Open AccessBook
Linear complementarity, linear and nonlinear programming
Reads0
Chats0
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
Book ChapterDOI
Piecewise Affine Functions
TL;DR: This chapter begins with a review of some results from polyhedral theory, a subject which provides us with the necessary combinatorial tools for the analysis of piecewise affine functions.
More on Modulus Based Iterative Method for Solving Implicit Complementarity Problem
TL;DR: In this paper , a modulus-based iterative method was proposed to solve the large and sparse implicit complementarity problem (ICP) by using two positive diagonal matrices, which is equivalent to an ICP and based on a fixed-point equation.
Proceedings ArticleDOI
Games on Networks with Community Structure: Existence, Uniqueness and Stability of Equilibria
TL;DR: It is shown that the uniqueness and stability of Nash equilibria are related to matrices which are potentially much lower in dimension, on the order of the number of communities, compared to same-size networks without a multipartite structure, in which case such matrices have a dimension the size of the network.
Book ChapterDOI
On the Solution of the Monotone and Nonmonotone Linear Complementarity Problem by an Infeasible Interior-Point Algorithm
J. Júdice,L. Fernandes,A. Lima +2 more
TL;DR: The use of an Infeasible Interior-Point (IIP) algorithm for the solution of the Linear Complementarity Problem (LCP) is investigated and it is found that the algorithm GIIP has succeeded in a large number of these problems than the method SIPP.
Journal ArticleDOI
Nonsmooth computational mechanics algorithms, quasidifferentiability and related topics
TL;DR: The use of quasidifferentiable and codifferentiable optimization techniques is proposed for the solution of the more general class of nonconvex, possibly nonsmooth problems.