| 一类无约束离散Minimax问题的区间调节熵算法 |
| |
| 作者姓名： | LiSubei CaoDexin WangHaijun DengKazhong |
| |
| 作者单位： | [1]XuzhouInstituteofTechnology,Xuzhou221008,China [2]CollegeofSciences,ChinaUnivofMiningandTechnology,Xuzhou221008,China [3]CollegeofEnvironmentandSpatialInformatics,ChinaUniv.ofMiningandTechnology,Xuzhou221008,China |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China(50 1 740 51 ) |
| |
| 摘 要： | In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C^1. The paper deals with this problem by means of taking the place of maximum-entropy function with adjustable entropy function. By constructing an interval extension of adjustable entropy function and some region deletion test rules, a new interval algorithm is presented. The relevant properties are proven, The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum-entropy algorithm. Both theoretical and numerical results show that the method is reliable and efficient.
|
| 关 键 词： | 间隔可调整熵算法 无约束离散极小化极大 目标函数 收敛性 |
| 收稿时间： | 10 March 2003 |
Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems |
| |
| LiSubei CaoDexin WangHaijun DengKazhong.Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems[J].Applied Mathematics A Journal of Chinese Universities,2004,19(1):37-43. |
| |
| Authors: | Li Subei Cao Dexin Wang Haijun Deng Kazhong |
| |
| Institution: | Xuzhou Institute of Technology,Xuzhou 221008,China;College of Sciences,China Univ.of Mining and Technology,Xuzhou 221008,China;College of Sciences,China Univ.of Mining and Technology,Xuzhou 221008,China;College of Environment and Spatial Informatics, China Univ.of Mining and Technology, Xuzhou 221008 ,China |
| |
| Abstract: | In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient. |
| |
| Keywords: | discrete minimax problem adjustable entropy function interval algorithm |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
