BP

代码说明：

说明：  除匹配追踪类贪婪迭代算法之外，压缩感知重构算法另一大类就是凸优化算法或最优化逼近方法，这类方法通过将非凸问题转化为凸问题求解找到信号的逼近，其中最常用的方法就是基追踪(Basis Pursuit, BP)，该方法提出使用l1范数替代l0范数来解决最优化问题，以便使用线性规划方法来求解(In addition to match-tracking greedy iterative algorithms, another major category of compressed-perceptual reconstruction algorithms is the convex optimization algorithm or the optimization approximation method. This type of method finds the signal approximation by converting the nonconvex problem into a convex problem. The method is base tracking (Basis Pursuit, BP). This method proposes to use the l1 norm instead of the l0 norm to solve the optimization problem in order to use the linear programming method to solve the problem)

文件列表：

BP\BP.docx, 731198 , 2018-02-01
BP\BP_linprog.m, 907 , 2018-02-01
BP\singletest.m, 736 , 2018-02-01
BP, 0 , 2018-03-02