论文信息 - Interval method for global solutions of a class of min-max-min problems

Interval method for global solutions of a class of min-max-min problems

Abstract An interval method for a class of min–max–min problems is described in this paper, in which the objective functions are Lipschitz continuous. The convergence of algorithm is proved, numerical results from a Turbo B implementation of the algorithm are presented. The method can get both the optimal value and all global solutions of min–max–min problem. Theoretical analysis and numerical tests indicate the algorithm is stable and reliable.

[1] Y. Zhu,et al. An interval version of Shubert's iterative method for the localization of the global maximum , 2005, Computing.

[2] A. Neumaier,et al. Solving minimax problems by interval methods , 1990 .

[4] Sun Jing. An Interval Algorithm for a Constrained Discrete Minimax Problem , 2003 .

[5] Johannes O. Royset,et al. Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques , 2003 .

[6] Michael A. Wolfe. On Discrete Minimax Problems in R Using Interval Arithmetic , 1999, Reliab. Comput..

[7] Yu Bo,et al. Aggregate Homotopy Method for Sequential Max-Min Problems , 2003 .

[8] Asai Asaithambi,et al. On computing the range of values , 2005, Computing.

[9] M. A. Wolfe,et al. Interval methods for global optimization , 1996 .

[10] G. Alefeld,et al. Introduction to Interval Computation , 1983 .

[11] Ronald R. Willis,et al. New Computer Methods for Global Optimization , 1990 .

[12] G. Alefeld,et al. Interval analysis: theory and applications , 2000 .

[13] Elijah Polak. Smoothing Techniques for the Solution of Finite and Semi-Infinite Min-Max-Min Problems , 2003 .

[14] B. Shubert. A Sequential Method Seeking the Global Maximum of a Function , 1972 .

[15] Ramon E. Moore. Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.

[16] Shen Zuhe,et al. An interval maximum entropy method for a discrete minimax problem , 1997 .