Convergence Theorems for a Class of Recursive Stochastic Algorithms

1995 ◽  
pp. 53-78
Author(s):  
Diego Moreno ◽  
Mark Walker
Keyword(s):  
Stochastic Algorithms ◽  
Convergence Theorems

STRONG AND Δ - CONVERGENCE THEOREMS USING MODIFIED PROXIMAL POINT ALGORITHM IN CAT(0) SPACES

2018 ◽  
Vol 7 (2) ◽  
pp. 8
Author(s):  
KUMAR DAS APURVA ◽  
DHAR DIWAN SHAILESH ◽  
DASHPUTRE SAMIR ◽  
◽  
◽  
...  
Keyword(s):  
Proximal Point Algorithm ◽  
Proximal Point ◽  
Convergence Theorems

A new algorithm for finding CRM-model coefficients

2019 ◽  
Vol 5 (3) ◽  
pp. 164-185 ◽  
Author(s):  
Alexander D. Bekman ◽  
Sergey V. Stepanov ◽  
Alexander A. Ruchkin ◽  
Dmitry V. Zelenin
Keyword(s):  
Approximate Solution ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Complex Form ◽  
Approximate Solutions ◽  
The Other ◽  
Programming Algorithm ◽  
Stochastic Algorithms ◽  
Large Set ◽  
Flow Rates

The quantitative evaluation of producer and injector well interference based on well operation data (profiles of flow rates/injectivities and bottomhole/reservoir pressures) with the help of CRM (Capacitance-Resistive Models) is an optimization problem with large set of variables and constraints. The analytical solution cannot be found because of the complex form of the objective function for this problem. Attempts to find the solution with stochastic algorithms take unacceptable time and the result may be far from the optimal solution. Besides, the use of universal (commercial) optimizers hides the details of step by step solution from the user, for example&nbsp;— the ambiguity of the solution as the result of data inaccuracy.<br> The present article concerns two variants of CRM problem. The authors present a new algorithm of solving the problems with the help of “General Quadratic Programming Algorithm”. The main advantage of the new algorithm is the greater performance in comparison with the other known algorithms. Its other advantage is the possibility of an ambiguity analysis. This article studies the conditions which guarantee that the first variant of problem has a unique solution, which can be found with the presented algorithm. Another algorithm for finding the approximate solution for the second variant of the problem is also considered. The method of visualization of approximate solutions set is presented. The results of experiments comparing the new algorithm with some previously known are given.

Convergence theorems for total asymptotically nonexpansive single-valued and quasi nonexpansive multi-valued mappings in hyperbolic spaces

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Preeyalak Chuadchawna ◽  
Ali Farajzadeh ◽  
Anchalee Kaewcharoen
Keyword(s):  
Fixed Point ◽  
Strong Convergence ◽  
Common Fixed Point ◽  
Hyperbolic Space ◽  
Hyperbolic Spaces ◽  
Iterative Sequence ◽  
Uniformly Convex ◽  
Convergence Theorems ◽  
Asymptotically Nonexpansive ◽  
Uniformly Convex Hyperbolic Space

Abstract In this paper, we discuss the Δ-convergence and strong convergence for the iterative sequence generated by the proposed scheme to approximate a common fixed point of a total asymptotically nonexpansive single-valued mapping and a quasi nonexpansive multi-valued mapping in a complete uniformly convex hyperbolic space. Finally, by giving an example, we illustrate our result.

scholarly journals A Class of Integral Operators that Fix Exponential Functions

2021 ◽  
Vol 18 (5) ◽  
Author(s):  
Carlo Bardaro ◽  
Ilaria Mantellini ◽  
Gumrah Uysal ◽  
Basar Yilmaz
Keyword(s):  
General Class ◽  
Pointwise Convergence ◽  
Type Theorem ◽  
Integral Operators ◽  
Exponential Functions ◽  
Convergence Theorems ◽  
Korovkin Type Theorem ◽  
Type Formula

AbstractIn this paper we introduce a general class of integral operators that fix exponential functions, containing several recent modified operators of Gauss–Weierstrass, or Picard or moment type operators. Pointwise convergence theorems are studied, using a Korovkin-type theorem and a Voronovskaja-type formula is obtained.

scholarly journals A New Family of High-Order Ehrlich-Type Iterative Methods

Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1855 ◽  
Author(s):  
Petko D. Proinov ◽  
Maria T. Vasileva
Keyword(s):  
Iterative Methods ◽  
Local Convergence ◽  
Semilocal Convergence ◽  
High Order ◽  
Convergence Theorems ◽  
New Family ◽  
Special Cases ◽  
Iteration Functions ◽  
Iteration Function ◽  
Local Convergence Analysis

One of the famous third-order iterative methods for finding simultaneously all the zeros of a polynomial was introduced by Ehrlich in 1967. In this paper, we construct a new family of high-order iterative methods as a combination of Ehrlich’s iteration function and an arbitrary iteration function. We call these methods Ehrlich’s methods with correction. The paper provides a detailed local convergence analysis of presented iterative methods for a large class of iteration functions. As a consequence, we obtain two types of local convergence theorems as well as semilocal convergence theorems (with computer verifiable initial condition). As special cases of the main results, we study the convergence of several particular iterative methods. The paper ends with some experiments that show the applicability of our semilocal convergence theorems.

Sign in / Sign up

Export Citation Format

Share Document