一类根式型函数全局优化的符号算法  

Global Optimization of a Class of Radical Functions Using a Symbolic Algorithm

作　　者：徐嘉[1] 

机构地区：[1]中国科学院成都计算机应用研究所,四川成都610041

出　　处：《四川大学学报（工程科学版）》2008年第6期140-143,共4页Journal of Sichuan University (Engineering Science Edition)

基　　金：国家973重点基础研究发展规划资助项目(2004CB318003);中国科学院知识创新工程重要方向项目资助(KJCX-YW-S02)

摘　　要：为了提高形如g=m1u1+m2u2+…+mnun的根式型函数全局优化算法的效率,从根式型函数的有理化入手,讨论了这类根式型函数不等式成立的充要条件。这一充要条件成功地将形如上式的根式型不等式等价转化成了一组有理不等式。将这一条件用于此类根式型函数全局优化的符号算法中,有效地改进了原有的通用算法,从而达到了提高原算法在此类根式型函数上运算效率的目的。The necessary and sufficient condition for a class of inequalities with radical functions like g=m1u1+m2u2+…+mnun was discussed based on the rationalization of radical functions.This condition successfully transformed the inequality with radical functions into a set of rational inequalities.Furthermore,the condition was applied to symbolic algorithm of global optimization of the class of radical functions.Thus,the former universal algorithm was improved so that the new algorithm is much more efficient.

关 键 词：全局优化 符号算法 根式函数 差分代换 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]