相关论文: Compositions and Convex Combinations of Averaged N…

We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM…

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…

The averaged alternating modified reflections algorithm is a projection method for finding the closest point in the intersection of closed convex sets to a given point in a Hilbert space. In this work, we generalize the scheme so that it…

In the framework of a real Hilbert space, we address the problem of finding the zeros of the sum of a maximally monotone operator $A$ and a cocoercive operator $B$. We study the asymptotic behaviour of the trajectories generated by a second…

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…

In this paper, we propose a new general and stable fixed-point approach to compute the resolvents of the composition of a set-valued maximal monotone operator with a linear bounded mapping. Weak, strong and linear convergence of the…

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…

In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is…

We propose an algorithm for computing the proximity operator of a sum of composite convex functions in Hilbert spaces and investigate its asymptotic behavior. Applications to best approximation and image recovery are described.

Some identities for noncommutative perspectives of operator monotone functions in Hilbert spaces aregiven. Applications for weighted operator geometric mean and relative operator entropy are also provided.

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…

Monotone operators and (firmly) nonexpansive mappings are fundamental objects in modern analysis and computational optimization. Five years ago, it was shown that if finitely many firmly nonexpansive mappings have or "almost have" fixed…

In this paper, we propose a Tikhonov-like regularization for dynamical systems associated with non-expansive operators defined in closed and convex sets of a Hilbert space. We prove the well-posedness and the strong convergence of the…

We estimate convergence rates for fixed-point iterations of a class of nonlinear operators which are partially motivated from solving convex optimization problems. We introduce the notion of the generalized averaged nonexpansive (GAN)…

The forward-backward splitting algorithm is a popular operator-splitting method for solving monotone inclusion of the sum of a maximal monotone operator and a cocoercive operator. In this paper, we present a new convergence analysis of a…

We study distributed composite optimization over networks: agents minimize a sum of smooth (strongly) convex functions, the agents' sum-utility, plus a nonsmooth (extended-valued) convex one. We propose a general unified algorithmic…

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…

We study distributed composite optimization over networks: agents minimize the sum of a smooth (strongly) convex function, the agents' sum-utility, plus a non-smooth (extended-valued) convex one. We propose a general algorithmic framework…

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…

In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method…