Tseng type methods for inclusion and fixed point problems with applications

© 2019 by the authors. An algorithm is introduced to find an answer to both inclusion problems and fixed point problems. This algorithm is a modification of Tseng type methods inspired by Mann's type iteration and viscosity approximation methods. On certain conditions, the iteration obtained fr...

Full description

Saved in:

Bibliographic Details
Main Authors:	Raweerote Suparatulatorn, Anchalee Khemphet
Format:	Journal
Published:	2020
Subjects:	Mathematics
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079597922&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67891
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-67891
record_format	dspace
spelling	th-cmuir.6653943832-678912020-04-02T15:10:28Z Tseng type methods for inclusion and fixed point problems with applications Raweerote Suparatulatorn Anchalee Khemphet Mathematics © 2019 by the authors. An algorithm is introduced to find an answer to both inclusion problems and fixed point problems. This algorithm is a modification of Tseng type methods inspired by Mann's type iteration and viscosity approximation methods. On certain conditions, the iteration obtained from the algorithm converges strongly. Moreover, applications to the convex feasibility problem and the signal recovery in compressed sensing are considered. Especially, some numerical experiments of the algorithm are demonstrated. These results are compared to those of the previous algorithm. 2020-04-02T15:10:28Z 2020-04-02T15:10:28Z 2019-12-01 Journal 22277390 2-s2.0-85079597922 10.3390/MATH7121175 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079597922&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67891
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Mathematics
spellingShingle	Mathematics Raweerote Suparatulatorn Anchalee Khemphet Tseng type methods for inclusion and fixed point problems with applications
description	© 2019 by the authors. An algorithm is introduced to find an answer to both inclusion problems and fixed point problems. This algorithm is a modification of Tseng type methods inspired by Mann's type iteration and viscosity approximation methods. On certain conditions, the iteration obtained from the algorithm converges strongly. Moreover, applications to the convex feasibility problem and the signal recovery in compressed sensing are considered. Especially, some numerical experiments of the algorithm are demonstrated. These results are compared to those of the previous algorithm.
format	Journal
author	Raweerote Suparatulatorn Anchalee Khemphet
author_facet	Raweerote Suparatulatorn Anchalee Khemphet
author_sort	Raweerote Suparatulatorn
title	Tseng type methods for inclusion and fixed point problems with applications
title_short	Tseng type methods for inclusion and fixed point problems with applications
title_full	Tseng type methods for inclusion and fixed point problems with applications
title_fullStr	Tseng type methods for inclusion and fixed point problems with applications
title_full_unstemmed	Tseng type methods for inclusion and fixed point problems with applications
title_sort	tseng type methods for inclusion and fixed point problems with applications
publishDate	2020
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079597922&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67891
_version_	1681426718949113856

Tseng type methods for inclusion and fixed point problems with applications

Similar Items