Relaxed Algorithm for Solving the Split Feasibility Problem with Para-Monotone Equilibrium and Convex Optimization
- Resource Type
- Conference
- Authors
- Zhou, Xueling; Li, Meixia
- Source
- 2019 4th International Conference on Mechanical, Control and Computer Engineering (ICMCCE) Mechanical, Control and Computer Engineering (ICMCCE), 2019 4th International Conference on. :958-9584 Oct, 2019
- Subject
- Computing and Processing
Convergence
Convex functions
Hilbert space
Optimization
Two dimensional displays
STEM
component
split feasibility problem
para monotone equilibrium
relaxed algorithm
strong convergence
- Language
In this article, we propose a relaxed algorithm for the split feasibility problem involving para-monotone equilibrium and convex optimization, which doesn't need the information of the operator norm. It improves the feasibility and application range of the algorithm. And we prove the strong convergence of the algorithm.