New inertial forward–backward algorithm for convex minimization with applications

In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces. Using the stepsize rules, the selection of the Lipschitz constant of the gradient of functions is avoided. We th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Demonstratio mathematica Ročník 56; číslo 1; s. 1168 - 1200
Hlavní autoři: Kankam, Kunrada, Cholamjiak, Watcharaporn, Cholamjiak, Prasit
Médium: Journal Article
Jazyk:angličtina
Vydáno: De Gruyter 15.02.2023
Témata:
ISSN:2391-4661, 2391-4661
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces. Using the stepsize rules, the selection of the Lipschitz constant of the gradient of functions is avoided. We then prove the weak convergence theorem and present the numerical experiments for image recovery. The comparative results show that the proposed algorithm has better efficiency than other methods.
AbstractList In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces. Using the stepsize rules, the selection of the Lipschitz constant of the gradient of functions is avoided. We then prove the weak convergence theorem and present the numerical experiments for image recovery. The comparative results show that the proposed algorithm has better efficiency than other methods.
Author Kankam, Kunrada
Cholamjiak, Watcharaporn
Cholamjiak, Prasit
Author_xml – sequence: 1
  givenname: Kunrada
  surname: Kankam
  fullname: Kankam, Kunrada
  email: kunradazzz@gmail.com
  organization: School of Science, University of Phayao, Phayao 56000, Thailand
– sequence: 2
  givenname: Watcharaporn
  surname: Cholamjiak
  fullname: Cholamjiak, Watcharaporn
  email: c-wchp007@hotmail.com
  organization: School of Science, University of Phayao, Phayao 56000, Thailand
– sequence: 3
  givenname: Prasit
  surname: Cholamjiak
  fullname: Cholamjiak, Prasit
  email: prasitch2008@yahoo.com
  organization: School of Science, University of Phayao, Phayao 56000, Thailand
BookMark eNp1UMtOwzAQtFCRKKVXzvmBFL_ixkdU8ahUwQE4WxvbLS5JXDkpoZz4B_6QL8FpEeLCXnY0szPSzika1L62CJ0TPCEZyS6MrSClmNIUkzw_QkPKJEm5EGTwB5-gcdOscRyRc0HxED3c2S5xtQ2tgzJZ-tBBMF8fnwXolx4mUK58cO1z1YuJ9vWrfUsqV7vKvUPrfJ10UU1gsymd3hPNGTpeQtnY8c8eoafrq8fZbbq4v5nPLhepZhluU2IgtzjnzAgMmExzQySRwBlwKCiA1ZwA5ZRZmpl4IaeUUMaM5SLLCkzZCM0PucbDWm2CqyDslAen9oQPKwXxL11aJZjNqTVUaCo4EbIgBUgmheBSCqxxzJocsnTwTRPs8jePYNU3rPqGVd-w6huOBnkwdFC2Nhi7CttdBGrtt6GOb_9jzARh309vhIY
Cites_doi 10.1137/0716071
10.31197/atnaa.753561
10.1137/15M1046095
10.1016/0041-5553(64)90137-5
10.1016/j.patrec.2017.06.013
10.1186/s13662-021-03422-9
10.1007/s41980-021-00596-6
10.1109/TECHPOS.2009.5412098
10.1002/mma.5420
10.23952/jnfa.2022.5
10.1111/j.2517-6161.1996.tb02080.x
10.1186/s13660-021-02618-7
10.1007/s10957-011-9837-z
10.1080/10556788.2016.1214959
10.1007/s40314-021-01646-9
10.1016/0022-247X(76)90152-9
10.3934/math.2022529
10.1137/050626090
10.1137/S0363012998338806
10.1016/S0377-0427(02)00906-8
10.3390/math8030378
10.1109/TIP.2003.819861
10.1137/080716542
10.1287/moor.19.4.790
10.1080/00036811.2021.1986021
10.1023/A:1008714607737
10.1007/978-1-4419-9467-7
10.31197/atnaa.573972
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.1515/dema-2022-0188
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2391-4661
EndPage 1200
ExternalDocumentID oai_doaj_org_article_63e82ed26c264169b1ba9396649960c0
10_1515_dema_2022_0188
10_1515_dema_2022_0188561
GroupedDBID -~X
0R~
4.4
5VS
AAFWJ
ABFKT
ACGFS
ADBBV
AFBDD
AFPKN
AHGSO
ALMA_UNASSIGNED_HOLDINGS
AMVHM
BCNDV
EBS
FRP
GROUPED_DOAJ
HZ~
M48
O9-
OK1
P2P
QD8
SLJYH
Y2W
AAYXX
CITATION
ID FETCH-LOGICAL-c350t-1da8e0843d60a0178d1919a43a4ab2aaec41a2423e25d0a09721233de4655b023
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000936653100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2391-4661
IngestDate Fri Oct 03 12:43:08 EDT 2025
Sat Nov 29 05:33:02 EST 2025
Sat Nov 29 01:27:42 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License This work is licensed under the Creative Commons Attribution 4.0 International License.
http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c350t-1da8e0843d60a0178d1919a43a4ab2aaec41a2423e25d0a09721233de4655b023
OpenAccessLink https://doaj.org/article/63e82ed26c264169b1ba9396649960c0
PageCount 13
ParticipantIDs doaj_primary_oai_doaj_org_article_63e82ed26c264169b1ba9396649960c0
crossref_primary_10_1515_dema_2022_0188
walterdegruyter_journals_10_1515_dema_2022_0188561
PublicationCentury 2000
PublicationDate 2023-02-15
PublicationDateYYYYMMDD 2023-02-15
PublicationDate_xml – month: 02
  year: 2023
  text: 2023-02-15
  day: 15
