Extended forward–backward algorithm

We propose an extended forward–backward algorithm for approximating a zero of a maximal monotone operator which can be split as the extended sum of two maximal monotone operators. We establish the weak convergence in average of the sequence generated by the algorithm under assumptions similar to those used in classical forward–backward algorithms. This provides as a special case an algorithm for solving convex constrained minimization problems without qualification condition.