A constructive proof of Ky Fan's coincidence theorem

A.J.J. Talman; Z.F. Yang

A constructive proof of Ky Fan's coincidence theorem

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

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

2 Citations (Scopus)

609 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 language	English
Pages (from-to)	317-325
Journal	Mathematical Programming
Volume	118
Issue number	2
Publication status	Published - 2009

Access to Document

Fulltext

http://dx.doi.org/10.1007/s10107-007-0194-5

Cite this

@article{9f92e51a42294bbe9a755dc61c0ce1e4,

title = "A constructive proof of Ky Fan's coincidence theorem",

abstract = "We present a constructive proof for the well-known Ky Fan{\textquoteright}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-Verlag GmbH and Co. KG",

number = "2",

}

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

SN - 0025-5610

VL - 118

SP - 317

EP - 325

JO - Mathematical Programming

JF - Mathematical Programming

IS - 2

ER -

A constructive proof of Ky Fan's coincidence theorem

Abstract

Access to Document

Fingerprint

Cite this