Some algorithms for classes of split feasibility problems involving paramonotone equilibria and convex optimization
Abstract In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization. The strong convergence of the proposed algorithm is presented. Second, we also revisit th...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-03-01
|
Series: | Journal of Inequalities and Applications |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s13660-019-2030-x |