二次半定规划的非线性规划算法源代码，比内点算法快很多。-Based on the change of　, an augmented lagrangian algorithm to solve convex quadratic SDP is proposed. The algorithm’s distinguishing feature is a factorization, the gradient method and an exact linesearch procedure. The convergence of the algorithm is shown. Numerical experiments show that our methods are efficient and robust.