搜索资源列表
Desktop
- subgrad_method_lin_feas.m---linear feasibility problem subgrad_method_mtx_complete.m -- positive semidefinite matrix completion subgrad_method_least_l1.m -- least l1-norm minimization subgrad_method_dual_prob.m -- solving dual problem using
m
- 利用cvx解半定规划问题,得到波束成形矩阵。(The semidefinite programming problem is solved by CVX)