求解亚定l_1模极小解的新方法

A NEW METHOD FOR SOLVING l1 NORM MINIMIZATION

提出了解亚定ｌ＿１模极小解的一种直接方法．先建立了亚定ｌ１模方程与一个二次规划的关系，采用消失－雅可比的方法，求解二次规划，而直接得到亚定ｌ１模方程的解．

This paper proposes a direct method for solving l1 problem. The relationshipbetween he l1 problem and a guadratic programming prom is established,and the solutionof l1 problem is directly obtained by solving the quadratic programming problem by usingVanishing-Jacobian method.