Generalized forward–backward splitting with penalization for monotone inclusion problems

Abstract

We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone operators and the normal cone to the nonempty set of zeros of another maximally monotone operator. We show weak ergodic convergence of the generated sequence of iterates to a solution of the considered monotone inclusion problem, provided that the condition corresponding to the Fitzpatrick function of the operator describing the set of the normal cone is fulfilled. Under strong monotonicity of an operator, we show strong convergence of the iterates. Furthermore, we utilize the proposed method for minimizing a largescale hierarchical minimization problem concerning the sum of differentiable and nondifferentiable convex functions subject to the set of minima of another differentiable convex function. We illustrate the functionality of the method through numerical experiments addressing constrained elastic net and generalized Heron location problems.Keywords Monotone operator · monotone inclusion · hierarchical optimization · forward-backward algorithm Mathematics Subject Classification (2010) 47H05 · 65K05 · 65K10 · 90C25

Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems

“…(ii) Note that the hypothesis (H3) is a relaxation of Assumption 4.1 (S3) in [22]. In fact, the superior limit in [22] is bounded above by 1 Lg , but in this work it can be extended to 2 Lg . This allows us to consider more larger parameters (α k ) k≥1 and (β k ) k≥1 .…”

“…Remark 6 Algorithm 1 is different from [22,Algorithm 3.1]. In fact, in our previous work, we consider the problem (1) in the sense that h = m i=1 h i and perform the gradient ∇h(x k ) at each iteration k. However, the iterative scheme proposed here allows us to perform the gradient ∇h i (ϕ i,k ) at each sub-iteration i.…”

“…(ii) One can also obtain a weak ergodic convergence of the sequence (x k ) k≥1 in a general setting of real Hilbert space by slightly modifying the proofs of Theorem 3.1 and Corollary 4.1 in [22].…”

The Lightly Robust Max-Ordering Solution Concept for Uncertain Multiobjective Optimization Problems: An Ambulance Location Problem with Unavailability

“…Another technique to consider the problem LRMOP (ŝ, ε) is a bilevel optimization. For more details, we refer the reader to see [26][27][28].…”