A. , Y. And-kimmel, and R. , Spectral multidimensional scaling, PNAS, vol.110, issue.45, pp.18052-18057, 2013.

A. , Y. Bronstein, A. M. And-kimmel, and R. , Graph matching: relax or not, 2014.

A. , Y. Bronstein, A. And-kimmel, and R. , On convex relaxation of graph isomorphism, Proc. National Academy of Sci, pp.2942-2947, 2015.

A. , H. Bolte, J. Redont, P. And, and A. Soubeyran, Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka- ?ojasiewicz inequality, Math. Oper. Res, vol.35, issue.2, pp.438-457, 2010.

B. , H. And-combettes, and P. , Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2011.

B. , H. H. Combettes, P. L. And-noll, and D. , Joint minimization with alternating Bregman proximity operators, Pacific J. Optim, vol.2, issue.3, pp.401-424, 2006.

B. , J. Carlier, G. Cuturi, M. Nenna, L. And-peyrépeyr´peyré et al., Iterative Bregman projections for regularized transportation problems, SIAM J. Sci. Comp, vol.37, issue.2, pp.1111-1138, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01096124

A. C. Berg, T. L. Berg, and J. And-malik, Shape Matching and Object Recognition Using Low Distortion Correspondences, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05), pp.26-33, 2005.
DOI : 10.1109/CVPR.2005.320

B. , N. Van-de-panne, M. Paris, S. And-heidrich, and W. , Displacement interpolation using Lagrangian mass transport, ACM Trans. Graph, vol.30, issue.158, pp.1-15812, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00763270

B. Bot¸, R. I. Csetnek, E. R. And-l-´-aszl´oaszl´-aszl´o, and S. C. , An inertial forward?backward algorithm for the minimization of the sum of two nonconvex functions, EURO J. Comp. Optim, pp.1-23, 2015.

A. M. Bronstein, M. M. Bronstein, and R. And-kimmel, Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching, Proceedings of the National Academy of Sciences, vol.103, issue.5, pp.1168-1172, 2006.
DOI : 10.1073/pnas.0508601103

A. M. Bronstein, M. M. Bronstein, R. Kimmel, M. Mah-moudi, and G. And-sapiro, A Gromov-Hausdorff framework with diffusion geometry for topologically-robust nonrigid shape matching, pp.2-3, 2010.

A. M. Bronstein, M. M. Bronstein, L. J. Guibas, and M. And-ovsjanikov, Shape google, ACM Transactions on Graphics, vol.30, issue.1, pp.1-120, 2011.
DOI : 10.1145/1899404.1899405

C. , Q. And-koltun, and V. , Robust nonrigid registration by convex optimization, Proc. ICCV, pp.2039-2047, 2015.

C. , Y. Guibas, L. And-huang, and Q. , Near-optimal joint object matching via convex relaxation, Proc. ICML, JMLR Workshop and Conference Proceedings, pp.100-108, 2014.

C. , P. L. And-pesquet, and J. , Proximal splitting methods in signal processing. In Fixed-point algorithms for inverse problems in science and engineering, pp.185-212, 2011.

D. Goes, F. Cohen-steiner, D. Alliez, P. And-desbrun, and M. , An optimal transport approach to robust reconstruction and simplification of 2d shapes, CGF, pp.1593-1602, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00758019

D. Goes, F. Breeden, K. Ostromoukhov, V. And-des-brun, and M. , Blue noise through optimal transport, ACM Transactions on Graphics, vol.31, issue.6, pp.1-17111, 2012.
DOI : 10.1145/2366145.2366190

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

D. Goes, F. Wallez, C. Huang, J. Pavlov, D. And-des-brun et al., Power particles: An incompressible fluid solver based on power diagrams, ACM Trans. Graph, vol.34, issue.50, pp.1-5011, 2015.

F. , O. Diverdi, S. Halber, M. Sizikova, E. And-finkelstein et al., IsoMatch: Creating informative grid layouts, CGF, pp.155-166, 2015.

G. , E. And-goutte, and C. , Relation between pLSA and NMF and implications, Proc. SIGIR, pp.601-602, 2005.

G. , D. Biasotti, S. And-paraboschi, and L. , Shrec: shape retrieval contest: Watertight models track, 2007.

G. , S. And-rangarajan, and A. , A graduated assignment algorithm for graph matching, PAMI, vol.18, issue.4, pp.377-388, 1996.

H. , Q. And-guibas, and L. , Consistent shape maps via semidefinite programming, Proc. SGP, pp.177-186, 2013.

H. , D. And-lange, and K. , Quantile regression via an MM algorithm, J. Comp. and Graphical Stats, vol.9, issue.1, pp.60-77, 2000.

K. , I. Kovalsky, S. Z. Basri, R. And-lipman, and Y. , Tight relaxation of quadratic matching, 2015.

K. , V. G. Lipman, Y. And-funkhouser, and T. , Blended intrinsic maps, ACM Trans. Graph, vol.30, issue.79, pp.1-7912, 2011.

