Maximally monotone operators play a key role in modern optimization and
variational analysis. Two useful subclasses are rectangular (also known as star
monotone) and paramonotone operators, which were introduced by Brezis and
Haraux, and by Censor, Iusem and Zenios, respectively. The former class has
useful range properties while the latter class is of importance for interior
point methods and duality theory.
The demiclosedness principle is one of the key tools in nonlinear analysis
and fixed point theory. In this note, this principle is extended and made more
flexible by two mutually orthogonal affine subspaces. Versions for finitely
many (firmly) nonexpansive operators are presented. As an application, a simple
proof of the weak convergence of the Douglas-Rachford splitting algorithm is
provided.
The notion of a firmly nonexpansive mapping is central in fixed point theory
because of attractive convergence properties for iterates and the
correspondence with maximal monotone operators due to Minty. In this paper, we
systematically analyze the relationship between properties of firmly
nonexpansive mappings and associated maximal monotone operators. Dual and
self-dual properties are also identified. The results are illustrated through
several examples.
The proximal average of two convex functions has proven to be a useful tool
in convex analysis. In this note, we express Goebel's self-dual smoothing
operator in terms of the proximal average, which allows us to give a simple
proof of self duality. We also provide a novel self-dual smoothing operator.
Both operators are illustrated by smoothing the norm.
We show that the set of fixed points of the average of two resolvents can be
found from the set of fixed points for compositions of two resolvents
associated with scaled monotone operators. Recently, the proximal average has
attracted considerable attention in convex analysis. Our results imply that the
minimizers of proximal-average functions can be found from the set of fixed
points for compositions of two proximal mappings associated with scaled convex
functions.
The most important open problem in Monotone Operator Theory concerns the
maximal monotonicity of the sum of two maximal monotone operators provided that
Rockafellar's constraint qualification holds.
In this note, we provide a new maximal monotonicity result for the sum of a
maximal monotone relation and the subdifferential operator of a proper, lower
semicontinuous, sublinear function. The proof relies on Rockafellar's formula
for the Fenchel conjugate of the sum as well as some results on the Fitzpatrick
function.
Monotone operators are of basic importance in optimization as they generalize
simultaneously subdifferential operators of convex functions and positive
semidefinite (not necessarily symmetric) matrices. In 1970, Asplund studied the
additive decomposition of a maximal monotone operator as the sum of a
subdifferential operator and an "irreducible" monotone operator. In 2007,
Borwein and Wiersma [SIAM J. Optim. 18 (2007), pp.
We define a new average - termed the resolvent average - for positive
semidefinite matrices. For positive definite matrices, the resolvent average
enjoys self-duality and it interpolates between the harmonic and the arithmetic
averages, which it approaches when taking appropriate limits. We compare the
resolvent average to the geometric mean. Some applications to matrix functions
are also given.
We define a new average - termed the resolvent average - for positive
semidefinite matrices. For positive definite matrices, the resolvent average
enjoys self-duality and it interpolates between the harmonic and the arithmetic
averages, which it approaches when taking appropriate limits. We compare the
resolvent average to the geometric mean. Some applications to matrix functions
are also given.
In this paper, we give two explicit examples of unbounded linear maximal
monotone operators. The first unbounded linear maximal monotone operator $S$ on
$\ell^{2}$ is skew. We show its domain is a proper subset of the domain of its
adjoint $S^*$, and $-S^*$ is not maximal monotone. This gives a negative answer
to a recent question posed by Svaiter. The second unbounded linear maximal
monotone operator is the inverse Volterra operator $T$ on $L^{2}[0,1]$.
In this paper, we give two explicit examples of unbounded linear maximal
monotone operators. The first unbounded linear maximal monotone operator $S$ on
$\ell^{2}$ is skew. We show its domain is a proper subset of the domain of its
adjoint $S^*$, and $-S^*$ is not maximal monotone. This gives a negative answer
to a recent question posed by Svaiter. The second unbounded linear maximal
monotone operator is the inverse Volterra operator $T$ on $L^{2}[0,1]$.
We systematically investigate the farthest distance function, farthest
points, Klee sets, and Chebyshev centers, with respect to Bregman distances
induced by Legendre functions. These objects are of considerable interest in
Information Geometry and Machine Learning; when the Legendre function is
specialized to the energy, one obtains classical notions from Approximation
Theory and Convex Analysis.