PublicationDecade 2020
PublicationTitle Demonstratio mathematica
PublicationYear 2023
Publisher De Gruyter
Publisher_xml – name: De Gruyter
References Khatoon, S.; Cholamjiak, W.; Uddin, I. (j_dema-2022-0188_ref_003) 2021; 2021
Wang, C.; Xiu, N. (j_dema-2022-0188_ref_011) 2000; 16
Nesterov, Y. E. (j_dema-2022-0188_ref_020) 1983; 269
Liu, L.; Cho, S. Y.; Yao, J. C. (j_dema-2022-0188_ref_023) 2021; 5
Attouch, H.; Peypouquet, J. (j_dema-2022-0188_ref_018) 2016; 26
Moudafi, A.; Oliny, M. (j_dema-2022-0188_ref_019) 2003; 155
Tseng, P. (j_dema-2022-0188_ref_017) 2000; 38
Dunn, J. C. (j_dema-2022-0188_ref_010) 1976; 53
Iusem, A. N.; Svaiter, B. F.; Teboulle, M. (j_dema-2022-0188_ref_009) 1994; 19
Bello Cruz, J. Y.; Nghia, T. T. (j_dema-2022-0188_ref_025) 2016; 31
Tibshirani, R. (j_dema-2022-0188_ref_029) 1996; 58
Combettes, P. L.; Wajs, V. R. (j_dema-2022-0188_ref_001) 2005; 4
Beck, A.; Teboulle, M. (j_dema-2022-0188_ref_024) 2009; 2
Khatoon, S.; Uddin, I.; Basarir, M. (j_dema-2022-0188_ref_004) 2021; 40
Suantai, S.; Noor, M. A.; Kankam, K.; Cholamjiak, P. (j_dema-2022-0188_ref_014) 2021; 2021
Wang, Z.; Bovik, A. C.; Simoncelli, E. P. (j_dema-2022-0188_ref_031) 2004; 13
Polyak, B. T. (j_dema-2022-0188_ref_021) 1964; 4
Verma, M.; Shukla, K. K. (j_dema-2022-0188_ref_026) 2017; 95
Kankam, K.; Pholasa, N.; Cholamjiak, P. (j_dema-2022-0188_ref_015) 2019; 17
Hajji, M. A. (j_dema-2022-0188_ref_008) 2020; 4
Kankam, K.; Cholamjiak, P. (j_dema-2022-0188_ref_016) 2021; 2021
Lions, P. L.; Mercier, B. (j_dema-2022-0188_ref_002) 1979; 16
Kajimura, T.; Kimura, Y. (j_dema-2022-0188_ref_007) 2019; 3
Garodia, C.; Uddin, I.; Baleanu, D. (j_dema-2022-0188_ref_006) 2022; 48
Kankam, K.; Pholasa, N.; Cholamjiak, P. (j_dema-2022-0188_ref_013) 2019; 42
Xu, H. K. (j_dema-2022-0188_ref_012) 2011; 150
Khunpanuk, C.; Garodia, C.; Uddin, I.; Pakkaranang, N. (j_dema-2022-0188_ref_005) 2022; 7
Akutsah, F.; Mebawondu, A. A.; Ugwunnadi, G. C.; Narain, O. K. (j_dema-2022-0188_ref_022) 2022; 2022
Hanjing, A.; Suantai, S. (j_dema-2022-0188_ref_027) 2020; 8
2023090111391502609_j_dema-2022-0188_ref_011
2023090111391502609_j_dema-2022-0188_ref_010
2023090111391502609_j_dema-2022-0188_ref_031
2023090111391502609_j_dema-2022-0188_ref_030
2023090111391502609_j_dema-2022-0188_ref_019
2023090111391502609_j_dema-2022-0188_ref_018
2023090111391502609_j_dema-2022-0188_ref_017
2023090111391502609_j_dema-2022-0188_ref_016
2023090111391502609_j_dema-2022-0188_ref_015
2023090111391502609_j_dema-2022-0188_ref_014
2023090111391502609_j_dema-2022-0188_ref_013
2023090111391502609_j_dema-2022-0188_ref_012
2023090111391502609_j_dema-2022-0188_ref_009
2023090111391502609_j_dema-2022-0188_ref_022
2023090111391502609_j_dema-2022-0188_ref_021
2023090111391502609_j_dema-2022-0188_ref_020
2023090111391502609_j_dema-2022-0188_ref_008
2023090111391502609_j_dema-2022-0188_ref_007
2023090111391502609_j_dema-2022-0188_ref_029
2023090111391502609_j_dema-2022-0188_ref_006
2023090111391502609_j_dema-2022-0188_ref_028
2023090111391502609_j_dema-2022-0188_ref_005
2023090111391502609_j_dema-2022-0188_ref_027
2023090111391502609_j_dema-2022-0188_ref_004
2023090111391502609_j_dema-2022-0188_ref_026
2023090111391502609_j_dema-2022-0188_ref_003
2023090111391502609_j_dema-2022-0188_ref_025
2023090111391502609_j_dema-2022-0188_ref_002
2023090111391502609_j_dema-2022-0188_ref_024
2023090111391502609_j_dema-2022-0188_ref_001
2023090111391502609_j_dema-2022-0188_ref_023
References_xml – volume: 48
  start-page: 1493
  year: 2022
  end-page: 1512
  ident: j_dema-2022-0188_ref_006
  article-title: On constrained minimization, variational inequality and split feasibility problem via new iteration scheme in Banach spaces
  publication-title: Bull. Iran. Math. Soc
