中文说明：
凸优化课程原对偶内点法求解二次规划问题。
English Description：
The primal dual interior point method for convex optimization is used to solve quadratic programming problems.
Dual interior point method for quadratic programming
关注次数： 447
下载次数： 4
文件大小： 442KB
中文说明：
凸优化课程原对偶内点法求解二次规划问题。
English Description：
The primal dual interior point method for convex optimization is used to solve quadratic programming problems.
Code
....\A.mat
....\b.mat
....\Demo.m
....\lambda.mat
....\mu.mat
....\P.mat
....\q.mat
....\StepSize.m
....\x_0.mat