Strong convergence of a km iterative algorithm for computing a split common fixed-point of quasi-nonexpansive operators
MetadataShow full item record
A modified Krasnoselski-Mann iterative algorithm is proposed for solving the split common fixed-point problem for quasi-nonexpansive operators. A parameter sequence is introduced to enhance convergence. It is shown that the proposed iterative algorithm strongly converges to a split common fixed-point in Hilbert spaces. This result extends the applicability of the KM algorithm.
Showing items related by title, author, creator and subject.
Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithmsSrar, Jalal Abdulsayed (2011)In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
A strategy of global convergence for the affine scaling algorithm for convex semidefinite programmingQian, X.; Liao, L.; Sun, Jie (2018)The affine scaling algorithm is one of the earliest interior point methods developed for linear programming. This algorithm is simple and elegant in terms of its geometric interpretation, but it is notoriously difficult ...
Sun, H.; Liu, Wan-Quan; Teng, Y. (2016)© The Institution of Engineering and Technology 2016.In this study, the authors aim to study explicit iterative algorithms for solving coupled discrete-time Lyapunov matrix equations. First, an explicit iterative algorithm ...