– volume: 26
  start-page: 1824
  year: 2016
  end-page: 1834
  ident: j_dema-2022-0188_ref_018
  article-title: The rate of convergence of Nesterov’s accelerated forward–backward method is actually faster than 1 ∕ k 2 1/{k}^{2}
  publication-title: SIAM J. Control Optim.
– volume: 2022
  start-page: 5
  year: 2022
  ident: j_dema-2022-0188_ref_022
  article-title: Inertial extrapolation method with regularization for solving monotone bilevel variation inequalities and fixed point problems
  publication-title: J. Nonlinear Funct. Anal.
– volume: 13
  start-page: 600
  year: 2004
  end-page: 612
  ident: j_dema-2022-0188_ref_031
  article-title: Image quality assessment: from error visibility to structural similarity
  publication-title: IEEE Trans. Image Process
– volume: 269
  start-page: 543
  year: 1983
  end-page: 547
  ident: j_dema-2022-0188_ref_020
  article-title: A method for solving the convex programming problem with convergence rate O ( 1 ∕ k 2 ) O\left(1/{k}^{2})
  publication-title: Dokl. Akad. Nauk SSR.
– volume: 5
  start-page: 627
  year: 2021
  end-page: 644
  ident: j_dema-2022-0188_ref_023
  article-title: Convergence analysis of an inertial Tseng’s extragradient algorithm for solving pseudomonotone variational inequalities and applications
  publication-title: J. Nonlinear Var. Anal.
