Title :
Interval Algorithm for a Class of Continuous Minimax Problems
Author :
Juan Wang ; Dexin Cao
Author_Institution :
Coll. of Sci., China Univ. of Min. & Technol., Xuzhou, China
Abstract :
In this paper, based on D. X. Cao[Numerical Mathematics A Journal of Chinese Universities, 2002, 24(4): 359-365], an interval algorithm is developed for finding all global solutions of the unconstrained continuous minimax problems, in which the objective functions are C1 functions, by structuring the interval extension of the objection function and region deletion test rules, combining bisection rules. The convergence of the algorithm is proved. Numerical results of many typical test functions show that the algorithm is reliable and effective, and the proposed algorithm is better than D. X. Cao´s.
Keywords :
convergence; minimax techniques; C1 function; bisection rule; convergence; interval algorithm; interval extension; objection function; region deletion test rule; unconstrained continuous minimax problem; Algorithm design and analysis; Convergence; Educational institutions; Entropy; Reliability theory; Upper bound;
Conference_Titel :
Computational Intelligence and Software Engineering (CiSE), 2010 International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5391-7
Electronic_ISBN :
978-1-4244-5392-4
DOI :
10.1109/CISE.2010.5677080
