Playing with duality: An overview of recent primal?dual approaches for solving large-scale optimization problems

IEEE Signal Processing Magazine

Volumn 32, Issue 6, 2015, Pages 31-54

  Komodakis, Nikos ^a,b,c   Pesquet, Jean Christophe ^d,e  

^a UNIVERSITÉ PARIS EST   (France)

^b CNRS   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

^d UNIVERSITÉ GUSTAVE EIFFEL   (France)

^e UNIVERSITÉ PARIS EST   (France)

Author keywords

Algorithm design and analysis; Computer vision; Context modeling; Convex functions; Image processing; Optimization; Signal processing algorithms

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER VISION; FUNCTIONS; IMAGE PROCESSING; LEARNING SYSTEMS; NUMERICAL METHODS; SIGNAL PROCESSING;

ALGORITHM DESIGN AND ANALYSIS; CONTEXT MODELING; CONVEX FUNCTIONS; HIGH-DIMENSIONAL PROBLEMS; LARGE-SCALE OPTIMIZATION; NONSMOOTH OPTIMIZATION; PRIMAL AND DUAL PROBLEMS; SIGNAL PROCESSING ALGORITHMS;

OPTIMIZATION;

EID: 85032768490     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2014.2377273     Document Type: Review

References (133)

1. D. P. Bertsekas, Nonlinear Programming, 2nd ed. Nashua, NH: Athena Scientific, 2004.
2. A. Blake, P. Kohli, and C. Rother, Markov Random Fields for Vision and Image Processing. Cambridge, MA: MIT Press, 2011.
3. S. Sra, S. Nowozin, and S. J. Wright, Optimization for Machine Learning. Cambridge, MA: MIT Press, 2012.
4. S. Theodoridis, Machine Learning: A Bayesian and Optimization Perspective, . San Diego, CA: Academic Press, 2015.
5. F. Bach, R. Jenatton, J. Mairal, and G. Obozinski, "Optimization with sparsityinducing penalties, " Found. Trends Machine Learn., vol. 4, no. 1, pp. 1-106, 2012.
6. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
7. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, UK: Cambridge Univ. Press, 2004.
8. H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces. New York: Springer, 2011.
9. J. J. Moreau, "Proximité et dualité dans un espace hilbertien, " Bull. Soc. Math. France, vol. 93, no. 3, pp. 273-299, 1965.
10. P. L. Combettes and J.-C. Pesquet, "Proximal splitting methods in signal processing, " in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H. H. Bauschke, R. S. Burachik, P. L. Combettes, V. Elser, D. R. Luke, and H. Wolkowicz, Eds. New York: Springer-Verlag, 2011, pp. 185-212.
11. P. L. Combettes and J.-C. Pesquet, "Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators, " Set-Valued Var. Anal., vol. 20, no. 2, pp. 307-330, June 2012.
12. S. Z. Li, Markov Random Field Modeling in Image Analysis, 3rd ed. London: Springer-Verlag, 2009.
13. N. Komodakis, G. Tziritas, and N. Paragios, "Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual strategies, " Comput. Vis. Image Understand., vol. 112, no. 2, pp. 14-29, Oct. 2008.
14. N. Komodakis, N. Paragios, and G. Tziritas, "MRF energy minimization and beyond via dual decomposition, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 3, pp. 531-552, Jan. 2011.
15. M. Wainwright, T. Jaakkola, and A. Willsky, "MAP estimation via agreement on trees: message-passing and linear programming, " IEEE Trans. Inform. Theory, vol. 51, no. 11, pp. 3697-3717, Nov. 2005.
16. C. Wang, N. Komodakis, and N. Paragios, "Markov random field modeling, inference & learning in computer vision & image understanding: A survey, " Comput. Vis. Image Understand., vol. 117, no. 11, pp. 1610-1627, Nov. 2013.
17. V. V. Vazirani, Approximation Algorithms. New York, NY: Springer-Verlag, 2001.
18. D. S. Hochbaum, Ed., Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS Publishing, 1997.
19. M. Fortin and R. Glowinski, Eds., Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems. Amsterdam: Elsevier Science, 1983.
20. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers, " Found. Trends Machine Learn., vol. 8, no. 1, pp. 1-122, 2011.
21. B. S. Mordukhovich, Variational Analysis and Generalized Differentiation, Vol. I: Basic Theory (Series of Comprehensive Studies in Mathematics, vol. 330). Berlin, Heidelberg: Springer-Verlag, 2006.
22. N. Parikh and S. Boyd, "Proximal algorithms, " Found. Trends Optim., vol. 1, no. 3, pp. 123-231, 2013.
23. R Tibshirani, "Regression shrinkage and selection via the lasso, " J. Royal Stat. Soc. B, vol. 58, no. 1, pp. 267-288, 1996.
24. E. J. Candès and M. B. Wakin, "An introduction to compressive sampling, " IEEE Signal Processing Mag., vol. 25, no. 2, pp. 21-30, Mar. 2008.
25. L. Rudin, S. Osher, and E. Fatemi, "Nonlinear total variation based noise removal algorithms, " Physica D, vol. 60, no. 1-4, pp. 259-268, Nov. 1992.
26. R. I. Bot, Conjugate Duality in Convex Optimization (Lecture Notes in Economics and Mathematical Systems, vol. 637). Berlin, Heidelberg: Springer-Verlag, 2010.
27. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. Nashua, NH: Athena Scientific, 1997.
28. D. Gabay and B. Mercier, "A dual algorithm for the solution of nonlinear variational problems via finite elements approximations, " Comput. Math. Appl., vol. 2, no. 1, pp. 17-40, 1976.
29. J.-F. Giovannelli and A. Coulais, "Positive deconvolution for superimposed extended source and point sources, " Astron. Astrophys., vol. 439, no. 1, pp. 401-412, Aug. 2005.
30. T. Goldstein and S. Osher, "The split Bregman method for, 1-regularized problems, " SIAM J. Imaging Sci., vol. 2, no. 2, pp. 323-343, 2009.
31. M. A. T. Figueiredo and R. D. Nowak, "Deconvolution of Poissonian images using variable splitting and augmented Lagrangian optimization, " in Proc. IEEE Workshop Statistical Signal Processing, Cardiff, United Kingdom, Aug. 31-Sept. 3, 2009, pp. 733-736.
32. M. A. T. Figueiredo and J. M. Bioucas-Dias, "Restoration of Poissonian images using alternating direction optimization, " IEEE Trans. Image Processing, vol. 19, no. 12, pp. 3133-3145, Dec. 2010.
33. M. V. Afonso, J. M. Bioucas-Dias, and M. A. T. Figueiredo, "An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems, " IEEE Trans. Image Processing, vol. 20, no. 3, pp. 681-695, Mar. 2011.
34. Q. Tran-Dinh and V. Cevher. (2014). A primal-dual algorithmic framework for constrained convex minimization. [Online]. Available: http://arxiv.org/ pdf/1406.5403.pdf
35. M. Hong and Z.-Q. Luo. (2013). On the linear convergence of the alternating direction method of multipliers. [Online]. Available: http://arxiv.org/ abs/1208. 3922
36. J. Eckstein and D. P. Bertsekas, "On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, " Math. Program., vol. 55, no. 1-3, pp. 293-318, 1992.
37. P. L. Combettes and J.-C. Pesquet, "A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery, " IEEE J. Select. Topics Signal Processing, vol. 1, no. 4, pp. 564-574, Dec. 2007.
38. R. I. Bot and C. Hendrich, "A Douglas-Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators, " SIAM J. Optim., vol. 23, no. 4, pp. 2541-2565, Dec. 2013.
39. G. Chen and M. Teboulle, "A proximal-based decomposition method for convex minimization problems, " Math. Program., vol. 64, no. 1-3, pp. 81-101, 1994.
40. P. L. Combettes and V. R. Wajs, "Signal recovery by proximal forward-backward splitting, " Multiscale Model. Simul., vol. 4, no. 4, pp. 1168-1200, 2005.
41. A. Nedić and A. Ozdaglar, "Subgradient methods for saddle-point problems, " J. Optim. Theory Appl., vol. 142, no. 1, pp. 205-228, 2009.
42. I. Daubechies, M. Defrise, and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, " Comm. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, Nov. 2004.
43. D. Davis. (2014). Convergence rate analysis of the Forward-Douglas-Rachford splitting scheme. [Online]. Available: http://arxiv. org/abs/1410.2654
44. L. Condat, "A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms, " J. Optim. Theory Appl., vol. 158, no. 2, pp. 460-479, Aug. 2013.
45. B. C. Vü, "A splitting algorithm for dual monotone inclusions involving cocoercive operators, " Adv. Comput. Math., vol. 38, no. 3, pp. 667-681, Apr. 2013.
46. A. Chambolle and T. Pock, "A first-order primal-dual algorithm for convex problems with applications to imaging, " J. Math. Imaging Vision, vol. 40, no. 1, pp. 120-145, 2011.
47. E. Esser, X. Zhang, and T. Chan, "A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science, " SIAM J. Imaging Sci., vol. 3, no. 4, pp. 1015-1046, 2010.
48. B. He and X. Yuan, "Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective, " SIAM J. Imaging Sci., vol. 5, no. 1, pp. 119-149, 2012.
49. T. Pock and A. Chambolle, "Diagonal preconditioning for first order primal-dual algorithms in convex optimization, " in Proc. IEEE Int. Conf. Computer Vision, Barcelona, Spain, Nov. 6-13, 2011, pp. 1762-1769.
50. P. L. Combettes and B. C. Vü, "Variable metric forward-backward splitting with applications to monotone inclusions in duality, " Optimization, vol. 63, no. 9, pp. 1289-1318, Sept. 2014.
51. T. Goldstein, E. Esser, and R. Baraniuk. (2013). Adaptive primal-dual hybrid gradient methods for saddle-point problems. [Online]. Available: http://arxiv.org/abs/1305.0546
52. P. L. Combettes, L. Condat, J.-C. Pesquet, and B. C. Vü, "A forward-backward view of some primal-dual optimization methods in image recovery, " in Proc. Int. Conf. Image Processing, Paris, France, 27-30 Oct. 2014, pp. 4141-4145.
53. J. Liang, J. Fadili, and G. Peyré. (2014). Convergence rates with inexact nonexpansive operators. [Online]. Available: http://arxiv.org/abs/1404.4837
54. I. Loris and C. Verhoeven, "On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty, " Inverse Problems, vol. 27, no. 12, pp. 125007, 2011.
55. P. Chen, J. Huang, and X. Zhang, "A primal-dual fixed point algorithm for convex separable minimization with applications to image restoration, " Inverse Problems, vol. 29, no. 2, pp. 025011, 2013.
56. P. L. Combettes, D. Düng, and B. C. Vü, "Dualization of signal recovery problems, " Set-Valued Var. Anal., vol. 18, pp. 373-404, Dec. 2010.
57. C. Chaux, P. L. Combettes, J.-C. Pesquet, and V. R. Wajs, "A variational formulation for frame-based inverse problems, " Inverse Problems, vol. 23, no. 4, pp. 1495-1518, June 2007.
58. A. Jezierska, E. Chouzenoux, J.-C. Pesquet, and H. Talbot, "A primal-dual proximal splitting approach for restoring data corrupted with Poisson-Gaussian noise, " in Proc. Int. Conf. Acoustics, Speech Signal Processing, Kyoto, Japan, 25-30 Mar. 2012, pp. 1085-1088.
59. P. Tseng, "A modified forward-backward splitting method for maximal monotone mappings, " SIAM J. Control Optim., vol. 38, pp. 431-446, 2000.
60. L. M. Briceño-Arias and P. L. Combettes, "A monotone + skew splitting model for composite monotone inclusions in duality, " SIAM J. Optim., vol. 21, no. 4, pp. 1230-1250, Oct. 2011.
61. P. L. Combettes, "Systems of structured monotone inclusions: duality, algorithms, and applications, " SIAM J. Optim., vol. 23, no. 4, pp. 2420-2447, Dec. 2013.
62. R. I. Bot and C. Hendrich, "Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization, " J. Math. Imaging Vision, vol. 49, no. 3, pp. 551-568, 2014.
63. A. Alotaibi, P. L. Combettes, and N. Shahzad, "Solving coupled composite monotone inclusions by successive Fejér approximations of their Kuhn-Tucker set, " SIAM J. Optim., to be published, vol. 24, no. 4, pp. 2076-2095, Dec. 2014.
64. S. R. Becker and P. L. Combettes, "An algorithm for splitting parallel sums of linearly composed monotone operators, with applications to signal recovery, " Nonlinear Convex Anal., vol. 15, no. 1, pp. 137-159, Jan. 2014.
65. P. L. Combettes and J.-C. Pesquet, "A proximal decomposition method for solving convex variational inverse problems, " Inverse Problems, vol. 24, no. 6, p. 065014, Dec. 2008.
66. J.-C. Pesquet and N. Pustelnik, "A parallel inertial proximal optimization method, " Pac. J. Optim., vol. 8, no. 2, pp. 273-305, Apr. 2012.
67. S. Setzer, G. Steidl, and T. Teuber, "Deblurring Poissonian images by split Bregman techniques, " J. Visual Commun. Image Represent., vol. 21, no. 3, pp. 193-199, Apr. 2010.
68. V. Kolmogorov, "Generalized roof duality and bisubmodular functions, " in Proc. Annu. Conf. Neural Information Processing Systems, Vancouver, Canada, 6-9 Dec. 2010, pp. 1144-1152.
69. F. Kahl and P. Strandmark, "Generalized roof duality, " Discrete Appl. Math., vol. 160, no. 16-17, pp. 2419-2434, 2012.
70. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewoods Cliffs, NJ: Prentice Hall, 1982.
71. N. Komodakis and G. Tziritas, "Approximate labeling via graph-cuts based on linear programming, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 8, pp. 1436-1453, Aug. 2007.
72. N. Komodakis, N. Paragios, and G. Tziritas, "MRF optimization via dual decomposition: Message-passing revisited, " in Proc. IEEE Int. Conf. Computer Vision, Rio de Janeiro, Brazil, 14-21 Oct. 2007, pp. 1-8.
73. C. Chekuri, S. Khanna, J. Naor, and L. Zosin, "Approximation algorithms for the metric labeling problem via a new linear programming formulation, " in Proc. 12th Annu. ACM-SIAM Symp. Discrete Algorithms, Washington, DC, USA, 7-9 Jan. 2001, pp. 109-118.
74. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
75. V. Kolmogorov, "Convergent tree-reweighted message passing for energy minimization, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 10, pp. 1568-1583, Aug. 2006.
76. T. Werner, "A linear programming approach to max-sum problem: A review, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 7, pp. 1165-1179, July 2007.
77. A. Globerson and T. Jaakkola, "Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations, " in Proc. Annu. Conf. Neural Information Processing Systems, Vancouver and Whistler, Canada, 3-6 Dec. 2007, pp. 553-560.
78. C. Yanover, T. Talya Meltzer, and Y. Weiss, "Linear programming relaxations and belief propagation-an empirical study, " J. Mach. Learn. Res., vol. 7, pp. 1887-1907, Sept. 2006.
79. T. Hazan and A. Shashua, "Norm-product belief propagation: Primal-dual message-passing for approximate inference, " IEEE Trans. Inform. Theory, vol. 56, no. 12, pp. 6294-6316, Dec. 2010.
80. S. Jegelka, F. Bach, and S. Sra, "Reflection methods for user-friendly submodular optimization, " in Proc. Ann. Conf. Neural Information Processing Systems, Lake Tahoe, NV, USA, 5-10 Dec. 2013, pp. 1313-1321.
81. N. N. Schraudolph, "Polynomial-time exact inference in NP-hard binary MRFs via reweighted perfect matching, " in Proc. 13th Int. Conf. Artificial Intelligence and Statistics (AISTATS), Chia Laguna Resort, Sardinia, Italy, 13-15 May 2010, pp. 717-724.
82. A. Osokin, D. Vetrov, and V. Kolmogorov, "Submodular decomposition framework for inference in associative Markov networks with global constraints, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Colorado Springs, USA, 21-23 June 2011, pp. 1889-1896.
83. J. Yarkony, R. Morshed, A. T. Ihler, and C. Fowlkes, "Tightening MRF relaxations with planar subproblems, " in Proc. Conf. Uncertainty in Artificial Intelligence, Barcelona, Spain, 14-17 July 2011, pp. 770-777.
84. D. Sontag, T. Meltzer, A. Globerson, Y. Weiss, and T. Jaakkola, "Tightening LP relaxations for MAP using message passing, " in Proc. Conf. Uncertainty in Artificial Intelligence, Helsinki, Finland, 9-12 July 2008, pp. 656-664.
85. N. Komodakis and N. Paragios, "Beyond loose LP-relaxations: Optimizing MRFs by repairing cycles, " in Proc. European Conf. Computer Vision, Marseille, France, 12-18 Oct. 2008, pp. 806-820.
86. E. Boros and P. L. Hammer, "Pseudo-Boolean optimization, " Discrete Appl. Math., vol. 123, no. 1-3, pp. 155-225, 2002.
87. V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts?, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 2, pp. 147-159, Feb. 2004.
88. V. Jojic, S. Gould, and D. Koller, "Fast and smooth: Accelerated dual decomposition for MAP inference, " in Proc. Int. Conf. Machine Learning, Haifa, Israel, 21-24 June 2010, pp. 503-510.
89. B. Savchynskyy, J. H. Kappes, S. Schmidt, and C. Schnörr, "A study of Nesterovs scheme for Lagrangian decomposition and MAP labeling, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Colorado Springs, USA, 21-23 June 2011, pp. 1817-1823.
90. B. Savchynskyy, S. Schmidt, J. H. Kappes, and C. Schnörr, "Efficient MRF energy minimization via adaptive diminishing smoothing, " in Proc. Conf. Uncertainty in Artificial Intelligence, Catalina Island, USA, 15-17 Aug. 2012, pp. 746-755.
91. N. Pustelnik, C. Chaux, and J.-C. Pesquet, "Parallel ProXimal Algorithm for image restoration using hybrid regularization, " IEEE Trans. Image Processing, vol. 20, no. 9, pp. 2450-2462, Sept. 2011.
92. X. Zhang, M. Burger, X. Bresson, and S. Osher, "Bregmanized nonlocal regularization for deconvolution and sparse reconstruction, " SIAM J. Imaging Sci., vol. 3, no. 3, pp. 253-276, 2010.
93. S. Bonettini and V. Ruggiero, "On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration, " J. Math. Imaging Vision, vol. 44, no. 3, pp. 236-253, 2012.
94. A. Repetti, E. Chouzenoux, and J.-C. Pesquet, "A penalized weighted least squares approach for restoring data corrupted with signal-dependent noise, " in Proc. European Signal and Image Processing Conf., Bucharest, Romania, 27-31 Aug. 2012, pp. 1553-1557.
95. S. Harizanov, J.-C. Pesquet, and G. Steidl, "Epigraphical projection for solving least squares Anscombe transformed constrained optimization problems, " in Proc. 4th Int. Conf. Scale-Space and Variational Methods in Computer Vision, A. Kuijper, K. Bredies, T. Pock, and H. Bischof, Eds., Schloss Seggau, Leibnitz, Austria, 2-6 June 2013 (Lecture Notes in Computer Science, vol. 7893). Berlin: Springer-Verlag, pp. 125-136.
96. T. Teuber, G. Steidl, and R.-H. Chan, "Minimization and parameter estimation for seminorm regularization models with I-divergence constraints, " Inverse Problems, vol. 29, pp. 035007, Mar. 2013.
97. M. Burger, A. Sawatzky, and G. Steidl. (2014). First order algorithms in variational image processing. [Online]. Available: http://arxiv.org/abs/1412.4237
98. C. Couprie, L. Grady, L. Najman, J.-C. Pesquet, and H. Talbot, "Dual constrained TV-based regularization on graphs, " SIAM J. Imaging Sci., vol. 6, no. 3, pp. 1246-1273, 2013.
99. L. Chaari, J.-C. Pesquet, A. Benazza-Benyahia, and Ph. Ciuciu, "A wavelet based regularized reconstruction algorithm for SENSE parallel MRI with applications to neuroimaging, " Med. Image Anal., vol. 15, no. 2, pp. 185-201, Apr. 2011.
100. A. Florescu, E. Chouzenoux, J.-C. Pesquet, Ph. Ciuciu, and S. Ciochina, "A Majorize-Minimize Memory Gradient method for complex-valued inverse problems, " Signal Process. (Special issue on Image Restoration and Enhancement: Recent Advances and Applications), vol. 103, pp. 285-295, Oct. 2014.
101. S. Mahadevan, B. Liu, P. Thomas, W. Dabney, S. Giguere, N. Jacek, I. Gemp, and J. Liu, "Proximal reinforcement learning: A new theory of sequential decision making in primal-dual spaces, " [Online]. Available: http://http://arxiv.org/abs/1405.6757.
102. S. Ono, M. Yamagishi, and I. Yamada, "A sparse system identification by using adaptively-weighted total variation via a primal-dual splitting approach, " in Proc. Int. Conf. Acoustics, Speech Signal Processing, Vancouver, Canada, 26-31 May 2013, pp. 6029-6033.
103. I. Bayram and O. D. Akyildiz, "Primal-dual algorithms for audio decomposition using mixed norms, " Signal Image Video Process., vol. 8, no. 1, pp. 95-110, Jan. 2014.
104. N. Papadakis, G. Peyré, and E. Oudet, "Optimal transport with proximal splitting, " SIAM J. Imaging Sci., vol. 7, no. 1, pp. 212-238, 2014.
105. N. Pustelnik, P. Borgnat, and P. Flandrin, "Empirical Mode Decomposition revisited by multicomponent nonsmooth convex optimization, " Signal Process., vol. 102, pp. 313-331, Sept. 2014.
106. M.-Q. Pham, C. Chaux, L. Duval, and J.-C. Pesquet, "Sparse template-based adaptive filtering with a primal-dual proximal algorithm: Application to seismic multiple removal, " IEEE Trans. Signal Processing, vol. 62, no. 16, pp. 4256-4269, Aug. 2014.
107. G. Moerkotte, M. Montag, A. Repetti, and G. Steidl. (2015). Proximal operator of quotient functions with application to a feasibility problem in query optimization. J. Comput. Appl. Math. [Online]. Available: http://hal.archives-ouvertes.fr/ docs/00/94/24/53/PDF/Quotient Functions.pdf
108. Z. J. Towfic and A. H. Sayed. (2015). Stability and performance limits of adaptive primal-dual networks. IEEE Trans. Signal Processing, [Online]. Available: http://arxiv.org/pdf/1408.3693.pdf
109. J. H. Kappes, B. Andres, F. A. Hamprecht, C. Schnörr, S. Nowozin, D. Batra, S. Kim, B. X. Kausler, et al., "A comparative study of modern inference techniques for discrete energy minimization problems, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Portland, OR, USA, 25-27 June 2013, pp. 1328-1335.
110. R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother, "A comparative study of energy minimization methods for Markov random fields with smoothness-based priors, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 6, pp. 1068-1080, June 2008.
111. Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
112. P. Strandmark, F. Kahl, and T. Schoenemann, "Parallel and distributed vision algorithms using dual decomposition, " Computer Vision and Image Understanding, vol. 115, no. 12, pp. 1721-1732, 2011.
113. S. Vicente, V. Kolmogorov, and C. Rother, "Joint optimization of segmentation and appearance models, " in Proc. IEEE Int. Conf. Computer Vision, Kyoto, Japan, 29 Sept.-2 Oct. 2009, pp. 755-762.
114. T. Pock, A. Chambolle, D. Cremers, and H. Bischof, "A convex relaxation approach for computing minimal partitions, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Miami, FL, USA, 20-25 June 2009, pp. 810-817.
115. O. J. Woodford, C. Rother, and V. Kolmogorov, "A global perspective on MAP inference for low-level vision, " in Proc. IEEE Int. Conf. Computer Vision, Kyoto, Japan, 27 Sept.-4 Oct. 2009, pp. 2319-2326.
116. D. Cremers, P. Thomas, K. Kolev, and A. Chambolle, "Convex relaxation techniques for segmentation, stereo and multiview reconstruction, " in Markov Random Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother, Eds. Boston: MIT, 2011, pp. 185-200.
117. C. Hane, C. Zach, A. Cohen, R. Angst, and M. Pollefeys, "Joint 3D scene reconstruction and class segmentation, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Portland, OR, USA, 25-27 June 2013, pp. 97-104.
118. L. Torresani, V. Kolmogorov, and C. Rother, "A dual decomposition approach to feature correspondence, " IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 2, pp. 259-271, Feb. 2013.
119. Y Zeng, C. Wang, Y. Wang, X. Gu, D. Samaras, and N. Paragios, "Intrinsic dense 3D surface tracking, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Colorado Springs, CO, 21-23 June 2011, pp. 1225-1232.
120. B. Glocker, N. Paragios, N. Komodakis, G. Tziritas, and N. Navab, "Optical flow estimation with uncertainties through dynamic MRFs, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Anchorage, AK, USA, 23-28 June 2008, pp. 1-8.
121. M. P. Kumar and D. Koller, "Efficiently selecting regions for scene understanding, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, San Francisco, CA, USA, 13-18 June 2010, pp. 3217-3224.
122. N. Komodakis and N. Paragios, "MRF-based blind image deconvolution, " in Proc. Asian Conf. Computer Vision, Daejeon, Korea, 5-9 Nov. 2012, pp. 361-374.
123. V. Kolmogorov and A. Shioura, "New algorithms for convex cost tension problem with application to computer vision, " Discrete Optim., vol. 6, no. 4, pp. 378-393, 2009.
124. D. Batra, P. Yadollahpour, A. Guzman-Rivera, and G. Shakhnarovich, " Diverse m-best solutions in Markov random fields, " in Proc. European Conf. Computer Vision, Florence, Italy, 7-13 Oct. 2012, pp. 1-16.
125. D. Tsai, M. Flagg, A. Nakazawa, and J. M. Rehg, "Motion coherent tracking using multi-label MRF optimization, " Int. J. Comp. Vis., vol. 100, no. 2, pp. 190-202, Nov. 2012.
126. N. Komodakis, G. Tziritas, and N. Paragios, "Performance vs computational efficiency for optimizing single and dynamic MRFs: Setting the state of the art with primal-dual strategies, " Comput. Vis. Image Understand., vol. 112, no. 1, pp. 14-29, Oct. 2008.
127. B. Glocker, N. Komodakis, G. Tziritas, N. Navab, and N. Paragios, "Dense image registration through MRFs and efficient linear programming, " Med. Image Anal., vol. 12, no. 6, pp. 731-741, Dec. 2008.
128. B. Glocker, A. Sotiras, N. Paragios, and N. Komodakis, "Deformable medical image registration: setting the state of the art with discrete methods, " Annu. Rev. Biomed. Eng., vol. 13, pp. 219-244, Aug. 2011.
129. D. Rueckert, L. I. Sonoda, C. Hayes, D. L. G. Hill, M. O. Leach, and D. J. Hawkes, "Nonrigid registration using free-form deformations: Application to breast MR images, " IEEE Trans. Med. Imag., vol. 18, no. 8, pp. 712-721, Aug. 1999.
130. T. Pock, T. Schoenemann, G. Graber, H. Bischof, and D. Cremers, "A convex formulation of continuous multi-label problems, " in Proc. European Conf. Computer Vision, Marseille, France, 12-18 Oct. 2008, pp. 792-805.
131. N. Komodakis and N. Paragios, "Beyond pairwise energies: Efficient optimization for higher-order MRFs, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Miami, FL, USA, 20-25 June 2009, pp. 2985-2992.
132. A. Fix, C. Wang, and R. Zabih, "A primal-dual method for higher-order multilabel Markov random fields, " in Proc. IEEE Conf. Computer Vision and Pattern Recognition, Columbus, OH, USA, 23-28 June 2014, pp. 1138-1145.
133. C. Arora, S. Banerjee, P. Kalra, and S. N. Maheshwari, "Generic cuts: An efficient algorithm for optimal inference in higher order MRF-MAP, " in Proc. European Conf. Computer Vision, Florence, Italy, 7-13 Oct. 2012, pp. 17-30.