An approximation algorithm for solving a split problem of fixed point and variational inclusion
In this paper, the split fixed point and variational inclusion problems are considered. With the help of fixed point technique, Tseng-type splitting method and self-adaptive rule, an iterative algorithm is proposed for solving this split problem in which the involved operators f and g are demicontra...
Saved in:
Published in | Optimization Vol. 74; no. 2; pp. 459 - 472 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Philadelphia
Taylor & Francis
25.01.2025
Taylor & Francis LLC |
Subjects | |
Online Access | Get full text |
ISSN | 0233-1934 1029-4945 |
DOI | 10.1080/02331934.2023.2256769 |
Cover
Loading…
Abstract | In this paper, the split fixed point and variational inclusion problems are considered. With the help of fixed point technique, Tseng-type splitting method and self-adaptive rule, an iterative algorithm is proposed for solving this split problem in which the involved operators f and g are demicontractive operators and ϕ is plain monotone. Strong convergence theorem is proved under some mild conditions. |
---|---|
AbstractList | In this paper, the split fixed point and variational inclusion problems are considered. With the help of fixed point technique, Tseng-type splitting method and self-adaptive rule, an iterative algorithm is proposed for solving this split problem in which the involved operators f and g are demicontractive operators and ϕ is plain monotone. Strong convergence theorem is proved under some mild conditions. |
Author | Postolache, Mihai Yao, Jen-Chih Yao, Yonghong |
Author_xml | – sequence: 1 givenname: Yonghong surname: Yao fullname: Yao, Yonghong organization: Kyung Hee University – sequence: 2 givenname: Mihai surname: Postolache fullname: Postolache, Mihai email: emscolar@yahoo.com organization: University 'Politehnica' of Bucharest – sequence: 3 givenname: Jen-Chih surname: Yao fullname: Yao, Jen-Chih organization: China Medical University |
BookMark | eNqFkEtLxDAUhYMoOD5-ghBw3TGvdlrcKOILBDe6DrdpopFMUpOMOv_e1NGNC13lBr5zOHx7aNsHrxE6omROSUtOCOOcdlzMWbnmjNXNoum20IwS1lWiE_U2mk1MNUG7aC-lF0IYbZiYIXnuMYxjDB92CdmG8nNPIdr8vMQmRJyCe7P-CQNOo7MZF7J3eomDwcZ-6AGPwfqMwQ_4DaL9qgCHrVdulcp9gHYMuKQPv9999Hh1-XBxU93dX99enN9VivM2V0r3HWEGWEOUEUNfg6Cm5YSabgG0A8V6I4hilGjCmSZQDwLaljUatO5FzffR8aa3DHxd6ZTlS1jFMiVJThtBFpx3baFON5SKIaWojVQ2f23OEayTlMjJqPwxKiej8ttoSde_0mMs1uL639zZJmd9UbqE9xDdIDOsXYgmgld2GvlnxSeKx5Br |
CitedBy_id | crossref_primary_10_1007_s12215_024_01033_3 crossref_primary_10_1007_s41478_024_00752_1 crossref_primary_10_1007_s12190_024_02185_2 |
Cites_doi | 10.1088/0266-5611/26/5/055007 10.1007/s11075-018-0605-0 10.1112/jlms.2002.66.issue-1 10.1088/0266-5611/21/6/017 10.3390/sym12060902 10.1080/02331934.2022.2124113 10.1080/02331934.2016.1274991 10.1016/j.cam.2006.12.012 10.1137/050626090 10.1007/s10915-021-01608-7 10.1088/0266-5611/20/1/006 10.1007/s11075-019-00688-9 10.1186/s13662-021-03647-8 10.3390/math9040372 10.1007/s13398-015-0231-9 10.1137/0716071 10.1007/s40314-020-01221-8 10.1023/A:1011253113155 10.1016/0022-247X(79)90234-8 10.22436/jnsa 10.1137/18M1207260 10.1137/20M1337910 10.1016/S0304-0208(08)72383-1 10.1137/S0363012998338806 10.1007/s10957-014-0662-z 10.3390/math8061040 |
ContentType | Journal Article |
Copyright | 2023 Informa UK Limited, trading as Taylor & Francis Group 2023 2023 Informa UK Limited, trading as Taylor & Francis Group |
Copyright_xml | – notice: 2023 Informa UK Limited, trading as Taylor & Francis Group 2023 – notice: 2023 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.2023.2256769 |
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 | 472 |
ExternalDocumentID | 10_1080_02331934_2023_2256769 2256769 |
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 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 CITATION H13 7SC 7TB 8FD FR3 H8D JQ2 L7M L~C L~D TASJS |
ID | FETCH-LOGICAL-c338t-ceb902fa260cf4db5a41f8301f97a19ac2bf40c210e032e0a5d4a8826eaeeb453 |
ISSN | 0233-1934 |
IngestDate | Wed Aug 13 04:50:24 EDT 2025 Thu Apr 24 23:02:50 EDT 2025 Tue Jul 01 03:52:14 EDT 2025 Fri Feb 07 04:23:08 EST 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c338t-ceb902fa260cf4db5a41f8301f97a19ac2bf40c210e032e0a5d4a8826eaeeb453 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
PQID | 3164073398 |
PQPubID | 27961 |
PageCount | 14 |
ParticipantIDs | informaworld_taylorfrancis_310_1080_02331934_2023_2256769 proquest_journals_3164073398 crossref_primary_10_1080_02331934_2023_2256769 crossref_citationtrail_10_1080_02331934_2023_2256769 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2025-01-25 |
PublicationDateYYYYMMDD | 2025-01-25 |
PublicationDate_xml | – month: 01 year: 2025 text: 2025-01-25 day: 25 |
PublicationDecade | 2020 |
PublicationPlace | Philadelphia |
PublicationPlace_xml | – name: Philadelphia |
PublicationTitle | Optimization |
PublicationYear | 2025 |
Publisher | Taylor & Francis Taylor & Francis LLC |
Publisher_xml | – name: Taylor & Francis – name: Taylor & Francis LLC |
References | Censor Y (e_1_3_3_5_1) 2009; 16 e_1_3_3_18_1 e_1_3_3_17_1 e_1_3_3_19_1 e_1_3_3_14_1 e_1_3_3_13_1 e_1_3_3_16_1 e_1_3_3_15_1 e_1_3_3_10_1 e_1_3_3_12_1 e_1_3_3_11_1 e_1_3_3_7_1 e_1_3_3_6_1 e_1_3_3_9_1 e_1_3_3_8_1 e_1_3_3_28_1 e_1_3_3_25_1 e_1_3_3_24_1 e_1_3_3_27_1 e_1_3_3_26_1 e_1_3_3_3_1 e_1_3_3_21_1 e_1_3_3_2_1 e_1_3_3_20_1 e_1_3_3_23_1 e_1_3_3_4_1 e_1_3_3_22_1 |
References_xml | – ident: e_1_3_3_7_1 doi: 10.1088/0266-5611/26/5/055007 – ident: e_1_3_3_8_1 doi: 10.1007/s11075-018-0605-0 – ident: e_1_3_3_27_1 doi: 10.1112/jlms.2002.66.issue-1 – ident: e_1_3_3_3_1 doi: 10.1088/0266-5611/21/6/017 – ident: e_1_3_3_13_1 doi: 10.3390/sym12060902 – ident: e_1_3_3_10_1 doi: 10.1080/02331934.2022.2124113 – ident: e_1_3_3_15_1 doi: 10.1080/02331934.2016.1274991 – ident: e_1_3_3_14_1 doi: 10.1016/j.cam.2006.12.012 – ident: e_1_3_3_19_1 doi: 10.1137/050626090 – ident: e_1_3_3_25_1 doi: 10.1007/s10915-021-01608-7 – ident: e_1_3_3_2_1 doi: 10.1088/0266-5611/20/1/006 – ident: e_1_3_3_12_1 doi: 10.1007/s11075-019-00688-9 – ident: e_1_3_3_22_1 doi: 10.1186/s13662-021-03647-8 – ident: e_1_3_3_6_1 doi: 10.3390/math9040372 – ident: e_1_3_3_9_1 doi: 10.1007/s13398-015-0231-9 – ident: e_1_3_3_24_1 doi: 10.1137/0716071 – ident: e_1_3_3_20_1 doi: 10.1007/s40314-020-01221-8 – ident: e_1_3_3_18_1 doi: 10.1023/A:1011253113155 – ident: e_1_3_3_17_1 doi: 10.1016/0022-247X(79)90234-8 – ident: e_1_3_3_16_1 doi: 10.22436/jnsa – ident: e_1_3_3_21_1 doi: 10.1137/18M1207260 – ident: e_1_3_3_11_1 doi: 10.1137/20M1337910 – volume: 16 start-page: 587 year: 2009 ident: e_1_3_3_5_1 article-title: The split common fixed point problem for directed operators publication-title: J Convex Anal – ident: e_1_3_3_28_1 doi: 10.1016/S0304-0208(08)72383-1 – ident: e_1_3_3_23_1 doi: 10.1137/S0363012998338806 – ident: e_1_3_3_4_1 doi: 10.1007/s10957-014-0662-z – ident: e_1_3_3_26_1 doi: 10.3390/math8061040 |
SSID | ssj0021624 |
Score | 2.4239817 |
Snippet | In this paper, the split fixed point and variational inclusion problems are considered. With the help of fixed point technique, Tseng-type splitting method and... |
SourceID | proquest crossref informaworld |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 459 |
SubjectTerms | Adaptive algorithms demicontractive operator fixed point Fixed points (mathematics) Iterative algorithms monotone operator Operators Split problem variational inclusion |
Title | An approximation algorithm for solving a split problem of fixed point and variational inclusion |
URI | https://www.tandfonline.com/doi/abs/10.1080/02331934.2023.2256769 https://www.proquest.com/docview/3164073398 |
Volume | 74 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFLe2ctkO0z41Nph82K1ylThOaY4VA1WIj0uqdbtYjmOTSCVBEBDir9_zR9KUIth2iaJEjhW_n59_z34fCH3XQaIjGeaEAhslLIs1TCmtCajCTACDHQtbJeLkdDybs6NFvFgdxdjokiYbyftH40r-R6rwDORqomT_QbLdR-EB3IN84QoShutfyXhauZzgd6ULQByK5XkN1n5xYb0HoXO7XSCG10A1m6EvHmP4oS7vgGle1qX3ML8Fk7ndFiwruby5buXliesZqJYLH7PZaQph91l_1dV5UfsV0GhZk6tjaRJFO7_8QpQPWhypiuwXZdHfcqDGu4-48GQLknSj-kdX4dgpLhpFBIih2yhQTrEaNxuWuNSRreZ19Xk8wmhPjTKfJdytyMwV99lQ9t47EnoznY1MIfgRqCfjtLta3doT_dMzfjg_PubpwSJ9ibYoWBV0gLamsx-_f3YWeji2VZC7H2hDvkwy9se6WSMza6luN5Z2y1fSt-iNNzTw1KHmHXqhqvfodS_95AfEpxVeww_u8IOhD-zxgwW2-MEeP7jW2OIHW_xgwA_u4Qd3-PmI5ocH6f6M-IIbREbRpCFSZUlAtQAbV2qWZ7FgoZ7AEqCTPREmQtJMs0DSMFBBRFUg4pwJMNHGSiiVsTj6hAZVXanPCGsFdoSGYQLhsTyniYwVUMuJCCNg5GxvG7F25Lj02ehNUZQlD9uktX7AuRlw7gd8G426ZpcuHctzDZK-WHhjsasdbHn0TNudVobcz3rTxBx9w09Mvjz9-it6tZo7O2jQXN2oXSCwTfbNw-4PLo6XRA |
linkProvider | Library Specific Holdings |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PT8IwFG4UD-rB30YUtQevm1vXbexIjAQVOEHCrem6VhdxIzgM8a_3dT8IaAwH_oDX7LWvr9_31n4PoTtlBcoRdmQQQKMGDV0FW0opA1JhyAHBejzvEtHre50hfR65o6W3MPpapebQqhCKyHO13ty6GF1dibuHcwYix9ElEeKYEJH6nuY22oGhfd3FwLH6C9Jle3ljW21iaJvqFc9_w6ycTyvqpX-ydX4EtQ-RqD6-uHnybs6y0BTfv3QdN_PuCB2UCBW3ipA6RlsyOUH7S7qFp4i1EpyLkc_j4uUj5uPXdBpnbx8YPMEQz7pOgTn-BIyb4bJrDU4VVvFcRniSxkmG4RPxF3D1sh6J40SMZ7p6d4aG7cfBQ8coOzUYAihuZggZBhZRHMiRUDQKXU5t1YTcoQKf2wEXJFTUEkAvpeUQaXE3ohywvSe5lCF1nXNUS9JEXiCsJABQBV5Tn9AoIoFwJWCSJgcyDVzRryNarQ8TpYy57qYxZnaldlrOH9Pzx8r5qyNzYTYpdDzWGQTLi8-yvICiim4nzFlj26gihZUpQZvof6bgRPNyg6Fv0W5n0Ouy7lP_5QrtEd2N2LIN4jZQLZvO5DVApCy8yffAD5KeAcA |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELVYJAQHdkRZfeCakjhO2hwRUJWt4kAlbpbteCCipBVNUcXXM04cxCLEgQ8YK7bH4_cm4zeEHIGfQKiD1GOIRj2uIsAjBeBhKFQSEWwsyy4RN7242-eX91FdTTh2ZZWWQ0MlFFHGanu4RynUFXHHeM2g44Q2I8LCJjqkLdOcJfOxFQ-3rzj83gfnCuKyr6018axN_Yjnt2G-XE9fxEt_BOvyBuqsEFV_e1V48tScFKqp377JOv5rcqtk2eFTelI51BqZMfk6WfqkWrhBxElOSynyaVa9e6Ry8DB8yYrHZ4oToejNNktBJR0jwi2o61lDh0Ahm5qUjoZZXlD8QvqKTN1lI2mW68HE5u42Sb9zfnfa9VyfBk8jwS08bVTiM5BIjTTwVEWSB9DGyAFJSwaJ1EwB9zWSS-OHzPgySrlEZB8baYziUbhF5vJhbrYJBYPwE3DWvMV4mrJERwYRSVsilUam2GoQXm-P0E7E3PbSGIig1jp16yfs-gm3fg3S_DAbVSoefxkkn_deFGX6BKpeJyL8w3avdhThAoI1sX9McRLtnX8MfUgWbs864vqid7VLFpltRewHHov2yFzxMjH7iI8KdVCegHdZdwBk |
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+approximation+algorithm+for+solving+a+split+problem+of+fixed+point+and+variational+inclusion&rft.jtitle=Optimization&rft.au=Yao%2C+Yonghong&rft.au=Postolache%2C+Mihai&rft.au=Yao%2C+Jen-Chih&rft.date=2025-01-25&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=74&rft.issue=2&rft.spage=459&rft.epage=472&rft_id=info:doi/10.1080%2F02331934.2023.2256769&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 |