The multiple-sets splitting feasibility problem (MSSFP) is the extension of splitting feasibility problem. This problem has been widely used in visual neural network and fuzzy image processing system. In this article, we offer the regularization methods of the inertial relaxed CQ algorithm, where the choice of parameters is not related to the operator norm. Under certain conditions, the weak convergence of the sequences is proved. In addition, the convergence of the algorithm is verified by numerical experiments.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.