scholarly journals A Generalized Nonlinear Iterative Algorithm for the Explicit Midpoint Rule of Nonexpansive Semigroup

2020 ◽  
pp. 613-628
Author(s):  
Hamid Reza SAHEBİ ◽  
Mahdi CHERAGHİ ◽  
Masume CHERAGHİ
Keyword(s):  
Iterative Algorithm ◽  
Nonexpansive Semigroup ◽  
Midpoint Rule

scholarly journals A viscosity iterative algorithm for the optimization problem system

Filomat ◽  
2017 ◽  
Vol 31 (8) ◽  
pp. 2249-2266 ◽  
Author(s):  
H.R. Sahebi ◽  
S. Ebrahimi
Keyword(s):  
Variational Inequality ◽  
Fixed Points ◽  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Optimization Problem ◽  
Common Fixed Points ◽  
Numerical Results ◽  
Common Element ◽  
Nonexpansive Semigroup ◽  
Mixed Equilibrium Problem

In this paper, we suggest and analysis a viscosity iterative algorithm for finding a common element of the set of solution of a mixed equilibrium problem and the set the of solutions of a variational inequality and all common fixed points of a nonexpansive semigroup. This algorithm strongly converges to an element which solves an optimization problem system. Finally, some examples and numerical results are also given.

scholarly journals A Viscosity Iterative Algorithm Technique for Solving a General Equilibrium Problem System

2019 ◽  
Vol 50 (4) ◽  
pp. 391-408
Author(s):  
Mahdi Azhini ◽  
Masoumeh Cheraghi ◽  
Hamid reza Sahebi
Keyword(s):  
Hilbert Space ◽  
General Equilibrium ◽  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Equilibrium Problems ◽  
Recent Decade ◽  
Nonexpansive Semigroup ◽  
Numerical Examples ◽  
Common Solution ◽  
Iteration Methods

In the recent decade, a considerable number of Equilibrium problems havebeen solved successfully based on the iteration methods. In this paper, we suggest a viscosity iterative algorithm for nonexpansive semigroup in the framework  of Hilbert space. We  prove that, the sequence generated by this algorithm under the certain  conditions imposed on parameters  strongly convergence to a common solution of general equilibrium problem system. Results presented in this paper extend and unify the previously known  results announced by many other authors. Further, we give some numerical examples to justify our main results.

scholarly journals An explicit viscosity iterative algorithm for finding the solutions of a general equilibrium problem systems

2015 ◽  
Vol 46 (3) ◽  
pp. 193-216
Author(s):  
H. R. Sahebi ◽  
S. Ebrahimi
Keyword(s):  
General Equilibrium ◽  
Fixed Points ◽  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Convex Subset ◽  
Common Element ◽  
Nonexpansive Semigroup ◽  
Matlab Software ◽  
Numerical Examples

We suggest an explicit viscosity iterative algorithm for finding a common element of the set of solutions for an general equilibrium problem system (GEPS) involving a bifunction defined on a closed, convex subset and the set of fixed points of a nonexpansive semigroup on another one in Hilbert's spaces. Furthermore, we present some numerical examples(by using MATLAB software) to guarantee the main result of this paper.

scholarly journals An iterative algorithm for finding the solution of a general equilibrium problem system

Filomat ◽  
2014 ◽  
Vol 28 (7) ◽  
pp. 1393-1415 ◽  
Author(s):  
H.R. Sahebi ◽  
A. Razani
Keyword(s):  
Iterative Method ◽  
General Equilibrium ◽  
Fixed Points ◽  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Common Element ◽  
Nonexpansive Semigroup ◽  
Numerical Examples ◽  
New Iterative Method

In this paper, we introduce a new iterative method for finding a common element of the set of solution of a general equilibrium problem system (GEPS) and the set of fixed points of a nonexpansive semigroup. Furthermore, we present some numerical examples (by using MATLsoftware) to guarantee the main result of this paper.

Iterative criterion of the descriptor system asymptotic steadiness

2020 ◽  
Keyword(s):  
Iterative Algorithm ◽  
Search Algorithm ◽  
Descriptor System ◽  
Matrix Sign Function ◽  
Sign Function ◽  
Generalized Matrix ◽  
Criterion Matrix

An iterative criterion for the asymptotic steadiness of a linear descriptor system is considered. The criterion is based on an iterative algorithm for computing a generalized matrix sign-function. As an example, the problem of analyzing the asymptotic steadiness of a large descriptor system is given. Keywords linear descriptor system; steadiness criterion; matrix sign-function; search algorithm

Combined Iterative Algorithm for Multilevel Coded UWB Communications Systems

2011 ◽  
Vol 30 (7) ◽  
pp. 1562-1565
Author(s):  
Shuang-cheng Deng ◽  
Jin-jun Xie ◽  
Bao-ming Bai ◽  
Xin-mei Wang
Keyword(s):  
Iterative Algorithm ◽  
Communications Systems

Iterative algorithm for a split equilibrium problem and fixed problem for finite asymptotically nonexpansive mappings in Hlbert space

Filomat ◽  
2017 ◽  
Vol 31 (5) ◽  
pp. 1423-1434 ◽  
Author(s):  
Sheng Wang ◽  
Min Chen
Keyword(s):  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Common Element ◽  
Fixed Point Set ◽  
Split Equilibrium Problem ◽  
Asymptotically Nonexpansive Mappings ◽  
Asymptotically Nonexpansive ◽  
Point Set ◽  
The Common

In this paper, we propose an iterative algorithm for finding the common element of solution set of a split equilibrium problem and common fixed point set of a finite family of asymptotically nonexpansive mappings in Hilbert space. The strong convergence of this algorithm is proved.

scholarly journals Convergence rate analysis of an iterative algorithm for solving the multiple-sets split equality problem

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Shijie Sun ◽  
Meiling Feng ◽  
Luoyi Shi
Keyword(s):  
Convergence Rate ◽  
Iterative Algorithm ◽  
Sufficient Conditions ◽  
Linear Convergence ◽  
Regularity Property ◽  
Step Size ◽  
Bounded Linear ◽  
Split Equality Problem ◽  
Linear Convergence Rate ◽  
Equality Problem

Abstract This paper considers an iterative algorithm of solving the multiple-sets split equality problem (MSSEP) whose step size is independent of the norm of the related operators, and investigates its sublinear and linear convergence rate. In particular, we present a notion of bounded Hölder regularity property for the MSSEP, which is a generalization of the well-known concept of bounded linear regularity property, and give several sufficient conditions to ensure it. Then we use this property to conclude the sublinear and linear convergence rate of the algorithm. In the end, some numerical experiments are provided to verify the validity of our consequences.

Sign in / Sign up

Export Citation Format

Share Document