– volume: 7
  start-page: 9509
  year: 2022
  end-page: 9523
  ident: j_dema-2022-0188_ref_005
  article-title: On a proximal point algorithm for solving common fixed point problems and convex minimization problems in Geodesic spaces with positive curvature
  publication-title: AIMS Math
– volume: 58
  start-page: 267
  year: 1996
  end-page: 288
  ident: j_dema-2022-0188_ref_029
  article-title: Regression shrinkage and selection via the lasso
  publication-title: J. R. Stat. Soc. Series B. Stat. Methodol
– volume: 17
  start-page: 607
  year: 2019
  end-page: 625
  ident: j_dema-2022-0188_ref_015
  article-title: Hybrid forward–backward algorithms using linesearch rule for minimization problem
  publication-title: Thai J. Math
– volume: 4
  start-page: 1
  year: 1964
  end-page: 17
  ident: j_dema-2022-0188_ref_021
  article-title: Some methods of speeding up the convergence of iteration methods
  publication-title: USSR Comput. Math. Math. Phys
– volume: 38
  start-page: 431
  year: 2000
  end-page: 446
  ident: j_dema-2022-0188_ref_017
  article-title: A modified forward–backward splitting method for maximal monotone mappings
  publication-title: SIAM J. Control Optim
– volume: 155
  start-page: 447
  year: 2003
  end-page: 454
  ident: j_dema-2022-0188_ref_019
  article-title: Convergence of a splitting inertial proximal method for monotone operators
  publication-title: J. Comput. Appl. Math.
– volume: 16
  start-page: 964
  year: 1979
  end-page: 979
  ident: j_dema-2022-0188_ref_002
  article-title: Splitting algorithms for the sum of two nonlinear operators
  publication-title: SIAM J. Numer. Anal.
– volume: 2021
  year: 2021
  ident: j_dema-2022-0188_ref_016
  article-title: Strong convergence of the forward–backward splitting algorithms via linesearches in Hilbert spaces
  publication-title: Appl. Anal.
– volume: 4
  start-page: 1168
  year: 2005
  end-page: 1200
  ident: j_dema-2022-0188_ref_001
  article-title: Signal recovery by proximal forward–backward splitting
  publication-title: Multiscale Model. Simul.
– volume: 19
  start-page: 790
  year: 1994
  end-page: 814
  ident: j_dema-2022-0188_ref_009
  article-title: Entropy-like proximal methods in convex programming
  publication-title: Math. Oper. Res.
– volume: 95
  start-page: 98
  year: 2017
  end-page: 103
  ident: j_dema-2022-0188_ref_026
  article-title: A new accelerated proximal gradient technique for regularized multitask learning framework
  publication-title: Pattern Recognit. Lett.
– volume: 53
  start-page: 145
  year: 1976
  end-page: 158
  ident: j_dema-2022-0188_ref_010
  article-title: Convexity, monotonicity, and gradient processes in Hilbert space
  publication-title: J. Math. Anal. Appl
– volume: 8
  start-page: 378
  year: 2020
  ident: j_dema-2022-0188_ref_027
  article-title: A fast image restoration algorithm based on a fixed point and optimization method
  publication-title: Mathematics
– volume: 3
  start-page: 192
  year: 2019
  end-page: 200
  ident: j_dema-2022-0188_ref_007
  article-title: The proximal point algorithm in complete geodesic spaces with negative curvature
  publication-title: Adv. Theory Nonlinear Anal. Appl
– volume: 4
  start-page: 432
  year: 2020
  end-page: 442
  ident: j_dema-2022-0188_ref_008
  article-title: Forward-backward alternating parallel shooting method for multi-layer boundary value problems
  publication-title: Adv. Theory Nonlinear Anal. Appl.
– volume: 150
  start-page: 360
  year: 2011
  end-page: 378
  ident: j_dema-2022-0188_ref_012
  article-title: Averaged mappings and the gradient-projection algorithm
  publication-title: J. Optim. Theory Appl
