An inertial method for solving generalized split feasibility problems over the solution set of monotone variational inclusions
In this paper, we propose a new inertial extrapolation method for solving the generalized split feasibility problems over the solution set of monotone variational inclusion problems in real Hilbert spaces. We prove that the proposed method converges strongly to a solution to the aforementioned probl...
Saved in:
Published in | Optimization Vol. 71; no. 3; pp. 583 - 611 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Philadelphia
Taylor & Francis
04.03.2022
Taylor & Francis LLC |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | In this paper, we propose a new inertial extrapolation method for solving the generalized split feasibility problems over the solution set of monotone variational inclusion problems in real Hilbert spaces. We prove that the proposed method converges strongly to a solution to the aforementioned problem under the assumption that the associated singlevalued operator for the monotone variational inclusion problem is monotone and Lipschitz continuous. Our method uses a stepsize that is generated at each iteration by some simple computations, which allows it to be easily implemented without the prior knowledge of the Lipschitz constant of the singlevalued operator. Moreover, we discuss some consequences of our results and apply them to solve the split linear inverse problems, for which we also considered a special case of the split linear inverse problem, namely, the LASSO problem. We also give some numerical illustrations of the proposed method in comparison with other method in the literature to further demonstrate the applicability and efficiency of our method. |
---|---|
AbstractList | In this paper, we propose a new inertial extrapolation method for solving the generalized split feasibility problems over the solution set of monotone variational inclusion problems in real Hilbert spaces. We prove that the proposed method converges strongly to a solution to the aforementioned problem under the assumption that the associated singlevalued operator for the monotone variational inclusion problem is monotone and Lipschitz continuous. Our method uses a stepsize that is generated at each iteration by some simple computations, which allows it to be easily implemented without the prior knowledge of the Lipschitz constant of the singlevalued operator. Moreover, we discuss some consequences of our results and apply them to solve the split linear inverse problems, for which we also considered a special case of the split linear inverse problem, namely, the LASSO problem. We also give some numerical illustrations of the proposed method in comparison with other method in the literature to further demonstrate the applicability and efficiency of our method. |
Author | Izuchukwu, C. Ogwo, G. N. Mewomo, O. T. |
Author_xml | – sequence: 1 givenname: C. surname: Izuchukwu fullname: Izuchukwu, C. organization: School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal – sequence: 2 givenname: G. N. surname: Ogwo fullname: Ogwo, G. N. organization: School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal – sequence: 3 givenname: O. T. surname: Mewomo fullname: Mewomo, O. T. email: mewomoo@ukzn.ac.za organization: School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal |
BookMark | eNqFkEtrGzEUhUVJoM7jJwQEWU-q18gaumkIfQQC2SRroZm5imU0kiPJLu4iv72a2t100azu5d5zro6-M3QSYgCErii5oUSRT4RxTjsubhhhdaSIkkJ9QAtKWNeITrQnaDFrmln0EZ3lvCaEUcnEAr3dBuwCpOKMxxOUVRyxjQnn6HcuvOAXqEvj3S8Ycd54V7AFk13varvHmxR7D1PGcQcJlxXMvm1xMeAMBUeLpxhiqXHxziRn5k19x4XBb3Pt8wU6tcZnuDzWc_T87evT3Y_m4fH7_d3tQzNwrkpjVUekUnw5_wYM4T0TDJaUtSO0Vkip-h4MHQVRoiPQCjkuYZBja3lHATg_R9eHuzXx6xZy0eu4TTVL1kwKSRTtFKmqzwfVkGLOCaweXPkTuiTjvKZEz8D1X-B6Bq6PwKu7_ce9SW4yaf-u78vB50IlP5mfMflRF7P3MdlkwuCy5v8_8RssrZu5 |
CitedBy_id | crossref_primary_10_1007_s40314_024_02673_y crossref_primary_10_1080_02331934_2021_1895154 crossref_primary_10_1080_02331934_2021_1981897 crossref_primary_10_1142_S1793557122502011 crossref_primary_10_1142_S179355712250139X crossref_primary_10_1515_dema_2023_0113 crossref_primary_10_1515_jaa_2022_2010 crossref_primary_10_1515_dema_2021_0006 crossref_primary_10_3934_naco_2021011 crossref_primary_10_1142_S1793557121501370 crossref_primary_10_24193_subbmath_2024_1_12 crossref_primary_10_1186_s13660_021_02571_5 crossref_primary_10_1007_s11587_021_00624_x crossref_primary_10_1515_dema_2021_0019 crossref_primary_10_1002_mma_8678 crossref_primary_10_1007_s40314_021_01749_3 crossref_primary_10_30755_NSJOM_14084 crossref_primary_10_1007_s13370_020_00832_y crossref_primary_10_1186_s13660_021_02591_1 crossref_primary_10_1007_s40306_022_00480_3 crossref_primary_10_1080_02331934_2024_2398776 crossref_primary_10_1007_s00025_020_01306_0 crossref_primary_10_1007_s10440_024_00678_7 crossref_primary_10_1515_cmam_2020_0174 crossref_primary_10_3934_naco_2021004 crossref_primary_10_1007_s10998_022_00470_w crossref_primary_10_1007_s40590_021_00340_4 crossref_primary_10_3846_mma_2022_13846 crossref_primary_10_2298_FIL2320949Y crossref_primary_10_5269_bspm_51319 crossref_primary_10_3390_axioms10010016 crossref_primary_10_1007_s40314_023_02244_7 crossref_primary_10_1142_S1793557122501170 crossref_primary_10_1007_s11075_021_01081_1 crossref_primary_10_1007_s10473_022_0501_5 crossref_primary_10_1007_s10915_021_01670_1 crossref_primary_10_30755_NSJOM_11064 crossref_primary_10_1002_mma_7931 crossref_primary_10_1007_s12215_024_01022_6 crossref_primary_10_1007_s10915_020_01385_9 crossref_primary_10_1007_s40306_023_00521_5 crossref_primary_10_3390_axioms13010038 crossref_primary_10_1007_s11565_020_00354_2 crossref_primary_10_1007_s13370_020_00869_z crossref_primary_10_1007_s40314_023_02555_9 crossref_primary_10_1002_mma_8849 crossref_primary_10_3390_axioms9040143 |
Cites_doi | 10.1080/10556788.2018.1472257 10.1007/s11784-017-0472-7 10.1007/s40840-019-00781-1 10.1088/0266-5611/20/1/006 10.1007/s40314-019-1014-2 10.1007/s11784-018-0632-4 10.1007/s10957-010-9757-3 10.1137/080716542 10.1007/s10957-011-9814-6 10.1007/s11075-018-0504-4 10.1016/j.na.2011.09.005 10.1080/02331934.2019.1602772 10.1007/s10589-016-9857-6 10.1007/s11228-014-0285-4 10.1080/02331934.2019.1616191 10.1007/978-3-642-59073-3_11 10.1080/02331934.2020.1723586 10.1007/s11590-012-0496-2 10.1002/0470868279 10.36045/bbms/1590199308 10.2989/16073606.2019.1593255 10.1137/130910294 10.1080/01630563.2018.1564763 10.1007/s11075-018-0633-9 10.1088/0266-5611/26/10/105018 10.1007/s11075-019-00683-0 10.1515/dema-2018-0022 10.1007/s10957-020-01672-3 10.1007/s10957-016-0972-4 10.1090/S0002-9947-1970-0282272-5 10.1016/j.jmaa.2004.04.059 10.1007/s10589-015-9730-z 10.1080/02331934.2017.1390747 10.1007/s40314-018-0661-z 10.1007/s40065-018-0236-2 10.1007/s11075-020-00937-2 10.1137/09076773X 10.1007/s11075-011-9490-5 10.1080/02331934.2020.1716752 10.1007/s11587-019-00460-0 10.1016/j.jmaa.2005.12.066 10.37193/CJM.2018.03.23 10.1515/anly-2018-0078 10.1007/BF02142692 10.1007/s40314-019-0841-5 10.1007/s11784-018-0526-5 |
ContentType | Journal Article |
Copyright | 2020 Informa UK Limited, trading as Taylor & Francis Group 2020 2020 Informa UK Limited, trading as Taylor & Francis Group |
Copyright_xml | – notice: 2020 Informa UK Limited, trading as Taylor & Francis Group 2020 – notice: 2020 Informa UK Limited, trading as Taylor & Francis Group |
DBID | AAYXX CITATION 7SC 7TB 8FD FR3 H8D JQ2 L7M L~C L~D |
DOI | 10.1080/02331934.2020.1808648 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database Aerospace Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
DatabaseTitle | CrossRef Aerospace Database Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Aerospace Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering |
EISSN | 1029-4945 |
EndPage | 611 |
ExternalDocumentID | 10_1080_02331934_2020_1808648 1808648 |
Genre | Research Article |
GroupedDBID | .7F .DC .QJ 0BK 0R~ 123 29N 30N 4.4 5VS AAENE AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFS ACIWK ACTIO ADCVX ADGTB ADXPE AEISY AENEX AEOZL AEPSL AEYOC AFKVX AGDLA AGMYJ AHDZW AIJEM AJWEG AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DKSSO DU5 EBS E~A E~B GTTXZ H13 HF~ HZ~ H~P IPNFZ J.P KYCEM LJTGL M4Z NA5 O9- P2P PQQKQ RIG RNANH ROSJB RTWRZ S-T SNACF TBQAZ TDBHL TEJ TFL TFT TFW TTHFI TUROJ TWF UT5 UU3 ZGOLN ~S~ AAGDL AAHIA AAYXX ADYSH AFRVT AIYEW AMPGV AMVHM CITATION 7SC 7TB 8FD FR3 H8D JQ2 L7M L~C L~D TASJS |
ID | FETCH-LOGICAL-c338t-f890688374945ea03b242e7125de5f4668bbea1d408490e546d7ec6d5f391ee33 |
ISSN | 0233-1934 |
IngestDate | Wed Aug 13 07:40:48 EDT 2025 Tue Jul 01 03:52:13 EDT 2025 Thu Apr 24 22:53:59 EDT 2025 Wed Dec 25 09:06:13 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 3 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c338t-f890688374945ea03b242e7125de5f4668bbea1d408490e546d7ec6d5f391ee33 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
PQID | 2646081980 |
PQPubID | 27961 |
PageCount | 29 |
ParticipantIDs | crossref_citationtrail_10_1080_02331934_2020_1808648 crossref_primary_10_1080_02331934_2020_1808648 proquest_journals_2646081980 informaworld_taylorfrancis_310_1080_02331934_2020_1808648 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2022-03-04 |
PublicationDateYYYYMMDD | 2022-03-04 |
PublicationDate_xml | – month: 03 year: 2022 text: 2022-03-04 day: 04 |
PublicationDecade | 2020 |
PublicationPlace | Philadelphia |
PublicationPlace_xml | – name: Philadelphia |
PublicationTitle | Optimization |
PublicationYear | 2022 |
Publisher | Taylor & Francis Taylor & Francis LLC |
Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis LLC |
References | CIT0030 CIT0032 CIT0031 CIT0033 Izuchukwu C (CIT0014) 2019; 71 Xu HK (CIT0008) 2016; 17 Oyewole OK (CIT0035) 2020 CIT0036 CIT0038 CIT0037 Aremu KO (CIT0027) 2020 CIT0041 CIT0040 CIT0043 CIT0042 CIT0001 CIT0045 CIT0044 CIT0003 CIT0047 Taiwo A (CIT0005) 2020 Okeke CC (CIT0034) 2017; 14 CIT0046 CIT0049 CIT0004 CIT0048 CIT0007 CIT0006 CIT0009 Tian M (CIT0017) 2017; 2017 CIT0050 CIT0052 Gibali A. (CIT0002) 2017; 2 CIT0051 CIT0010 CIT0054 CIT0012 CIT0056 CIT0011 CIT0055 Jolaoso LO (CIT0021) 2019 CIT0013 CIT0057 CIT0016 CIT0015 CIT0018 CIT0019 CIT0020 CIT0023 CIT0022 Pontryagin LS (CIT0053) 1962 CIT0025 CIT0024 CIT0026 CIT0029 CIT0028 Bot RI (CIT0039) 2016; 1 |
References_xml | – ident: CIT0036 doi: 10.1080/10556788.2018.1472257 – ident: CIT0047 doi: 10.1007/s11784-017-0472-7 – ident: CIT0006 doi: 10.1007/s40840-019-00781-1 – volume: 2 start-page: 243 issue: 2 year: 2017 ident: CIT0002 publication-title: Pure Appl Funct Anal – ident: CIT0050 doi: 10.1088/0266-5611/20/1/006 – year: 2020 ident: CIT0005 publication-title: J Ind Manage Optim – ident: CIT0012 doi: 10.1007/s40314-019-1014-2 – ident: CIT0030 doi: 10.1007/s11784-018-0632-4 – ident: CIT0011 doi: 10.1007/s10957-010-9757-3 – ident: CIT0048 doi: 10.1137/080716542 – ident: CIT0015 doi: 10.1007/s10957-011-9814-6 – ident: CIT0025 doi: 10.1007/s11075-018-0504-4 – ident: CIT0044 doi: 10.1016/j.na.2011.09.005 – volume: 17 start-page: 513 year: 2016 ident: CIT0008 publication-title: J Nonlinear Convex Anal – year: 2019 ident: CIT0021 publication-title: Rend Circ Mat Palermo II – volume: 14 start-page: 20 issue: 2 year: 2017 ident: CIT0034 publication-title: Aust J Math Anal Appl – ident: CIT0009 doi: 10.1080/02331934.2019.1602772 – ident: CIT0052 doi: 10.1007/s10589-016-9857-6 – volume: 1 start-page: 29 year: 2016 ident: CIT0039 publication-title: Minimax Theory Appl – year: 2020 ident: CIT0027 publication-title: J Ind Manage Optim – ident: CIT0041 doi: 10.1007/s11228-014-0285-4 – ident: CIT0023 doi: 10.1080/02331934.2019.1616191 – ident: CIT0043 doi: 10.1007/978-3-642-59073-3_11 – ident: CIT0010 doi: 10.1080/02331934.2020.1723586 – ident: CIT0054 doi: 10.1007/s11590-012-0496-2 – volume: 2017 start-page: 17 year: 2017 ident: CIT0017 publication-title: J Ineq Appl – ident: CIT0055 doi: 10.1002/0470868279 – ident: CIT0033 doi: 10.36045/bbms/1590199308 – ident: CIT0029 doi: 10.2989/16073606.2019.1593255 – ident: CIT0038 doi: 10.1137/130910294 – volume-title: The mathematical theory of optimal processes year: 1962 ident: CIT0053 – ident: CIT0016 doi: 10.1080/01630563.2018.1564763 – ident: CIT0031 doi: 10.1007/s11075-018-0633-9 – ident: CIT0040 doi: 10.1088/0266-5611/26/10/105018 – ident: CIT0007 doi: 10.1007/s11075-019-00683-0 – ident: CIT0028 doi: 10.1515/dema-2018-0022 – ident: CIT0032 doi: 10.1007/s10957-020-01672-3 – ident: CIT0024 doi: 10.1007/s10957-016-0972-4 – ident: CIT0049 doi: 10.1090/S0002-9947-1970-0282272-5 – ident: CIT0042 doi: 10.1016/j.jmaa.2004.04.059 – ident: CIT0056 doi: 10.1007/s10589-015-9730-z – ident: CIT0019 doi: 10.1080/02331934.2017.1390747 – ident: CIT0057 doi: 10.1007/s40314-018-0661-z – year: 2020 ident: CIT0035 publication-title: Rend Circ Mat Palermo II – ident: CIT0013 doi: 10.1007/s40065-018-0236-2 – volume: 71 start-page: 1480 year: 2019 ident: CIT0014 publication-title: Ukrainian Math J – ident: CIT0037 doi: 10.1007/s11075-020-00937-2 – ident: CIT0051 doi: 10.1137/09076773X – ident: CIT0001 doi: 10.1007/s11075-011-9490-5 – ident: CIT0022 doi: 10.1080/02331934.2020.1716752 – ident: CIT0018 doi: 10.1007/s11587-019-00460-0 – ident: CIT0045 doi: 10.1016/j.jmaa.2005.12.066 – ident: CIT0020 doi: 10.37193/CJM.2018.03.23 – ident: CIT0026 doi: 10.1515/anly-2018-0078 – ident: CIT0003 doi: 10.1007/BF02142692 – ident: CIT0004 doi: 10.1007/s40314-019-0841-5 – ident: CIT0046 doi: 10.1007/s11784-018-0526-5 |
SSID | ssj0021624 |
Score | 2.5060225 |
Snippet | In this paper, we propose a new inertial extrapolation method for solving the generalized split feasibility problems over the solution set of monotone... |
SourceID | proquest crossref informaworld |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 583 |
SubjectTerms | Feasibility Generalized split feasibility problems Hilbert space Inclusions inertial method Inverse problems Iterative methods linear inverse problem Mathematical analysis monotone variational inclusions Operators (mathematics) variational inequalities |
Title | An inertial method for solving generalized split feasibility problems over the solution set of monotone variational inclusions |
URI | https://www.tandfonline.com/doi/abs/10.1080/02331934.2020.1808648 https://www.proquest.com/docview/2646081980 |
Volume | 71 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9NAEF6F9AIHxFMUCtoDN8uV7V2v7WMELREqzcUREZeV7V2XijZB2CYiByT-ObMvx1EqClysaKP1xJkvs99M5oHQawokHaAS-HEgMp9GZekXVFUBZ0lFWS2jVOpun-dsOqfvF_FiNPo1rC5py-Nqc2Ndyf9oFdZAr6pK9h80298UFuA16BeuoGG4_pWOJypNUSVG6xIQNQpaZw2CUB0muDAtpS83QCobIJutV8vCpsP-8OwomcZTSZyaf7oP6zVS5wfAc6xUr27vOzjULmh4uayuuqaP8lleOwPLc21LOnu0bbrqc_dl3e0EY2cXax2dfbf9E-iDXK-u9eLM5mzbMAR4sCoPaxuGzPcmgvRTj40xiwjxgSyaHdIYW5V6QzPTTtJZYzOQxaKODExrbAbe2FOaGRO9dwDYjEmQpoSB_x_BYgp-m-nnudtw-3zGT-dnZzw_WeR30EEEnkY0RgeT6dtPH3uvPWR6MnL_AK4MTDVov0nMDsHZaX-7d9xrDpM_QPet84EnBkkP0UguH6F7g5aUj9HPyRI7TGGDKQz3xhZTeIAprDGFB5jCDlNYYQoDprDDFAZM4VWNHabwAFN4i6knaH56kr-Z-nZGh18RkrZ-nWZqbBFJlB5lEZASOJ9MgDYLGdeUsbQsZREKGqQ0C2RMmUhkxURckyyUkpCnaLwEqc8Q1lQ1CsMiAZpcC5oKWiUiZFmUCBmw4hBR98XyyjawV3NUrnjo-txafXClD271cYiO-21fTQeX2zZkQ63xVkO7Nqjm5Ja9R07F3BqKhoPPwRTzToPnf377Bbq7_WkdoXH7rZMvgfO25SuLyt_ITane |
linkProvider | Library Specific Holdings |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagDMDAG_HmBtaUPBwnHisEKq9OILFZSWwjRNUikiLBwG_nLnFQASEG1kgXx87Z_u50932MHXEE6egqvhf7Wno8zHMv49QFLJOCC2vC1NRsnwPRv-UXd_HdVC8MlVVSDG0booj6rKbNTcnotiTuGO8Z9JyIUiIhPkoRlvN0ls3FUiSkYhD5g8-gKxC1sC2ZeGTTdvH89pov99MX9tIfp3V9BZ0ts6L9-Kby5LE7qfJu8faN1_F_s1thSw6hQq9xqVU2Y0ZrbHGKt3CdvfdGQE2DeDoModGgBpwBoB9TfgLuGy7rhzejoUSUW4E1mavDfQWnYVMCVY8CAlBo_R9KU8HYAm6NMZGEwwtG8i5biQMWwwnl9soNdnt2enPS95yQg1dgBFx5NpWkbRMlXPLYZH6UIzAwCWIrbWLLhUjz3GSB5n7KpW9iLnRiCqFjG8nAmCjaZJ0RjrrFoMYzGLRmCWIpq3mqeZHoQMgw0cYX2Tbj7e9ThWM5J7GNoQpaMlS3vIqWV7nl3WbdT7OnhubjLwM57RuqqvMrthFDUdEftnutIyl3YpQKgakgeJb6O_949SGb799cX6mr88HlLlsIqVeDCub4HutUzxOzjwiqyg_qLfIB5x8MgA |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI5gSAgOvBGDAT5w7egjTdsjAiZemjiAxC1qmwQhpm2iHRI78Nux2xTxENqBayUnTeI4ny37M2NHHEE6qorrhK5KHO5nmZNyqgJOopwLo_1YV2yffXFxz68ewiabsLBpleRDm5ooorLVdLnHyjQZccf4zKDiBBQR8fFTjKicx_NsQRB5OFVxuP1Pn8sTVV9bEnFIpini-WuYb8_TN_LSX8a6eoF6qyxr_r1OPHnuTsqsm09_0Dr-a3FrbMXiUzipFWqdzenhBlv-wlq4yd5PhkAlg2gbBlB3oAZcAKAWU3QCHmsm66epVlAgxi3B6NRm4b6B7WBTAOWOAsJPaLQfCl3CyABejBFRhMMr-vE2VokT5oMJRfaKLXbfO787vXBsGwcnR_-3dEycUGebIOIJD3XqBhnCAh0hslI6NFyIOMt06inuxjxxdciFinQuVGiCxNM6CLZZa4iz7jCo0Ay6rGmESMooHiueR8oTiR8p7Yq0zXhzejK3HOfUamMgvYYK1W6vpO2VdnvbrPspNq5JPmYJJF9VQ5ZVdMXUrVBkMEO20-iRtPaikAhLBYGz2N39x9CHbPH2rCdvLvvXe2zJp0INypbjHdYqXyZ6H-FTmR1UF-QDhXwLJA |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+inertial+method+for+solving+generalized+split+feasibility+problems+over+the+solution+set+of+monotone+variational+inclusions&rft.jtitle=Optimization&rft.au=Izuchukwu%2C+C&rft.au=Ogwo%2C+G+N&rft.au=Mewomo%2C+O+T&rft.date=2022-03-04&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=71&rft.issue=3&rft.spage=583&rft.epage=611&rft_id=info:doi/10.1080%2F02331934.2020.1808648&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0233-1934&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0233-1934&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0233-1934&client=summon |