Standard

Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex. / Shmyrev, Vadim I.

In: CEUR Workshop Proceedings, Vol. 1987, 2017, p. 511-516.

Research output: Contribution to journal › Article › peer-review

Harvard

Shmyrev, VI 2017, 'Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex', CEUR Workshop Proceedings, vol. 1987, pp. 511-516.

APA

Shmyrev, V. I. (2017). Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex. CEUR Workshop Proceedings, 1987, 511-516.

Vancouver

Shmyrev VI. Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex. CEUR Workshop Proceedings. 2017;1987:511-516.

Author

Shmyrev, Vadim I. / Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex. In: CEUR Workshop Proceedings. 2017 ; Vol. 1987. pp. 511-516.

BibTeX

@article{7b9116e52a824ca0a89609a4bcfd91e7,
title = "Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex",
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.",
author = "Shmyrev, {Vadim I.}",
year = "2017",
language = "English",
volume = "1987",
pages = "511--516",
journal = "CEUR Workshop Proceedings",
issn = "1613-0073",
publisher = "CEUR-WS",

}

RIS

TY - JOUR

T1 - Polyhedral complementarity and fixed points problem of decreasing regular mappings on simplex

AU - Shmyrev, Vadim I.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85036660559&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85036660559

VL - 1987

SP - 511

EP - 516

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

SN - 1613-0073

ER -

ID: 9671360