– volume: 42
  start-page: 1352
  year: 2019
  end-page: 1362
  ident: j_dema-2022-0188_ref_013
  article-title: On convergence and complexity of the modified forward-Řbackward method involving new linesearches for convex minimization
  publication-title: Math. Methods Appl. Sci
– volume: 31
  start-page: 1209
  year: 2016
  end-page: 1238
  ident: j_dema-2022-0188_ref_025
  article-title: On the convergence of the forward–backward splitting method with linesearches
  publication-title: Optim. Methods Softw
– volume: 2021
  start-page: 1
  year: 2021
  end-page: 22
  ident: j_dema-2022-0188_ref_014
  article-title: Novel forward–backward algorithms for optimization and applications to compressive sensing and image inpainting
  publication-title: Adv. Difference Equ.
– volume: 2021
  start-page: 1
  year: 2021
  end-page: 20
  ident: j_dema-2022-0188_ref_003
  article-title: A modified proximal point algorithm involving nearly asymptotically quasi-nonexpansive mappings
  publication-title: J. Inequal. Appl.
– volume: 40
  start-page: 1
  year: 2021
  end-page: 19
  ident: j_dema-2022-0188_ref_004
  article-title: A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application
  publication-title: Comput. Appl. Math.
– volume: 16
  start-page: 111
  year: 2000
  end-page: 120
  ident: j_dema-2022-0188_ref_011
  article-title: Convergence of the gradient projection method for generalized convex minimization
  publication-title: Comput. Optim. Appl.
– volume: 2
  start-page: 183
  year: 2009
  end-page: 202
  ident: j_dema-2022-0188_ref_024
  article-title: A fast iterative shrinkage-thresholding algorithm for linear inverse problems
  publication-title: SIAM J. Imaging Sci
– ident: 2023090111391502609_j_dema-2022-0188_ref_002
  doi: 10.1137/0716071
– ident: 2023090111391502609_j_dema-2022-0188_ref_008
  doi: 10.31197/atnaa.753561
– ident: 2023090111391502609_j_dema-2022-0188_ref_018
  doi: 10.1137/15M1046095
– ident: 2023090111391502609_j_dema-2022-0188_ref_021
  doi: 10.1016/0041-5553(64)90137-5
– ident: 2023090111391502609_j_dema-2022-0188_ref_026
  doi: 10.1016/j.patrec.2017.06.013
– ident: 2023090111391502609_j_dema-2022-0188_ref_014
  doi: 10.1186/s13662-021-03422-9
– ident: 2023090111391502609_j_dema-2022-0188_ref_006
  doi: 10.1007/s41980-021-00596-6
– ident: 2023090111391502609_j_dema-2022-0188_ref_030
  doi: 10.1109/TECHPOS.2009.5412098
– ident: 2023090111391502609_j_dema-2022-0188_ref_013
  doi: 10.1002/mma.5420
– ident: 2023090111391502609_j_dema-2022-0188_ref_022
  doi: 10.23952/jnfa.2022.5
– ident: 2023090111391502609_j_dema-2022-0188_ref_020
– ident: 2023090111391502609_j_dema-2022-0188_ref_029
  doi: 10.1111/j.2517-6161.1996.tb02080.x
– ident: 2023090111391502609_j_dema-2022-0188_ref_003
  doi: 10.1186/s13660-021-02618-7
– ident: 2023090111391502609_j_dema-2022-0188_ref_012
  doi: 10.1007/s10957-011-9837-z
– ident: 2023090111391502609_j_dema-2022-0188_ref_015
– ident: 2023090111391502609_j_dema-2022-0188_ref_025
  doi: 10.1080/10556788.2016.1214959
– ident: 2023090111391502609_j_dema-2022-0188_ref_004
  doi: 10.1007/s40314-021-01646-9
– ident: 2023090111391502609_j_dema-2022-0188_ref_010
  doi: 10.1016/0022-247X(76)90152-9
– ident: 2023090111391502609_j_dema-2022-0188_ref_005
  doi: 10.3934/math.2022529
