F. Bach, Learning with submodular functions: A convex optimization perspective Arxiv preprint arXiv:1111.6453v2, 2013.

S. Bagon, Matlab wrapper for graph cut, 2006.

A. Barbero and S. Sra, Fast Newton-type methods for total variation regularization, Int. Conference on Machine Learning (ICML), 2011.

H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643354

H. H. Bauschke, P. L. Combettes, and D. R. Luke, Finding best approximation pairs relative to two closed convex sets in Hilbert spaces, Journal of Approximation Theory, vol.127, issue.2, pp.178-192, 2004.
DOI : 10.1016/j.jat.2004.02.006
URL : https://hal.archives-ouvertes.fr/hal-00017939

A. Beck and M. Teboulle, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, SIAM Journal on Imaging Sciences, vol.2, issue.1, pp.183-202, 2009.
DOI : 10.1137/080716542

D. P. Bertsekas, Nonlinear programming, Athena Scientific, 1999.

Y. Boykov and V. Kolmogorov, An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.9, pp.1124-1137, 2004.
DOI : 10.1109/TPAMI.2004.60

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

B. Savchynskyy, S. Schmidt, J. H. Kappes, and C. Schnörr, Efficient MRF energy minimization via adaptive diminishing smoothing, Conference on Uncertainty in Artificial Intelligence (UAI), 2012.

A. Chambolle, An algorithm for total variation minimization and applications, Journal of Mathematical Imaging and Vision, vol.20, issue.1, pp.89-97, 2004.

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

F. Chudak and K. Nagano, Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization, ACM- SIAM Symp. on Discrete Algorithms (SODA), 2007.

P. L. Combettes and J. Pesquet, Proximal Splitting Methods in Signal Processing, Fixed- Point Algorithms for Inverse Problems in Science and Engineering, pp.185-212, 2011.
DOI : 10.1007/978-1-4419-9569-8_10
URL : https://hal.archives-ouvertes.fr/hal-00643807

F. R. Deutsch, Best Approximation in Inner Product Spaces, 2001.
DOI : 10.1007/978-1-4684-9298-9

J. Douglas and H. H. Rachford, On the numerical solution of the heat conduction problem in 2 and 3 space variables. Trans, pp.421-439, 1956.

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

U. Feige, V. S. Mirrokni, and J. Vondrak, 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

. Fujishige, Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector, Mathematics of Operations Research, vol.5, issue.2, pp.186-196, 1980.
DOI : 10.1287/moor.5.2.186

S. Fujishige, Submodular Functions and Optimization, 2005.

S. Fujishige and S. Isotani, A submodular function minimization algorithm based on the minimum-norm base, Pacific Journal of Optimization, vol.7, pp.3-17, 2011.

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

D. S. Hochbaum and S. Hong, About strongly polynomial time algorithms for quadratic optimization over submodular constraints, Mathematical Programming, pp.269-309, 1995.
DOI : 10.1007/BF01585561

S. Iwata and N. Zuiki, A network flow approach to cost allocation for rooted trees, Networks, vol.1, issue.4, pp.297-301, 2004.
DOI : 10.1002/net.20040

S. Jegelka, H. Lin, and J. Bilmes, On fast approximate submodular minimization, Neural Information Processing Systems (NIPS), 2011.

R. Jenatton, J. Mairal, G. Obozinski, and F. Bach, Proximal methods for hierarchical sparse coding, Journal of Machine Learning Research, pp.2297-2334, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00516723

P. Kohli, L. Ladick´yladick´y, and P. Torr, Robust higher order potentials for enforcing label consistency, Int. Journal of Comp. Vision, vol.82, 2009.

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

V. Kolmogorov and R. Zabih, What energy functions can be minimized via graph cuts?, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.26, issue.2, pp.147-159, 2004.
DOI : 10.1109/TPAMI.2004.1262177
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1823

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

A. Levinshtein, A. Stere, K. N. Kutulakos, D. J. Fleet, S. J. Dickinson et al., TurboPixels: Fast Superpixels Using Geometric Flows, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.31, issue.12, p.31, 2009.
DOI : 10.1109/TPAMI.2009.96

H. Lin and J. Bilmes, A class of submodular functions for document summarization, Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL/HLT), 2011.

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

S. T. Mccormick, Submodular function minimization. Discrete Optimization, pp.321-391, 2005.

O. Meshi, T. Jaakkola, and A. Globerson, Convergence rate analysis of MAP coordinate minimization algorithms, Neural Information Processing Systems (NIPS), 2012.

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

Y. Nesterov, Smooth minimization of non-smooth functions, Mathematical Programming, pp.127-152, 2005.
DOI : 10.1007/s10107-004-0552-5

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

B. Savchynskyy, S. Schmidt, J. Kappes, and C. Schnörr, A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling, CVPR 2011, 2011.
DOI : 10.1109/CVPR.2011.5995652

A. Shekhovtsov and V. Hlavác, A distributed mincut/maxflow algorithm combining path augmentation and push-relabel, Energy Minimization Methods in Computer Vision and Pattern Recognition, 2011.

P. Stobbe, Convex Analysis for Minimizing and Learning Submodular Set functions, 2013.

P. Stobbe and A. Krause, Efficient minimization of decomposable submodular functions, Neural Information Processing Systems (NIPS), 2010.

R. Tarjan, J. Ward, B. Zhang, Y. Zhou, and J. Mao, Balancing Applied to Maximum Network Flow Problems, European Symp. on Algorithms (ESA), pp.612-623, 2006.
DOI : 10.1007/11841036_55