An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets

The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto the closed convex sets, and it does not require...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Huijuan Jia, Shufen Liu, Yazheng Dang
Formato: article
Lenguaje:EN
Publicado: Hindawi Limited 2021
Materias:
Acceso en línea:https://doaj.org/article/115e672229be40b891a60191d9d02a2c
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:115e672229be40b891a60191d9d02a2c
record_format dspace
spelling oai:doaj.org-article:115e672229be40b891a60191d9d02a2c2021-11-15T01:19:19ZAn Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets2314-478510.1155/2021/6252984https://doaj.org/article/115e672229be40b891a60191d9d02a2c2021-01-01T00:00:00Zhttp://dx.doi.org/10.1155/2021/6252984https://doaj.org/toc/2314-4785The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto the closed convex sets, and it does not require calculating matrix inverse. To accelerate the convergence, the algorithm adopts self-adaptive rules and incorporates inertial technique. The strong convergence is shown under some suitable conditions. In addition, some newly derived results are presented for solving the split feasibility problem and split feasibility problem with multiple output sets. Finally, numerical experiments illustrate that the algorithm converges more quickly than some existing algorithms. Our results extend and improve some methods in the literature.Huijuan JiaShufen LiuYazheng DangHindawi LimitedarticleMathematicsQA1-939ENJournal of Mathematics, Vol 2021 (2021)
institution DOAJ
collection DOAJ
language EN
topic Mathematics
QA1-939
spellingShingle Mathematics
QA1-939
Huijuan Jia
Shufen Liu
Yazheng Dang
An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
description The paper proposes an inertial accelerated algorithm for solving split feasibility problem with multiple output sets. To improve the feasibility, the algorithm involves computing of projections onto relaxed sets (half spaces) instead of computing onto the closed convex sets, and it does not require calculating matrix inverse. To accelerate the convergence, the algorithm adopts self-adaptive rules and incorporates inertial technique. The strong convergence is shown under some suitable conditions. In addition, some newly derived results are presented for solving the split feasibility problem and split feasibility problem with multiple output sets. Finally, numerical experiments illustrate that the algorithm converges more quickly than some existing algorithms. Our results extend and improve some methods in the literature.
format article
author Huijuan Jia
Shufen Liu
Yazheng Dang
author_facet Huijuan Jia
Shufen Liu
Yazheng Dang
author_sort Huijuan Jia
title An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
title_short An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
title_full An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
title_fullStr An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
title_full_unstemmed An Inertial Accelerated Algorithm for Solving Split Feasibility Problem with Multiple Output Sets
title_sort inertial accelerated algorithm for solving split feasibility problem with multiple output sets
publisher Hindawi Limited
publishDate 2021
url https://doaj.org/article/115e672229be40b891a60191d9d02a2c
work_keys_str_mv AT huijuanjia aninertialacceleratedalgorithmforsolvingsplitfeasibilityproblemwithmultipleoutputsets
AT shufenliu aninertialacceleratedalgorithmforsolvingsplitfeasibilityproblemwithmultipleoutputsets
AT yazhengdang aninertialacceleratedalgorithmforsolvingsplitfeasibilityproblemwithmultipleoutputsets
AT huijuanjia inertialacceleratedalgorithmforsolvingsplitfeasibilityproblemwithmultipleoutputsets
AT shufenliu inertialacceleratedalgorithmforsolvingsplitfeasibilityproblemwithmultipleoutputsets
AT yazhengdang inertialacceleratedalgorithmforsolvingsplitfeasibilityproblemwithmultipleoutputsets
_version_ 1718428966166986752