We present necessary conditions for monotonicity of fixed point iterations of mappings that may violate the usual nonexpansive property. Notions of linear-type monotonicity of fixed point sequences—weaker than Fejér monotonicity—are shown to imply metric subregularity. This, together with the almost averaging property recently introduced by Luke et al. (Math Oper Res, 2018. https://doi.org/10.1287/moor.2017.0898), guarantees linear convergence of the sequence to a fixed point. We specialize these results to the alternating projections iteration where the metric subregularity property takes on a distinct geometric characterization of sets at points of intersection called subtransversality. Subtransversality is shown to be necessary for linea...
We introduce an iteration scheme for nonexpansive mappings in a Hilbert space and prove that the ite...
In this paper we introduce an iterative process for finding a common element of the set of fixed poi...
An iterative process is considered for finding a common element in the fixed point set of a strict ...
We present necessary conditions for monotonicity of fixed point iterations of mappings that may viol...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
We consider the popular and classical method of alternating projections for finding a point in the i...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
We provide in a unified way quantitative forms of strong convergence results for numerous it-erative...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
A global convergence theory for a broad class of "monotonic" nonlinear programming algorithms is giv...
In this thesis, we first obtain coincidence and common fixed point theorems for a pair of generalize...
We introduce an iteration scheme for nonexpansive mappings in a Hilbert space and prove that the ite...
In this paper we introduce an iterative process for finding a common element of the set of fixed poi...
An iterative process is considered for finding a common element in the fixed point set of a strict ...
We present necessary conditions for monotonicity of fixed point iterations of mappings that may viol...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
International audienceThe idea of a finite collection of closed sets having "linearly regular interse...
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
Abstract The idea of a finite collection of closed sets having “linearly regular inter-section ” at ...
We consider the popular and classical method of alternating projections for finding a point in the i...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
We provide in a unified way quantitative forms of strong convergence results for numerous it-erative...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projec...
A global convergence theory for a broad class of "monotonic" nonlinear programming algorithms is giv...
In this thesis, we first obtain coincidence and common fixed point theorems for a pair of generalize...
We introduce an iteration scheme for nonexpansive mappings in a Hilbert space and prove that the ite...
In this paper we introduce an iterative process for finding a common element of the set of fixed poi...
An iterative process is considered for finding a common element in the fixed point set of a strict ...