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 |