K. , V. G. Li, W. Mitra, N. J. Diverdi, S. And-funkhouser et al., Exploring collections of 3d models using fuzzy correspondences, ACM Trans. Graph, vol.31, issue.54, pp.1-5411, 2012.

L. , G. R. And-sriperumbudur, and B. K. , On the convergence of the concave-convex procedure, Proc. NIPS, pp.1759-1767, 2009.

L. , M. , A. Hebert, and M. , A spectral technique for correspondence problems using pairwise constraints, Proc. ICCV, pp.1482-1489, 2005.

L. , E. M. De-abreu, N. M. Boaventura-netto, P. O. Hahn, P. And-querido et al., A survey for the quadratic assignment problem, European J. Operational Research, vol.176, issue.2, pp.657-690, 2007.

L. , V. Fishkind, D. Fiori, M. Vogelstein, J. Priebe et al., Graph matching: Relax at your own risk, 2015.

M. Emoli and F. , On the use of Gromov?Hausdorff distances for shape comparison, Symposium on Point Based Graphics, pp.81-90, 2007.

M. Emoli and F. , Gromov?Hausdorff distances in Euclidean spaces, Proc. CVPR Workshops, pp.1-8, 2008.

M. Emoli and F. , Spectral Gromov-Wasserstein distances for shape matching, Proc. ICCV Workshops, pp.256-263, 2009.

M. Emoli and F. , Gromov?Wasserstein distances and the metric approach to object matching, Foundations of Comp. Math, vol.11, issue.4, pp.417-487, 2011.

M. Emoli and F. , The Gromov?Wasserstein distance: A brief overview, Axioms, vol.3, issue.3, 2014.

M. Erigot and Q. , A multiscale approach to optimal transport, CGF, pp.1583-1592, 2011.

O. , M. Ben-chen, M. Solomon, J. Butscher, A. And-guibas et al., Functional maps: A flexible representation of maps between shapes, ACM Trans. Graph, vol.31, issue.30, pp.1-3011, 2012.

P. , D. Kondor, R. And-singh, and V. , Solving the multi-way matching problem by permutation synchronization, Proc. NIPS, pp.1860-1868, 2013.

P. , P. And-wolkowicz, and H. , Quadratic Assignment and Related Problems, 1994.

Q. , N. Song, L. And-smola, and A. J. , Kernelized sorting, Proc. NIPS, pp.1289-1296, 2009.

R. , A. Gold, S. And-mjolsness, and E. , A novel optimizing network architecture with applications, Neural Comp, vol.8, issue.5, pp.1041-1060, 1996.

R. , A. Yuille, A. L. Gold, S. And-mjolsness, and E. , A convergence proof for the softassign quadratic assignment algorithm, Proc. NIPS, pp.620-626, 1997.

R. , A. Yuille, A. And-mjolsness, and E. , Convergence properties of the softassign quadratic assignment algorithm, Neural Comput, vol.11, issue.6, pp.1455-1474, 1999.

R. , Y. Tomasi, C. And-guibas, and L. J. , The earth mover's distance as a metric for image retrieval, pp.99-121, 2000.

R. , R. M. Ovsjanikov, M. Azencot, O. Ben-chen, M. Chazal et al., Map-based exploration of intrinsic shape differences and variability, pp.1-7212, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00923609

S. , S. And-gonzalez, and T. , P-complete approximation problems, J. ACM, vol.23, issue.3, pp.555-565, 1976.

S. , A. Gretton, A. Song, L. And-sch¨olkopfsch¨-sch¨olkopf, and B. , A Hilbert space embedding for distributions, Algorithmic Learning Theory, pp.13-31, 2007.

S. , J. Nguyen, A. Butscher, A. Ben-chen, M. And-guibas et al., Soft maps between surfaces, pp.1617-1626, 2012.

S. , J. Guibas, L. And-butscher, and A. , Dirichlet energy for analysis and synthesis of soft maps, CGF, pp.197-206, 2013.

S. , J. Rustamov, R. Guibas, L. And-butscher, and A. , Earth mover's distances on discrete surfaces, ACM Trans. Graph, vol.33, issue.67, pp.1-6712, 2014.

S. , J. De-goes, F. Peyrépeyr´peyré, G. Cuturi, M. Butscher et al., Convolutional Wasserstein distances: Efficient optimal transportation on geometric domains, pp.1-6611, 2015.

S. , J. Qu, Q. And-wright, and J. , When are nonconvex problems not scary?, 2015.

T. , J. W. And-veltkamp, and R. C. , A survey of content based 3d shape retrieval methods, Multimedia Tools Appl, vol.39, issue.3, pp.441-471, 2008.

T. , N. Gao, J. And, J. , and S. , Hidden Markov model-based weighted likelihood discriminant for 2-D shape classification, Trans. Image Proc, vol.16, issue.11, pp.2707-2719, 2007.

O. Van-kaick, H. Zhang, G. Hamarneh, A. Cohen-or, and D. , A survey on shape correspondence, pp.1681-1707, 2011.

W. , R. A. Morales, J. L. Nocedal, J. And-orban, and D. , An interior algorithm for nonlinear optimization that combines line search and trust region steps, Math. Program, vol.107, pp.3-391, 2006.