Photo by arnosenoner from unsplash
In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for… Click to show full abstract
In this paper, we first introduce the two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and also we prove a strong convergence theorem for the intermixed algorithm. By using our main theorem, we prove a strong convergence theorem for the split feasibility problem. Finally, we apply our main theorem for the numerical example.
Keywords:
intermixed iteration;
minimization problem;
split feasibility;
convex minimization;
constrained convex;
problem
Journal Title: Journal of Inequalities and Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Inequalities and Applications
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!