Cao, Dexin; Li, Subei; Wu, Yanqiang; Zhang, Hongbin Interval method for global solutions of continuous minimax problem. (Chinese. English summary) Zbl 1025.65032 Numer. Math., Nanjing 24, No. 4, 359-365 (2002). The authors propose an interval method for solving global solutions of continuous minimax problems in which the objective functions are Lipschitz continuous. The convergence of the method is established, and some numerical results are presented. Reviewer: Hang Tong Lau (St.Laurent/Quebec) Cited in 2 Documents MSC: 65K05 Numerical mathematical programming methods 90C30 Nonlinear programming 65G30 Interval and finite arithmetic Keywords:interval algorithm; continuous minimax problem; Lipschitz continuous function; convergence; numerical results PDFBibTeX XMLCite \textit{D. Cao} et al., Numer. Math., Nanjing 24, No. 4, 359--365 (2002; Zbl 1025.65032)