Related papers: On the nonexpansive operators based on arbitrary m…
In the paper, we introduce several accelerate iterative algorithms for solving the multiple-set split common fixed-point problem of quasi-nonexpansive operators in real Hilbert space. Based on primal-dual method, we construct several…
We study the critical points over an algebraic variety of an optimization problem defined by a quadratic objective that is degenerate. This scenario arises in machine learning when the dataset size is small with respect to the model, and is…
Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper, we present a geometric approach to analyzing contractive and…
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged…
In this paper we propose new averaged iterative algorithms designed for solving a split common fixed-point problem in the class of demicontractive mappings. The algorithms are obtained by inserting an averaged term into the algorithms used…
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…
Many optimization algorithms$\unicode{x2013}$including gradient descent, proximal methods, and operator splitting techniques$\unicode{x2013}$can be formulated as fixed-point iterations (FPI) of continuous operators. When these operators are…
This paper proposes a data-driven approach for constructing firmly nonexpansive operators. We demonstrate its applicability in Plug-and-Play (PnP) methods, where classical algorithms such as Forward-Backward splitting, Chambolle-Pock…
In this paper we analyze a class of nonconvex optimization problem from the viewpoint of abstract convexity. Using the respective generalizations of the subgradient we propose an abstract notion proximal operator and derive a number of…
In this paper, we define the general framework to describe the diffusion operators associated to a positive matrix. We define the equations associated to diffusion operators and present some general properties of their state vectors. We…
Firmly nonexpansive operators arise naturally as resolvents of monotone operators and as generalizations of projections and proximal mappings in convex optimization and fixed point theory. While their iterates are known to converge weakly…
In this paper the degenerate preconditioned proximal point algorithm will be combined with the idea of varying preconditioners leading to the degenerate variable metric proximal point algorithm. The weak convergence of the resulting…
This paper presents a modified general viscosity iterative process designed to solve variational inclusion and fixed point problems involving multi-valued quasi-nonexpansive and demi-contractive operators. The modified iterative process…
Modern statistical applications often involve minimizing an objective function that may be nonsmooth and/or nonconvex. This paper focuses on a broad Bregman-surrogate algorithm framework including the local linear approximation, mirror…
Fixed point iterations play a central role in the design and the analysis of a large number of optimization algorithms. We study a new iterative scheme in which the update is obtained by applying a composition of quasinonexpansive operators…
Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analysis, discrete geometry and analytic number theory research.…
We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap…
By means of a fixed point method we discuss the deformation of operator means and multivariate means of positive definite matrices/operators. It is shown that the deformation of an operator mean becomes again an operator mean. The means…
We study the renormalized analytic torsion of complete manifolds with fibred boundary metrics, also referred to as $\phi$-metrics. We establish invariance of the torsion under suitable deformations of the metric, and establish a gluing…