Interval Algorithm for a Class of Unconstrained Discrete Minimax Problems
Li Su · Journal of China University of Mining and Technology · 2002
In this paper, an interval algorithm for a class of unconstrained discrete minimax problems was described, in which the objective functions are in C 2 . By setting up an interval extension of maximal function and introducing the concave convex region deletion test rule and the interval Newton iterative method into this nondifferentiable optimization, an interval algorithm was established. The relevant properties were proven. The minimax value and the localization of the minimax points of the problem can be provided by this method. This method is proven to be reliable and efficient with numerical results.