S. Belongie, J. Malik, and J. Puzicha, Shape matching and object recognition using shape contexts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.24, issue.4, pp.509-522, 2002.
DOI : 10.1109/34.993558

D. P. Bertsekas, Nonlinear programming, Athena scientific Belmont, 1999.

S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Foundations and Trends?? in Machine Learning, vol.3, issue.1, pp.1-122, 2011.
DOI : 10.1561/2200000016

S. Boyd, L. Xiao, A. Mutapcic, and J. Mattingley, Notes on decomposition methods. Notes for EE364B, pp.1-36, 2007.

R. E. Burkard, E. Cela, P. M. Pardalos, and L. S. Pitsoulis, The quadratic assignment problem, Handbook of combinatorial optimization, pp.1713-1809, 1998.

M. Cho, J. Lee, and K. M. Lee, Reweighted Random Walks for Graph Matching, Computer Vision?ECCV 2010, pp.492-505, 2010.
DOI : 10.1007/978-3-642-15555-0_36

M. Cho, J. Sun, O. Duchenne, and J. Ponce, Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers, 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp.2083-2090, 2014.
DOI : 10.1109/CVPR.2014.268

URL : https://hal.archives-ouvertes.fr/hal-01053675

L. Condat, Fast projection onto the simplex and the 1 ball, Mathematical Programming, pp.1-11, 2014.
DOI : 10.1007/s10107-015-0946-6

URL : https://hal.archives-ouvertes.fr/hal-01056171

T. Cour, P. Srinivasan, and J. Shi, Balanced graph matching, Advances in Neural Information Processing Systems, vol.19, p.313, 2007.

G. B. Dantzig and P. Wolfe, Decomposition Principle for Linear Programs, Operations Research, vol.8, issue.1, pp.101-111, 1960.
DOI : 10.1287/opre.8.1.101

O. Duchenne, F. Bach, I. Kweon, and J. Ponce, A Tensor-Based Algorithm for High-Order Graph Matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.12, pp.2383-2395, 2011.
DOI : 10.1109/TPAMI.2011.110

URL : https://hal.archives-ouvertes.fr/hal-01063322

O. Duchenne, A. Joulin, and J. Ponce, A graph-matching kernel for object categorization, 2011 International Conference on Computer Vision, pp.1792-1799, 2011.
DOI : 10.1109/ICCV.2011.6126445

URL : https://hal.archives-ouvertes.fr/hal-00650345

S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.18, issue.4, pp.377-388, 1996.
DOI : 10.1109/34.491619

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. Kolmogorov and R. Zabih, Computing visual correspondence with occlusions using graph cuts, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, pp.508-515, 2001.
DOI : 10.1109/ICCV.2001.937668

URL : http://ce.sharif.edu/~elno/disparitymap/Papers/KZ-ICCV01.pdf

N. Komodakis and N. Paragios, Beyond pairwise energies: Efficient optimization for higher-order MRFs, 2009 IEEE Conference on Computer Vision and Pattern Recognition, pp.2985-2992, 2009.
DOI : 10.1109/CVPR.2009.5206846

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

N. Komodakis, N. Paragios, and G. Tziritas, MRF Energy Minimization and Beyond via Dual Decomposition, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.3, pp.531-552, 2011.
DOI : 10.1109/TPAMI.2010.108

URL : https://hal.archives-ouvertes.fr/hal-00856311

T. C. Koopmans, M. Beckmann, and H. W. Kuhn, Assignment problems and the location of economic activities The hungarian method for the assignment problem, Econometrica: journal of the Econometric Society Naval research logistics quarterly, vol.2, issue.12, pp.53-7683, 1955.

E. L. Lawler, The Quadratic Assignment Problem, Management Science, vol.9, issue.4, pp.586-599, 1963.
DOI : 10.1287/mnsc.9.4.586

D. K. Lê-huu, Dual decomposition with accelerated firstorder scheme for discrete markov random field optimization, 2014.

J. Lee, M. Cho, and K. M. Lee, Hyper-graph matching via reweighted random walks, CVPR 2011, pp.1633-1640, 2011.
DOI : 10.1109/CVPR.2011.5995387

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Leordeanu and M. Hebert, A spectral technique for correspondence problems using pairwise constraints, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1, pp.1482-1489, 2005.
DOI : 10.1109/ICCV.2005.20

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Leordeanu, M. Hebert, and R. Sukthankar, An integer projected fixed point method for graph matching and map inference, Advances in neural information processing systems, pp.1114-1122, 2009.

M. Leordeanu, R. Sukthankar, and M. Hebert, Unsupervised Learning for Graph Matching, International Journal of Computer Vision, vol.31, issue.12, pp.28-45, 2012.
DOI : 10.1109/TPAMI.2008.245

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. F. Martins, M. A. Figueiredo, P. M. Aguiar, N. A. Smith, and E. P. Xing, Ad 3: Alternating directions dual decomposition for map inference in graphical models, The Journal of Machine Learning Research, vol.16, issue.1, pp.495-545, 2015.

Q. Nguyen, A. Gautier, and M. Hein, A flexible tensor block coordinate ascent scheme for hypergraph matching, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp.5270-5278, 2015.

S. Sahni and T. Gonzalez, P-Complete Approximation Problems, Journal of the ACM, vol.23, issue.3, pp.555-565, 1976.
DOI : 10.1145/321958.321975

L. Torresani, V. Kolmogorov, and C. Rother, A dual decomposition approach to feature correspondence. Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol.35, issue.2, pp.259-271, 2013.
DOI : 10.1109/tpami.2012.105

M. Zaslavskiy, F. Bach, and J. Vert, A Path Following Algorithm for the Graph Matching Problem, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, pp.312227-2242, 2009.
DOI : 10.1109/TPAMI.2008.245

URL : https://hal.archives-ouvertes.fr/hal-00232851

R. Zass and A. Shashua, Probabilistic graph and hypergraph matching, 2008 IEEE Conference on Computer Vision and Pattern Recognition, pp.1-8, 2008.
DOI : 10.1109/CVPR.2008.4587500

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

Y. Zeng, C. Wang, Y. Wang, X. Gu, D. Samaras et al., Dense non-rigid surface registration using high-order graph matching, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.382-389, 2010.
DOI : 10.1109/CVPR.2010.5540189

URL : https://hal.archives-ouvertes.fr/hal-00856064

F. Zhou and F. De-la-torre, Factorized Graph Matching, Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on, pp.127-134, 2012.
DOI : 10.1109/TPAMI.2015.2501802