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

THE METHOD FOR SOLVING A CLASS OF SEMI-INFINITE PROBLEMS

作　　者：孟香惠[1] 李木桂[2] 胡新生[1] 周济[3] 施保昌[4] 

机构地区：[1]深圳广播电视大学 [2]广东广播电视大学 [3]华中理工大学CAD中心 [4]华中理工大学数学系

出　　处：《数值计算与计算机应用》2001年第2期113-122,共10页Journal on Numerical Methods and Computer Applications

摘　　要：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.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.

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

分 类 号：O224[理学—运筹学与控制论]