The problem formulation for Sinkhorn balancing algorithm

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction
1.1 Aim of the Project
1.2 Methodology
1.3 Report Organization
1.4 Related Work
2 Sudoku as a Linear System
2.1 Problem Formulation
3 Algorithms’ Description
3.1 L1-Norm minimization
3.2 Reweighted l1-norm minimization
3.2.1 Algorithm
3.3 SPICE and LIKES
3.3.1 SPICE
3.3.1.1 Problem formulation
3.3.1.2 Algorithm
3.3.2 LIKES
3.3.2.1 Algorithm
3.4 Semi Definite Relaxation
3.5 Iterative Adaptive Approach based on Weighted Least Squares
3.5.1 Data Model
3.5.2 IAA-APES
3.5.2.1 Algorithm
3.6 Sinkhorn Balancing
4 Puzzles
5 Results and Discussions
5.1 Puzzle Set 1
5.2 Puzzle Set 2
5.3 Puzzle Set 3
6 Conclusion and Future Work
7 References
Appendix