相关论文: Convergence of Proximal Splitting Algorithms in CA…

We show that the effects of finite-precision arithmetic in forming and solving the linear system that arises at each iteration of primal-dual interior-point algorithms for nonlinear programming are benign, provided that the iterates satisfy…

For the inclusion problem involving two maximal monotone operators, under the metric subregularity of the composite operator, we derive the linear convergence of the generalized proximal point algorithm and several splitting algorithms,…

Composite optimization offers a powerful modeling tool for a variety of applications and is often numerically solved by means of proximal gradient methods. In this paper, we consider fully nonconvex composite problems under only local…

Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…

In this article, we derive a common fixed point result for a pair of single valued and set-valued mappings on a metric space having graphical structure. In this case, the set-valued map is assumed to be closed valued instead of closed and…

Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…

In this paper we generalize to unbounded convex subsets C of hyperbolic spaces results obtained by W.A. Kirk and R. Espinola on approximate fixed points of nonexpansive mappings in product spaces $(C\times M)_\infty$, where M is a metric…

We use proof mining techniques to obtain a uniform rate of asymptotic regularity for the instance of the parallel algorithm used by L\'opez-Acedo and Xu to find common fixed points of finite families of $k$-strict pseudocontractive…

Convergence of the Kalman filter is best analyzed by studying the contraction of the Riccati map in the space of positive definite (covariance) matrices. In this paper, we explore how this contraction property relates to a more fundamental…

In this paper, we introduce the concept of cyclic orbital contraction mappings which generalizes the concept of cyclic contraction mappings. We establish the existence of best proximity point of these mappings in the framework of $CAT_p(0)$…

For a k-flat F inside a locally compact CAT(0)-space X, we identify various conditions that ensure that F bounds a (k+1)-dimensional half flat in X. Our conditions are formulated in terms of the ultralimit of X. As applications, we obtain…

This work investigates the properties of the proximity operator for quasar-convex functions and establishes the convergence of the proximal point algorithm to a global minimizer with a particular focus on its convergence rate. In…

This paper is concerned with convex composite minimization problems in a Hilbert space. In these problems, the objective is the sum of two closed, proper, and convex functions where one is smooth and the other admits a computationally…

The Krasnosel'ski\u\i-Mann algorithm is a well-known method for finding fixed points of a nonexpansive mapping with strong theoretical guarantees. However, there are practical large-scale problems to which this algorithm cannot be applied.…

We consider the problem of finding the minimizations of the sum of two convex functions and the composition of another convex function with a continuous linear operator from the view of fixed point algorithms based on proximity operators,…

We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a…

We provide in a unified way quantitative forms of strong convergence results for numerous iterative procedures which satisfy a general type of Fejer monotonicity where the convergence uses the compactness of the underlying set. These…

We introduce and analyze an abstract algorithm that aims to find the projection onto a closed convex subset of a Hilbert space. When specialized to the fixed point set of a quasi nonexpansive mapping, the required sufficient condition…

In this paper we present a systematic study of regular sequences of quasi-nonexpansive operators in Hilbert space. We are interested, in particular, in weakly, boundedly and linearly regular sequences of operators. We show that the type of…

This paper discusses discrete-time maps of the form $x(k + 1) = F(x(k))$, focussing on equilibrium points of such maps. Under some circumstances, Lefschetz fixed-point theory can be used to establish the existence of a single locally…