A Modified CQ Algorithm for Solving the Multiple-Sets Split Feasibility Problem and the Fixed Point Problem for Nonexpansive Mappings

Suparat Kesornprom, Nattawut Pholasa, Prasit Cholamjiak


In this work, we  propose a new relaxed CQ algorithm for solving the  multiple-sets split feasibility problem (MSFP) and the fixed point problem for nonexpansive mappings. We obtain  weak and strong convergence theorems of the proposed algorithm  in  Hilbert spaces. Finally, we provide numerical experiments to show the efficiency of our algorithm.

Full Text: PDF


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|