scholarly journals A Hybrid Forward–Backward Algorithm and Its Optimization Application

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 447
Author(s):  
Liya Liu ◽  
Xiaolong Qin ◽  
Jen-Chih Yao

In this paper, we study a hybrid forward–backward algorithm for sparse reconstruction. Our algorithm involves descent, splitting and inertial ideas. Under suitable conditions on the algorithm parameters, we establish a strong convergence solution theorem in the framework of Hilbert spaces. Numerical experiments are also provided to illustrate the application in the field of signal processing.

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 288 ◽  
Author(s):  
Yinglin Luo ◽  
Meijuan Shang ◽  
Bing Tan

In this paper, we propose viscosity algorithms with two different inertia parameters for solving fixed points of nonexpansive and strictly pseudocontractive mappings. Strong convergence theorems are obtained in Hilbert spaces and the applications to the signal processing are considered. Moreover, some numerical experiments of proposed algorithms and comparisons with existing algorithms are given to the demonstration of the efficiency of the proposed algorithms. The numerical results show that our algorithms are superior to some related algorithms.


2020 ◽  
Vol 16 (01) ◽  
pp. 89-103
Author(s):  
W. Cholamjiak ◽  
D. Yambangwai ◽  
H. Dutta ◽  
H. A. Hammad

In this paper, we introduce four new iterative schemes by modifying the CQ-method with Ishikawa and [Formula: see text]-iterations. The strong convergence theorems are given by the CQ-projection method with our modified iterations for obtaining a common fixed point of two [Formula: see text]-nonexpansive mappings in a Hilbert space with a directed graph. Finally, to compare the rate of convergence and support our main theorems, we give some numerical experiments.


Symmetry ◽  
2022 ◽  
Vol 14 (1) ◽  
pp. 123
Author(s):  
Vasile Berinde

For approximating the fixed points of enriched nonexpansive mappings in Hilbert spaces, we consider a modified Krasnosel’skiǐ–Mann algorithm for which we prove a strong convergence theorem. We also empirically compare the rate of convergence of the modified Krasnosel’skiǐ–Mann algorithm and of the simple Krasnosel’skiǐ fixed point algorithm. Based on the numerical experiments reported in the paper we conclude that, for the class of enriched nonexpansive mappings, it is more convenient to work with the simple Krasnosel’skiǐ fixed point algorithm than with the modified Krasnosel’skiǐ–Mann algorithm.


Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1884
Author(s):  
Suthep Suantai ◽  
Narin Petrot ◽  
Manatchanok Khonchaliew

This paper presents two inertial extragradient algorithms for finding a solution of split pseudomonotone equilibrium problems in the setting of real Hilbert spaces. The weak and strong convergence theorems of the introduced algorithms are presented under some constraint qualifications of the scalar sequences. The discussions on the numerical experiments are also provided to demonstrate the effectiveness of the proposed algorithms.


Author(s):  
Zhongbing Xie ◽  
Gang Cai ◽  
Xiaoxiao Li ◽  
Qiao-Li Dong

Abstract The purpose of this paper is to study a new Tseng’s extragradient method with two different stepsize rules for solving pseudomonotone variational inequalities in real Hilbert spaces. We prove a strong convergence theorem of the proposed algorithm under some suitable conditions imposed on the parameters. Moreover, we also give some numerical experiments to demonstrate the performance of our algorithm.


Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2103
Author(s):  
Bingnan Jiang ◽  
Yuanheng Wang ◽  
Jen-Chih Yao

In this paper, we construct two multi-step inertial regularized methods for hierarchical inequality problems involving generalized Lipschitzian and hemicontinuous mappings in Hilbert spaces. Then we present two strong convergence theorems and some numerical experiments to show the effectiveness and feasibility of our new iterative methods.


2016 ◽  
Vol 22 (1) ◽  
Author(s):  
Godwin Chidi Ugwunnadi

AbstractIn this paper, we studied the split equality problems (SEP) with a new proposed iterative algorithm and established the strong convergence of the proposed algorithm to solution of the split equality problems (SEP).


Sign in / Sign up

Export Citation Format

Share Document