中文说明：LI范数原点对偶法求解稀疏编码.一种经典的凸优化算法，它可以求解不等式约束条件的最优化形式，其基本思想是利用障碍函数将不等式约束最优化问题转化为等式约束最优化，再利用牛顿法来求解。应用于脑电信号分类中，keyi 实验来比较算法的计算复杂度和分类准确性。
English Description：
Li norm origin dual method for sparse coding is a classical convex optimization algorithm, which can solve the optimal form of inequality constraints. Its basic idea is to transform inequality constrained optimization problem into equality constrained optimization by using obstacle function, and then solve it by Newton method. Keyi experiment is used to compare the computational complexity and classification accuracy of the algorithm.