%0 Journal Article
%T Solving complementarity problem based on maximum-entropy harmony search algorithm<br>求解互补问题的极大熵和声搜索算法*
%A YONG Long-quan
%A SUN Pei-min
%A GAO Kaib
%A <br>雍龙泉
%A 孙培民
%A 高凯b
%J 计算机应用研究
%D 2011
%I 
%X Aiming at the difficulty of fact that classical algorithms unable to obtain many solutions to complementarity problem, a new method, referred to as harmony search algorithm was presented. First, complementarity problem is reformulated as a system of nonsmooth equations via an NCP-function, a smoothing approximation to the nonsmooth equations is given by the aggregate function, furthermore, complementarity problem can be transformed into unconstrained optimization, then using the harmony search algorithm to solve this problem. The objective function of the algorithm does not require analytical nature and easy to achieve, numerical results show that the method is effective in solving complementarity problem.
%K harmony search algorithm
%K complementarity problem
%K maximum entropy method
%K NCP function<br>和声搜索算法
%K 互补问题
%K 极大熵方法
%K NCP函数
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5b3ab970f71a803deacdc0559115bfcf0a068cd97dd29835&cid=8240383f08ce46c8b05036380d75b607&jid=a9d9be08cdc44144be8b5685705d3aed&aid=b9fe203c0cfe983c506045a1b5f5e950&yid=9377ed8094509821&vid=d3e34374a0d77d7f&iid=94c357a881dfc066&sid=a84a3ad26ce1d4d2&eid=6c6096522a30d0b8&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=31