Enlargements have proven to be useful tools for studying maximally monotone mappings. It is therefore natural to ask in which cases the enlargement does not change the original mapping. Svaiter has recently characterized non-enlargeable operators in reflexive Banach spaces and has also given some partial results in the nonreflexive case. In the present paper, we provide another characterization...

Abstract. We propose a new class of primal-dual Fejér monotone algorithms for solving systems of composite monotone inclusions. Our construction is inspired by a framework used by Eckstein and Svaiter for the basic problem of finding a zero of the sum of two monotone operators. At each iteration, points in the graph of the monotone operators present in the model are used to construct a half-spa...

This paper is concerned with the study of a penalization-gradient algorithm for solving variational inequalities, namely, find x ∈ C such that 〈Ax, y − x〉 ≥ 0 for all y ∈ C, where A : H → H is a single-valued operator, C is a closed convex set of a real Hilbert space H. Given Ψ : H → ∪ { ∞} which acts as a penalization function with respect to the constraint x ∈ C, and a penalization parameter ...

This note is an addendum to Sum theorems for monotone operators and convex functions. In it, we prove some new results on convex functions and monotone operators, and use them to show that several of the constraint qualifications considered in the preceding paper are, in fact, equivalent. Introduction We continue with the notation and the numbering of [4]. For the moment, we shall assume that E...

In this article we study graph-distance convergence of monotone operators. First, we prove a property that has been an open problem up to now: the limit of a sequence of graph-distance convergent maximal monotone operators in a Hilbert space is a maximal monotone operator. Next, we show that a sequence of maximal monotone operators converging in the same sense in a reflexive Banach space is uni...