Linear Systems, Sparse Solutions, and Sudoku

IEEE Signal Processing Letters

Volumn 17, Issue 1, 2010, Pages 40-42

  Babu, Prabhu ^a   Pelckmans, Kristiaan ^a   Stoica, Petre ^a   Li, Jian ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

l0 norm minimization; l1 norm minimization; Linear systems; sparse representation; Sudoku

Indexed keywords

EID: 85008033365     PISSN: 10709908     EISSN: 15582361     Source Type: Journal    
DOI: 10.1109/LSP.2009.2032489     Document Type: Article

References (9)

1. Wikipedia, Algorithmics of Sudoku—Wikipedia, The Free Encyclopedia 2009, [Online; accessed 13-May-2009].
2. A. Bartlett and A. Langville, “An integer programming model for the Sudoku problem,” J, Online Math. Applicat., vol. 8, 2008.
3. T. K. Moon, J. H. Gunther, and J. Kupin, “Sinkhorn solves Sudoku,” IEEE Trans. Inform. Theory, vol. 55, no. 4, pp. 1741–1746, Apr. 2009.
4. S. Chen, D. Donoho, and M. Saunders, “Atomic decomposition by basis pursuit,” SIAM Rev., pp. 129–159, 2001.
5. E. Candes, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 489–509, Feb. 2006.
6. Y. Zhang, A Simple Proof for Recoverability of L1-Minimization: Go Over or Under? Rice Univ., Houston, TX, CAAM Tech. Rep. TR05-09, 2005.
7. M. Grant, S. Boyd, and Y. Ye, CVX: Matlab Software for Disciplined Convex Programming [Online]. Available: http://stan-ford.edu/~boyd/cvx
8. M. Huckvale, The Big Book of Su Doku. London, U.K.: Orion, 2005.
9. E. Candès, M. Wakin, and S. Boyd, “Enhancing sparsity by reweighted 11 minimization,” J. Fourier Anal. Applicat, vol. 14, no. 5, pp. 877–905, 2008.