AbstractSufficient conditions are compared for the convergence of abstract iteration schemes that consist of the recursive applications of nonstationary point-to-set mappings
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
In this article, we introduce new notions of convergence of directed families of points and converge...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
AbstractIn this paper the convergence of general iteration algorithms defined by point-to-set maps i...
AbstractThis paper gives necessary and sufficient conditions for extending a family of point-to-set ...
AbstractWe consider the iteration algorithm defined by xn+k = g[φ(xn, xn+1,…,xn+k−1)], n = 0,1,2,…, ...
AbstractA family of algorithms for nonlinear approximation is defined by point-to-setmaps. Then Zang...
The general iteration method for nonexpansive mappings on a Banach space is considered. Under some a...
AbstractWe introduce the notion of a general fixed point iteration scheme to unify various fixed poi...
A global convergence theory for a broad class of "monotonic" nonlinear programming algorithms is giv...
In the literature efficient algorithms have been described for calculating guaranteed inclusions for...
AbstractThe convergence of the iteration algorithm based on the algorithmic function x→αx + (1 − α)A...
AbstractWe discuss iterative methods of the form xn: = μ0Φ(xx − 1) + μ1xn − 1 + … + μkxn − k (n = k,...
We first synthesize and unify notions of regularity, both of individual functions/sets and of famili...
15 pagesInternational audienceIn a previous paper, an implementable algorithm was introduced to comp...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
In this article, we introduce new notions of convergence of directed families of points and converge...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
AbstractIn this paper the convergence of general iteration algorithms defined by point-to-set maps i...
AbstractThis paper gives necessary and sufficient conditions for extending a family of point-to-set ...
AbstractWe consider the iteration algorithm defined by xn+k = g[φ(xn, xn+1,…,xn+k−1)], n = 0,1,2,…, ...
AbstractA family of algorithms for nonlinear approximation is defined by point-to-setmaps. Then Zang...
The general iteration method for nonexpansive mappings on a Banach space is considered. Under some a...
AbstractWe introduce the notion of a general fixed point iteration scheme to unify various fixed poi...
A global convergence theory for a broad class of "monotonic" nonlinear programming algorithms is giv...
In the literature efficient algorithms have been described for calculating guaranteed inclusions for...
AbstractThe convergence of the iteration algorithm based on the algorithmic function x→αx + (1 − α)A...
AbstractWe discuss iterative methods of the form xn: = μ0Φ(xx − 1) + μ1xn − 1 + … + μkxn − k (n = k,...
We first synthesize and unify notions of regularity, both of individual functions/sets and of famili...
15 pagesInternational audienceIn a previous paper, an implementable algorithm was introduced to comp...
summary:The method of projections onto convex sets to find a point in the intersection of a finite n...
In this article, we introduce new notions of convergence of directed families of points and converge...
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-v...
DOI
Add to ORKG