Uniform convergence for multi-valued algorithms
In a Banach space setting abstract algorithms are studied for finding a fixed point of the multivalued one-parametric generating operator with weakly compact values. To this end abstract algorithms with disturbances are considered while the disturbances of the algorithm are possibly considered as a control of the iterative process or as an error of the approximate calculations. Known sufficient conditions for the convergence and keeping the convergence rate of undisturbed algorithms with single-valued generating operator are generalized for those with disturbed multivalued generating operator and a comparative study of a set of sufficient conditions are carried out. These theoretical results as applied to unconstrained nonlinear optimization problems are presented.
- scientific article; zbMATH DE number 4123202
- Convergence of iterative algorithms for multivalued mappings in Banach spaces
- scientific article; zbMATH DE number 3842708
- Convergence of an iterative algorithm for computing parameters of multi-valued threshold functions
- Convergence of r-algorithms
- On the complexity of a unified convergence analysis for iterative methods
- Convergence of an iterative scheme for multifunctions
- scientific article; zbMATH DE number 1203242
- On Convergence Properties of Algorithms for Unconstrained Minimization
- On the optimal convergence rate of universal and nonuniversal algorithms for multivariate integration and approximation
This page was built for publication: Uniform convergence for multi-valued algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386799)
