Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex Full article
Journal |
CEUR Workshop Proceedings
ISSN: 1613-0073 |
||||
---|---|---|---|---|---|
Output data | Year: 2017, Volume: 1987, Pages: 511-516 Pages count : 6 | ||||
Authors |
|
||||
Affiliations |
|
Abstract:
A new development of polyhedral complementarity investigation is presented. This consideration extends the author's original approach to the equilibrium problem in a linear exchange model and its variations. Two polyhedral complexes in duality and a cells correspondence are given. The problem is to find a point of intersection of the cells corresponding each other. This is a natural generalization of linear complementarity problem. Now we study arising point-to-set mappings without the original exchange model. The potentiality for a special class of regular mappings is proved. As a result the fixed point problem of mapping reduces to an optimization problem. Two finite algorithms for this problem are considered.
Cite:
Shmyrev V.I.
Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex
CEUR Workshop Proceedings. 2017. V.1987. P.511-516. Scopus
Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex
CEUR Workshop Proceedings. 2017. V.1987. P.511-516. Scopus
Identifiers:
Scopus: | 2-s2.0-85036660559 |
Citing:
DB | Citing |
---|---|
Scopus | 2 |