### Abstract

Original language | English |
---|---|

Pages (from-to) | 317-325 |

Journal | Mathematical Programming |

Volume | 118 |

Issue number | 2 |

Publication status | Published - 2009 |

### Fingerprint

### Cite this

*Mathematical Programming*,

*118*(2), 317-325.

}

*Mathematical Programming*, vol. 118, no. 2, pp. 317-325.

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

Research output: Contribution to journal › Article › Scientific › peer-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 -