– ident: 2023090111391502609_j_dema-2022-0188_ref_001
  doi: 10.1137/050626090
– ident: 2023090111391502609_j_dema-2022-0188_ref_017
  doi: 10.1137/S0363012998338806
– ident: 2023090111391502609_j_dema-2022-0188_ref_019
  doi: 10.1016/S0377-0427(02)00906-8
– ident: 2023090111391502609_j_dema-2022-0188_ref_027
  doi: 10.3390/math8030378
– ident: 2023090111391502609_j_dema-2022-0188_ref_031
  doi: 10.1109/TIP.2003.819861
– ident: 2023090111391502609_j_dema-2022-0188_ref_024
  doi: 10.1137/080716542
– ident: 2023090111391502609_j_dema-2022-0188_ref_009
  doi: 10.1287/moor.19.4.790
– ident: 2023090111391502609_j_dema-2022-0188_ref_016
  doi: 10.1080/00036811.2021.1986021
– ident: 2023090111391502609_j_dema-2022-0188_ref_011
  doi: 10.1023/A:1008714607737
– ident: 2023090111391502609_j_dema-2022-0188_ref_023
– ident: 2023090111391502609_j_dema-2022-0188_ref_028
  doi: 10.1007/978-1-4419-9467-7
– ident: 2023090111391502609_j_dema-2022-0188_ref_007
  doi: 10.31197/atnaa.573972
SSID ssj0000684620
Score 2.2341087
SecondaryResourceType review_article
Snippet In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization...
SourceID doaj
crossref
walterdegruyter
SourceType Open Website
Index Database
Publisher
StartPage 1168
SubjectTerms 65K05
90C25
90C30
image recovery
inertial technique
minimization problem
Tseng’s extragradient method
Title New inertial forward–backward algorithm for convex minimization with applications
URI https://www.degruyter.com/doi/10.1515/dema-2022-0188
https://doaj.org/article/63e82ed26c264169b1ba9396649960c0
Volume 56
WOSCitedRecordID wos000936653100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2391-4661
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000684620
  issn: 2391-4661
  databaseCode: DOA
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEB6keLCH4hPrixwET0t3k-x2c1SxeFEEFXoL2U1ahT6k3fq4-R_8h_4SZ7LbWgTx4m3JBhK-STIzmck3AMdShVw5qwIhRBZIZcMgtSoJImmoLiw3eWR8sYn29XXa7aqbpVJflBNW0gOXwLUS4VLuLE9yVN1RorIoM0qgkS6JVyT33nrYVkvOVHkGo17lYcXSiDq7Zd3Q4JLglIjgy6x8ayFP1l-HxosPUFvXn8zeinlA1OuZzjo0KgORnZYT24AVN9qE-tWCXXW6Bbd4MjF6tIe7c8DQ6qTM18_3j4zu4vCTmUF_jE7_w5B-Mp9Y_sqIRGRYvbpkdP3KloPX23Dfubg7vwyq4ghBLuKwCCJrUhemUtgkNLitUouelzJSGGkybozLZWTIWHI8ttiDWHq4ENYRYVqGmnoHaqPxyO0CS3B6PIm5sZ5NnyKrhqOosp7sScd5E07mYOmnkgNDk--AsGqCVROsmmBtwhlhuehF3NW-ASWqK4nqvyTaBP5DErraV9NfhkUbcO8_Rt6HNaomT0nZUXwAtWIyc4ewmj8Xj9PJkV9hXyEo1Ps
linkProvider Directory of Open Access Journals
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=New+inertial+forward%E2%80%93backward+algorithm+for+convex+minimization+with+applications&rft.jtitle=Demonstratio+mathematica&rft.au=Kankam%2C+Kunrada&rft.au=Cholamjiak%2C+Watcharaporn&rft.au=Cholamjiak%2C+Prasit&rft.date=2023-02-15&rft.issn=2391-4661&rft.eissn=2391-4661&rft.volume=56&rft.issue=1&rft_id=info:doi/10.1515%2Fdema-2022-0188&rft.externalDBID=n%2Fa&rft.externalDocID=10_1515_dema_2022_0188
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2391-4661&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2391-4661&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2391-4661&client=summon