Related papers: The resolvent average of monotone operators: domin…
We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…
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…
We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the…
Using the theory of Hilbert direct integrals, we introduce and study a monotonicity-preserving operation, termed the integral resolvent mixture. It combines arbitrary families of monotone operators acting on different spaces and linear…
The correspondence between the monotonicity of a (possibly) set-valued operator and the firm nonexpansiveness of its resolvent is a key ingredient in the convergence analysis of many optimization algorithms. Firmly nonexpansive operators…
Resolvent compositions were recently introduced as monotonicity-preserving operations that combine a set-valued monotone operator and a bounded linear operator. They generalize in particular the notion of a resolvent average. We analyze the…
Monotone operators, especially in the form of subdifferential operators, are of basic importance in optimization. It is well known since Minty, Rockafellar, and Bertsekas-Eckstein that in Hilbert space, monotone operators can be understood…
Properties of compositions and convex combinations of averaged nonexpansive operators are investigated and applied to the design of new fixed point algorithms in Hilbert spaces. An extended version of the forward-backward splitting…
Averaged operators are important in Convex Analysis and Optimization Algorithms. In this paper, we propose classifications of averaged operators, firmly nonexpansive operators, and proximal operators using the Bauschke-Bendit-Moursi modulus…
Several aspects of the interplay between monotone operator theory and convex optimization are presented. The crucial role played by monotone operators in the analysis and the numerical solution of convex minimization problems is emphasized.…
In this work, we construct a proximal average for two prox-bounded functions, which recovers the classical proximal average for two convex functions. The new proximal average transforms continuously in epi-topology from one proximal hull to…
Averaged operators have played an important role in fixed point theory in Hilbert spaces. They emerged as a necessity to obtain solutions to fixed point problems where the underlying operator is not contractive and thus renders Banach fixed…
While monotone operator theory is often studied on Hilbert spaces, many interesting problems in machine learning and optimization arise naturally in finite-dimensional vector spaces endowed with non-Euclidean norms, such as…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
A class of algorithms comprised by certain semismooth Newton and active-set methods is able to solve convex minimization problems involving sparsity-inducing regularizers very rapidly; the speed advantage of methods from this class is a…
This paper introduces a new definition of $\alpha$-monotone operators in real 2-uniformly convex and smooth Banach spaces. Based on this new definition, we establish several novel structural and analytical properties of such operators,…
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…
In this paper we introduce and study a class of structured set-valued operators which we call union averaged nonexpansive. At each point in their domain, the value of such an operator can be expressed as a finite union of single-valued…
We study nearly equal and nearly convex sets, ranges of maximally monotone operators, and ranges and fixed points of convex combinations of firmly nonexpansive mappings. The main result states that the range of an average of firmly…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…