| A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION |
| |
| 引用本文： | References：. A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION[J]. 高校应用数学学报(英文版), 2007, 22(4): 434-440. DOI: 10.1007/s11766-007-0408-x |
| |
| 作者姓名： | References： |
| |
| 作者单位： | 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. |
| |
| 摘 要： | 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.
|
| 关 键 词： | 连续二次规划算法 SDP松弛 最大对分 半肯定规划 |
| 收稿时间： | 2005-05-20 |
| 修稿时间： | 2005-05-20 |
A successive quadratic programming algorithm for SDP relaxation of Max-Bisection |
| |
| Mu Xuewen,Zhang Yaling,Liu Sanyang. A successive quadratic programming algorithm for SDP relaxation of Max-Bisection[J]. Applied Mathematics A Journal of Chinese Universities, 2007, 22(4): 434-440. DOI: 10.1007/s11766-007-0408-x |
| |
| Authors: | Mu Xuewen Zhang Yaling Liu Sanyang |
| |
| Affiliation: | (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 |
| |
| Abstract: | A successive quadratic programming algorithm for solving SDP relaxation of MaxBisection 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. |
| |
| Keywords: | semidefinite programming Max-Bisection successive quadratic programming. |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
