Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms

Abstract In this paper, we study the alternating CQ algorithm for solving the split equality problem in Hilbert spaces. It is, however, not easy to implement since its selection of the stepsize requires prior information on the norms of bounded linear operators. To avoid this difficulty, we propose...

Full description

Bibliographic Details
Main Authors: Hai Yu, Fenghui Wang
Format: Article
Language:English
Published: SpringerOpen 2020-08-01
Series:Journal of Inequalities and Applications
Subjects:
Online Access:http://link.springer.com/article/10.1186/s13660-020-02480-z
_version_ 1818449265666555904
author Hai Yu
Fenghui Wang
author_facet Hai Yu
Fenghui Wang
author_sort Hai Yu
collection DOAJ
description Abstract In this paper, we study the alternating CQ algorithm for solving the split equality problem in Hilbert spaces. It is, however, not easy to implement since its selection of the stepsize requires prior information on the norms of bounded linear operators. To avoid this difficulty, we propose several modified algorithms in which the selection of the stepsize is independent of the norms. In particular, we consider the case whenever the convex sets involved are level sets of given convex functions.
first_indexed 2024-12-14T20:32:40Z
format Article
id doaj.art-c936eabd82ff482f923559d107708d22
institution Directory Open Access Journal
issn 1029-242X
language English
last_indexed 2024-12-14T20:32:40Z
publishDate 2020-08-01
publisher SpringerOpen
record_format Article
series Journal of Inequalities and Applications
spelling doaj.art-c936eabd82ff482f923559d107708d222022-12-21T22:48:30ZengSpringerOpenJournal of Inequalities and Applications1029-242X2020-08-012020111410.1186/s13660-020-02480-zAlternating iterative algorithms for the split equality problem without prior knowledge of operator normsHai Yu0Fenghui Wang1Department of Mathematics, Luoyang Normal UniversityDepartment of Mathematics, Luoyang Normal UniversityAbstract In this paper, we study the alternating CQ algorithm for solving the split equality problem in Hilbert spaces. It is, however, not easy to implement since its selection of the stepsize requires prior information on the norms of bounded linear operators. To avoid this difficulty, we propose several modified algorithms in which the selection of the stepsize is independent of the norms. In particular, we consider the case whenever the convex sets involved are level sets of given convex functions.http://link.springer.com/article/10.1186/s13660-020-02480-zSplit equality problemAlternating CQ algorithmVariable stepsize
spellingShingle Hai Yu
Fenghui Wang
Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
Journal of Inequalities and Applications
Split equality problem
Alternating CQ algorithm
Variable stepsize
title Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
title_full Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
title_fullStr Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
title_full_unstemmed Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
title_short Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
title_sort alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
topic Split equality problem
Alternating CQ algorithm
Variable stepsize
url http://link.springer.com/article/10.1186/s13660-020-02480-z
work_keys_str_mv AT haiyu alternatingiterativealgorithmsforthesplitequalityproblemwithoutpriorknowledgeofoperatornorms
AT fenghuiwang alternatingiterativealgorithmsforthesplitequalityproblemwithoutpriorknowledgeofoperatornorms