A constructive proof of Ky Fan's coincidence theorem

A.J.J. Talman, Z.F. Yang

Research output: Contribution to journalArticleScientificpeer-review

288 Downloads (Pure)

Abstract

We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point.
Original languageEnglish
Pages (from-to)317-325
JournalMathematical Programming
Volume118
Issue number2
Publication statusPublished - 2009

Fingerprint

Coincidence Theorem
Coincidence Point
Fans
Simplicial Algorithm
Converge
Mesh
Zero
Approximation

Cite this

Talman, A.J.J. ; Yang, Z.F. / A constructive proof of Ky Fan's coincidence theorem. In: Mathematical Programming. 2009 ; Vol. 118, No. 2. pp. 317-325.
@article{9f92e51a42294bbe9a755dc61c0ce1e4,
title = "A constructive proof of Ky Fan's coincidence theorem",
abstract = "We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point.",
author = "A.J.J. Talman and Z.F. Yang",
note = "Appeared earlier as CentER DP 2004-100 (rt)",
year = "2009",
language = "English",
volume = "118",
pages = "317--325",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer",
number = "2",

}

A constructive proof of Ky Fan's coincidence theorem. / Talman, A.J.J.; Yang, Z.F.

In: Mathematical Programming, Vol. 118, No. 2, 2009, p. 317-325.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - A constructive proof of Ky Fan's coincidence theorem

AU - Talman, A.J.J.

AU - Yang, Z.F.

N1 - Appeared earlier as CentER DP 2004-100 (rt)

PY - 2009

Y1 - 2009

N2 - We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point.

AB - We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point.

M3 - Article

VL - 118

SP - 317

EP - 325

JO - Mathematical Programming

JF - Mathematical Programming

SN - 0025-5610

IS - 2

ER -