F. Bach, Learning with Submodular Functions: A Convex Optimization Perspective, Foundations and Trends?? in Machine Learning, vol.6, issue.2-3, 2013.
DOI : 10.1561/2200000039
URL : https://hal.archives-ouvertes.fr/hal-00645271

F. Bach, Duality Between Subgradient and Conditional Gradient Methods, SIAM Journal on Optimization, vol.25, issue.1, pp.115-129, 2015.
DOI : 10.1137/130941961
URL : https://hal.archives-ouvertes.fr/hal-00757696

E. Bae, J. Yuan, X. Tai, and Y. Boykov, A Fast Continuous Max-Flow Approach to Non-convex Multi-labeling Problems, Efficient Algorithms for Global Optimization Methods in Computer Vision, pp.134-154, 2014.
DOI : 10.1007/978-3-642-54774-4_7

M. J. Best and N. Chakravarti, Active set algorithms for isotonic regression; A unifying framework, Mathematical Programming, pp.425-439, 1990.
DOI : 10.1007/BF01580873

J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization: Theory and Examples, 2006.

S. P. Boyd and L. Vandenberghe, Convex Optimization, 2004.

Y. Boykov, O. Veksler, and R. Zabih, Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.23, issue.11, pp.1222-1239, 2001.
DOI : 10.1109/34.969114

G. Carlier, On a class of multidimensional optimal transportation problems, Journal of Convex Analysis, vol.10, issue.2, pp.517-530, 2003.

A. Chambolle and J. Darbon, On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows, International Journal of Computer Vision, vol.40, issue.9, pp.288-307, 2009.
DOI : 10.1007/s11263-009-0238-9

G. Choquet, Theory of capacities Annales de l'Institut Fourier, pp.131-295, 1954.

J. Djolonga and A. Krause, From MAP to marginals: Variational inference in Bayesian submodular models, Advances in Neural Information Processing Systems (NIPS), 2014.

J. Djolonga and A. Krause, Scalable variational inference in log-supermodular models, International Conference on Machine Learning (ICML), 2015.

J. Edmonds, Submodular Functions, Matroids, and Certain Polyhedra, Combinatorial optimization -Eureka, you shrink!, pp.11-26, 2003.
DOI : 10.1007/3-540-36478-1_2

J. Fan and R. Li, Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties, Journal of the American Statistical Association, vol.96, issue.456, pp.1348-1360, 2001.
DOI : 10.1198/016214501753382273
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.4174

P. Favati and F. Tardella, Convexity in nonlinear integer programming, Ricerca Operativa, vol.53, pp.3-44, 1990.

U. Feige, V. S. Mirrokni, and J. Vondrák, Maximizing Non-monotone Submodular Functions, SIAM Journal on Computing, vol.40, issue.4, pp.1133-1153, 2011.
DOI : 10.1137/090779346

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956.
DOI : 10.1002/nav.3800030109

S. Friedland and S. Gaubert, Submodular spectral functions of principal submatrices of a hermitian matrix, extensions and applications, Linear Algebra and its Applications, vol.438, issue.10, pp.3872-3884, 2013.
DOI : 10.1016/j.laa.2011.11.021
URL : https://hal.archives-ouvertes.fr/hal-00940794

S. Fujishige, Submodular Functions and Optimization, 2005.

S. Fujishige and K. Murota, Notes on L-/M-convex functions and the separation theorems, Mathematical Programming, vol.88, issue.1, pp.129-146, 2000.
DOI : 10.1007/PL00011371

H. Groenevelt, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, European Journal of Operational Research, vol.54, issue.2, pp.227-236, 1991.
DOI : 10.1016/0377-2217(91)90300-K

H. Ishikawa, Exact optimization for markov random fields with convex priors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.10, pp.1333-1336, 2003.
DOI : 10.1109/TPAMI.2003.1233908

S. Iwata, L. Fleischer, and S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM, vol.48, issue.4, pp.761-777, 2001.
DOI : 10.1145/502090.502096

M. Jaggi, Revisiting Frank-Wolfe: Projection-free sparse convex optimization, Proceedings of the International Conference on Machine Learning (ICML), 2013.

S. Jegelka, F. Bach, and S. Sra, Reflection methods for user-friendly submodular optimization, Advances in Neural Information Processing Systems (NIPS), 2013.
URL : https://hal.archives-ouvertes.fr/hal-00905258

A. Juditsky and A. Nemirovski, First order methods for nonsmooth convex large-scale optimization , i: general purpose methods, Optimization for Machine Learning, pp.121-148, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00981863

S. Karlin and Y. Rinott, Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions, Journal of Multivariate Analysis, vol.10, issue.4, pp.467-498, 1980.
DOI : 10.1016/0047-259X(80)90065-2

