学术
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION
下载全文
[全文大小：164 K]
Mu Xuewen[1] Zhang Yaling[2] Liu Sanyang[1]
[1]Dept. of Appl. Math., Xidian Univ., Xi＇an 710071, China. [2]Dept. of Comput. Sci., Xi＇an Univ. of Science and Technology, Xi＇an 710054, China.
国际标准刊号：ISSN 1005-1031
国内统一刊号：CN 33-1171
文章出处:
《高校应用数学学报：英文版》-2007年22卷4期 -434-440页
Applied Mathematics A Journal of Chinese Universities
分 类 号:
[参考文献]
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION
Abstract:
A successive quadratic programming algorithm for solving SDP relaxation of Max- Bisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equations without using the linear search technique. The numerical experiments show that this algorithm is rather faster than the interior-point method.[著者文摘]
Key words:
semidefinite programming, Max-Bisection , successive quadratic programming.
收稿日期: 2005-05-20
更多评论>>文章评论
更多>>免费文章
cqvip.com