新版的求解L1范数最小化问题的凸优化工具包-new version for solve L1-norm minimization problem of convex optimization

使用DC算法求解非凸函数的最优化问题。可以确保局部最优解，有时收敛到全局最优-DC algorithm using optimization problem of non-convex function. Ensure local optima, sometimes converge to the global optimum

俞立老师书本例题的仿真程序，凸优化，最优解，可行性等问题。对线性不等式的编程有很好的参考性-Yu Li, teacher simulation of the book program, convex optimization, the optimal solution, feasibility and other issues. The programming of linear inequalities has a good reference