S. Kim and M. Kojima, Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations, Computational Optimization and Applications, vol.26, issue.2, pp.143-154, 2003.
DOI : 10.1023/A:1025794313696

V. Kolmogorov, Minimizing a sum of submodular functions, Discrete Applied Mathematics, vol.160, issue.15, pp.2246-2258, 2012.
DOI : 10.1016/j.dam.2012.05.025

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

A. Krause and C. Guestrin, Submodularity and its applications in optimized information gathering, ACM Transactions on Intelligent Systems and Technology, vol.2, issue.4, 2011.
DOI : 10.1145/1989734.1989736

S. Lacoste-julien and M. Jaggi, On the global linear convergence of frank-wolfe optimization variants, Advances in Neural Information Processing Systems (NIPS), 2015.
URL : https://hal.archives-ouvertes.fr/hal-01248675

K. Lange, D. R. Hunter, and I. Yang, Optimization Transfer Using Surrogate Objective Functions, Journal of Computational and Graphical Statistics, vol.68, issue.1, pp.1-20, 2000.
DOI : 10.1080/10618600.2000.10474858

H. Lin and J. Bilmes, A class of submodular functions for document summarization, NAACL/HLT, 2011.

G. G. Lorentz, An Inequality for Rearrangements, The American Mathematical Monthly, vol.60, issue.3, pp.176-179, 1953.
DOI : 10.2307/2307574

L. Lovász, Submodular functions and convexity Mathematical programming: The state of the art, pp.235-257, 1982.

P. Milgrom and C. Shannon, Monotone Comparative Statics, Econometrica, vol.62, issue.1, pp.157-180, 1994.
DOI : 10.2307/2951479

S. K. Mitter, Convex Optimization in Infinite Dimensional Spaces, Recent Advances in Learning and Control, pp.161-179, 2008.
DOI : 10.1007/978-1-84800-155-8_12

K. P. Murphy, Machine Learning: a Probabilistic Perspective, 2012.

A. Nedi´cnedi´c and A. Ozdaglar, Approximate primal solutions and rate analysis for dual subgradient methods, SIAM Journal on Optimization, vol.19, issue.4, 2009.

G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, An analysis of approximations for maximizing submodular set functions???I, Mathematical Programming, pp.265-294, 1978.
DOI : 10.1007/BF01588971

J. B. Orlin, A faster strongly polynomial time algorithm for submodular function minimization, Mathematical Programming, pp.237-251, 2009.

T. Pock, A. Chambolle, D. Cremers, and H. Bischof, A convex relaxation approach for computing minimal partitions, 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009.
DOI : 10.1109/CVPR.2009.5206604

W. Rudin, Real and complex analysis, 1986.

. Ruozzi, Exactness of approximate MAP inference in continuous MRFs, Advances in Neural Information Processing Systems, 2015.

F. Santambrogio, Optimal Transport for Applied Mathematicians, 2015.
DOI : 10.1007/978-3-319-20828-2

D. Schlesinger and B. Flach, Transforming an arbitrary MinSum problem into a binary one, 2006.

A. Schrijver, A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time, Journal of Combinatorial Theory, Series B, vol.80, issue.2, pp.346-355, 2000.
DOI : 10.1006/jctb.2000.1989

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, 2003.

L. S. Shapley, Complements and substitutes in the opttmal assignment problem, Naval Research Logistics Quarterly, vol.9, issue.1, pp.45-48, 1962.
DOI : 10.1002/nav.3800090106

N. S. Shor, Nondifferentiable optimization and polynomial problems, 2013.
DOI : 10.1007/978-1-4757-6015-6

D. M. Topkis, Minimizing a Submodular Function on a Lattice, Operations Research, vol.26, issue.2, pp.305-321, 1978.
DOI : 10.1287/opre.26.2.305

D. M. Topkis, Supermodularity and complementarity, 2011.
DOI : 10.1515/9781400822539

C. Villani, Optimal transport: old and new, 2008.
DOI : 10.1007/978-3-540-71050-9

J. Vondrák, Optimal approximation for the submodular welfare problem in the value oracle model, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.67-74, 2008.
DOI : 10.1145/1374376.1374389

Y. Wald and A. Globerson, Tightness results for local consistency relaxations in continuous MRFs, Proc. Uncertainty in Artifical Intelligence (UAI), 2014.

T. Werner, A Linear Programming Approach to Max-Sum Problem: A Review, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.7, pp.1165-1179, 2007.
DOI : 10.1109/TPAMI.2007.1036

P. Wolfe, Finding the nearest point in A polytope, Mathematical Programming, pp.128-149, 1976.
DOI : 10.1007/BF01580381

S. Zivn´yzivn´y, T. Werner, and D. Pr??a, The power of lp relaxation for map inference, 2014.