In order to solve the sudoku more efficiently,a novel approach was proposed.We employed the realnumber coding to get rid of the integer constraint,meanwhile used the L0norm to guarantee the sparsity of the solution.Moreover,the L1norm was used to approximate the L0norm on the basis of RIP and KGG condition.Finally,the slack vectors were introduced to transfer the L1norm into a convex linear programming problem,which was solved by the primaldual interior point method.Experiments demonstrate that this algorithm reach 100％ success rate on easy,medium,difficult,and evil levels,and reach 864％ success rate on only 17clue sudokus.Besides,the average computation time is quite short,and has nothing to do with the difficulty of sudoku itself.In all,this algorithm is superior to both constraint programming and Sinkhorn algorithm in terms of success rate and computation time.