| Article ID: | iaor19941955 |
| Country: | Singapore |
| Volume: | 10 |
| Issue: | 1 |
| Start Page Number: | 93 |
| End Page Number: | 108 |
| Publication Date: | May 1993 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Yamamoto Y., Sekitani K., Tamura A. |
The authors consider a class of convex min-max problems including the minimum norm point problem and the minimum covering sphere problem. They generalize Sekitani and Yamamoto’s recursive algorithms for these two problems and show that the unified algorithm is valid for a class of convex min-max problems under two assumptions.