1. Liu Hongwei and Liu Sanyang. A counterexample
of the convexity of sums of singular values. SIAM Journal
on Matrix Analysis and Applications. 2000,21(4): 1389-1391.(SCI检索)
2. Liu Hongwei and Liu Sanyang. Negative answer to the conjecture
on the convexity of the greatest eigenvalue. Journal of
Optimization Theory and Applications. 2001,110(3): 677-679(SCI检索).
3. Liu Hongwei, Liu Sanyang and Xu Fengmin. A Tight Semidefinite
Relaxation of the MAX CUT Problem. Journal of Combinatorial
Optimization, 2003,7(3): 237-246. (SCI检,EI检索).
4. Liu Hongwei, Liu Sanyang and Wang Xinhui. The application
of nonlinear programming for detection in CDMA. IEEE Transactions
on Wireless Communications 2004,3(1): 8-11(SCI, EI检索).
5. Liu Hongwei, Wang Xinhui and Liu Sanyang. A feasible direction algorithm for solving SDP relaxation of the quadratic {-1,1} programming. Optimization Methods and Software 2004,19(2):125-136 (SCI, EI检索).
6. Wang Xinhui, Liu Sanyang and Liu Hongwei. A new algorithm
for semidefinite programming.Chinese Num. Math. & Appl.
2003,26(3):22-30.
7. Wang Xinhui, Liu Sanyang and Liu Hongwei. A quadratic programming
for max-cut problem. Or Transaction 2003.7(4):31-37.
8. 王新辉,刘红卫,刘三阳, 半定规划的新算法. 数值计算与计算机应用2003,24(2):81-87.
