An Inertial Forward-Backward Algorithm for Monotone Inclusions

By Dirk A. Lorenz, Thomas Pock. Journal of Mathematical Imaging and Vision, 2014

506 citations recorded by the source corpus.

In this paper, we propose an inertial forward-backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method of Nesterov, but can be applied to a much larger class of problems including convex-concave saddle point problems and general monotone inclusions. We prove convergence of the algorithm in a Hilbert space setting and show that several recently proposed first-order methods can be obtained as special cases of the general algorithm. Numerical results show that the proposed algorithm converges faster than existing methods, while keeping the computational cost of each iteration basically unchanged.

Subfields: Computational Mechanics, Computational Theory and Mathematics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/163ccff8f6da25cec5e649e8aceab33e8ab42720

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Mechanics

  1. Ming Yan
  2. Wotao Yin
  3. Kun Yuan
  4. Laurent Condat
  5. Antonin Chambolle
  6. Yekini Shehu
  7. Qing Ling
  8. Akira Hirabayashi

In Computational Theory and Mathematics

  1. Ming Yan
  2. Antonin Chambolle
  3. Yekini Shehu
  4. Wotao Yin
  5. Oluwatosin Temitope Mewomo
  6. Lateef Olakunle Jolaoso
  7. Hédy Attouch
  8. Sun Young Cho

In Mathematical Physics

  1. Wotao Yin
  2. Ming Yan
  3. Yekini Shehu
  4. Laurent Condat
  5. Tang Bing
  6. Sun Young Cho
  7. Hédy Attouch
  8. Prasit Cholamjiak

Citations in the corpus