中文说明：基于线性规划的凸优化求解L1范数问题，获得稀疏解。包含几种求解方法，适用于不同类型。算法简单明了，便于理解，是一套很实用的求解工具箱。
English Description：
Convex optimization based on linear programming to solve the problem of L1 norm, a sparse solution Contains several solving methods, suitable for different types of algorithm is simple and clear, easy to understand, is a very practical solution toolkit