二次半定规划的非线性规划算法源代码，比内点算法快很多。-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 c

将二次半定规划转化为非线性规划,利用增广拉格朗日算法求解。-solve convex quadratic SDP

SDP is speed dynamic progmam. Normally dynamic program have O(N^2) or (O(N^3), but we can speedly, O(NlogN) or O(N^2 logN).-SDP is speed dynamic progmam. Normally dynamic program have O(N^2) or (O(N^3), but we can speedly, O(NlogN) or O(N^2 logN).

求解SDP(SemiDefinite Programing，半定规划)问题的一个软件。-To solve the SDP (SemiDefinite Programing, SemiDefinite programming) a software problem.