%0 Journal Article
%T A Feasible Direction Algorithm for Max Bisection via Low-RankFactorization<br>图的最大二等分问题的低秩可行方向算法
%A Mu Xuewen
%A Liu Hongwei
%A Liu Sanyang
%A <br>穆学文
%A 刘红卫
%A 刘三阳
%J 系统科学与数学
%D 2007
%I 
%X Based on the semidefinite programming relaxation of {\rm max} Bisection, a feasible direction algorithm is given to solve the relaxation. Coupled with the 0.699 randomized method, the approximate solution of {\rm max} Bisection is obtained. Furthermore, its convergent result is given. The numerical experiment shows that the algorithm can solve the {\rm max} Bisection efficiently.
%K Max bisection problem
%K semidefinite programming relaxation
%K feasible direction
%K randomized method<br>图的最大二等分问题
%K 半定规划松弛
%K 可行方向算法
%K 随机扰动.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=2D9EB2234C7550B3564785B575E172D7&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=94C357A881DFC066&sid=5E191A234CD3698F&eid=C8C16F05E379B334&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=12