A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem
This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2012/207323 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551985062084608 |
|---|---|
| author | Yazheng Dang Yan Gao Yanli Han |
| author_facet | Yazheng Dang Yan Gao Yanli Han |
| author_sort | Yazheng Dang |
| collection | DOAJ |
| description | This paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. Under some suitable conditions, we show the asymptotic convergence. The results improve and extend the algorithms presented in Byrne (2002) and in Zhao and Yang (2005) and the related convergence theorem. |
| format | Article |
| id | doaj-art-e12b64e262424e1ea8d2a5743f9834c6 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-e12b64e262424e1ea8d2a5743f9834c62025-02-03T05:59:54ZengWileyJournal of Applied Mathematics1110-757X1687-00422012-01-01201210.1155/2012/207323207323A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility ProblemYazheng Dang0Yan Gao1Yanli Han2School of Management, University of Shanghai for Science and Technology, 516 Jungong Road, Shanghai 200093, ChinaSchool of Management, University of Shanghai for Science and Technology, 516 Jungong Road, Shanghai 200093, ChinaSchool of Management, University of Shanghai for Science and Technology, 516 Jungong Road, Shanghai 200093, ChinaThis paper deals with the split feasibility problem that requires to find a point closest to a closed convex set in one space such that its image under a linear transformation will be closest to another closed convex set in the image space. By combining perturbed strategy with inertial technique, we construct an inertial perturbed projection algorithm for solving the split feasibility problem. Under some suitable conditions, we show the asymptotic convergence. The results improve and extend the algorithms presented in Byrne (2002) and in Zhao and Yang (2005) and the related convergence theorem.http://dx.doi.org/10.1155/2012/207323 |
| spellingShingle | Yazheng Dang Yan Gao Yanli Han A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem Journal of Applied Mathematics |
| title | A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem |
| title_full | A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem |
| title_fullStr | A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem |
| title_full_unstemmed | A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem |
| title_short | A Perturbed Projection Algorithm with Inertial Technique for Split Feasibility Problem |
| title_sort | perturbed projection algorithm with inertial technique for split feasibility problem |
| url | http://dx.doi.org/10.1155/2012/207323 |
| work_keys_str_mv | AT yazhengdang aperturbedprojectionalgorithmwithinertialtechniqueforsplitfeasibilityproblem AT yangao aperturbedprojectionalgorithmwithinertialtechniqueforsplitfeasibilityproblem AT yanlihan aperturbedprojectionalgorithmwithinertialtechniqueforsplitfeasibilityproblem AT yazhengdang perturbedprojectionalgorithmwithinertialtechniqueforsplitfeasibilityproblem AT yangao perturbedprojectionalgorithmwithinertialtechniqueforsplitfeasibilityproblem AT yanlihan perturbedprojectionalgorithmwithinertialtechniqueforsplitfeasibilityproblem |