Thumbnail Image
Item

A constructive proof of Ky Fan's coincidence theorem

Talman,A.J.J.
; 
Yang,Z.F.
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.
Description
Appeared earlier as CentER DP 2004-100 (rt)
Date
2009
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
fulltext.pdf
Adobe PDF, 157.27 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Talman, A J J & Yang, Z F 2009, 'A constructive proof of Ky Fan's coincidence theorem', Mathematical Programming, vol. 118, no. 2, pp. 317-325. < http://dx.doi.org/10.1007/s10107-007-0194-5 >
URI
https://hdl.handle.net/20.500.14602/46782
Embedded videos