An intermixed iteration for constrained convex minimization problem and split feasibility problem

Simple item page
dc.contributor.authorKanyanee Saechou
dc.contributor.authorAtid Kangtunyakarn
dc.date.accessioned2025-07-21T06:02:26Z
dc.date.issued2019-10-21
dc.description.abstractAbstract 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.
dc.identifier.doi10.1186/s13660-019-2222-4
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/8825
dc.subjectMinification
dc.subject.classificationOptimization and Variational Analysis
dc.titleAn intermixed iteration for constrained convex minimization problem and split feasibility problem
dc.typeArticle

Files

Collections

All