Search

A large number of nonlinear and optimization problems can be reduced to altering point problems. This paper aims to introduce the parallel normal S-iteration technique and study its convergence rates for solving such problems in infinite-dimensional Hilbert spaces under practical assumptions. We place particular emphasis on the parallel splitting method for the sum of two maximal monotone operators and that can apply for solving a class of convex composite minimization problems. Moreover, we present applications of our iterative methods to some nonlinear problems, such as a system of variational inequalities and a system of inclusion problems. Finally, to demonstrate the applicability of the altering point technique, the performances of our proposed parallel normal S-iteration methods are presented through numerical experiments in signal recovery problems. [ABSTRACT FROM AUTHOR]

This paper studies the convergence rates of two accelerated computational methods without assuming nonexpansivity of the underlying operators with convex and affine domains in infinite-dimensional Hilbert spaces. One method is a noninertial method, and its convergence rate is estimated as R T , { x n } (n) = o 1 n in worst case. The other is an inertial method, and its convergence rate is estimated as R T , { y n } (n) = o 1 n under practical conditions. Then, we apply our results to give new results on convergence rates for solving generalized split common fixed-point problems for the class of demimetric operators. We also apply our results to variational inclusion problems and convex optimization problems. Our results significantly improve and/or develop previously discussed fixed-point problems and splitting problems and related algorithms. To demonstrate the applicability of our methods, we provide numerical examples for comparisons and numerical experiments on regression problems for publicly available high-dimensional real datasets taken from different application domains. [ABSTRACT FROM AUTHOR]

It is well known that the rate of convergence of 5-iteration process introduced by Agarwal et al. [J. Nonlinear Convex Anal., 8 (1) (2007), 61-79.] is faster than Picard iteration process for contraction operators. Following the ideas of S-iteration process, we introduce a parallel S-iteration process for finding altering points of nonlinear operators. We apply our algorithms to solve a system of operator equations in Banach space setting. This work also includes convergence analysis of hybrid steepest-descent-like method and hybrid Newton-like method in the context of altering points. [ABSTRACT FROM AUTHOR]

Based on a hybrid steepest‐descent method and a splitting method, we propose a variable metric iterative algorithm, which is useful in computing the elastic net solution. A solution theorem is established in the framework of Hilbert spaces. Numerical results are conducted on the signal processing to demonstrate the capacity and effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]