arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.01031math.OC
收藏

数独问题中L0和L1极小化的等价性

Equivalence of L0 and L1 Minimizations in Sudoku Problem

Linyuan Wang, Wenkun Zhang, Bin Yan, Ailong Cai

摘要:

数独谜题可以用一个稀疏的线性系方程来表示和求解。该问题是压缩感知理论研究的一个非常有用的例子。在这项研究中,数独问题的L0和L1最小化的等价性进行了分析。特别是,17线索(最小的线索数)唯一可完成的问题与稀疏优化算法进行了研究,并分为两种类型,即,第一和第二类问题。第一类问题的L1极小化解是唯一的,稀疏优化算法可以精确求解所有的第一类问题。相比之下,L1最小化的解决方案是不唯一的类型II的问题,算法的结果是不正确的所有这些问题。检查所有II型谜题的每个空单元格。结果表明,一些细胞可以改变L0和L1最小化的等价性。这些结果有助于研究CS中L0和L1模极小化的等价性。

英文摘要:

Sudoku puzzles can be formulated and solved as a sparse linear system of equations. This problem is a very useful example for the Compressive Sensing (CS) theoretical study. In this study, the equivalence of Sudoku puzzles L0 and L1 minimizations is analyzed. In particular, 17-clue (smallest number of clues) uniquely completable puzzles with sparse optimization algorithms are studied and divided into two types, namely, type-I and -II puzzles. The solution of L1 minimization for the type-I puzzles is unique, and the sparse optimization algorithms can solve all of them exactly. By contrast, the solution of L1 minimization is not unique for the type-II puzzles, and the results of algorithms are incorrect for all these puzzles. Each empty cell for all type-II puzzles is examined. Results show that some cells can change the equivalence of L0 and L1 minimizations. These results may be helpful for the study of equivalence of L0 and L1 norm minimization in CS.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