一类半无穷优化问题的求解方法

作     者：孟香惠 李木桂 胡新生 周济 施保昌 Meng Xianghui (Shenzhen Radio and TV University ) Li Mugui (Guangdong Radio and TV University) Hu Xinsheng (Shenzhen Radio and TV University ) Zhou Ji (CAD Center Huazhong Univ. of Sci. & Tech) Shi Baochang (Department of Mathematics, Huazhong Univ. of Sc

作者机构：深圳广播电视大学 广东广播电视大学 华中理工大学CAD中心 华中理工大学数学系 

出 版 物：《数值计算与计算机应用》 (Journal on Numerical Methods and Computer Applications)

年 卷 期：2001年第22卷第2期

页      面：113-122页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

主　　题：半无穷极大极小问题 离散性算法 收敛性 最优解 迭代 优化问题 

摘      要：In this paper we present a class of nondifferentiable optimization problems: seim-infinite minimax problems which arise from engineering design. Two algorithms for solving the problems are constructed by combining the idea of discretion with the method for solving minimax problems, and the convergence of the algorithms is proved under weaker conditions. Numerical tests show that the algorithms are practical and effective.