A New Accelerated Viscosity Forward-backward Algorithm with a Linesearch for Some Convex Minimization Problems and its Applications to Data Classification
{"title":"A New Accelerated Viscosity Forward-backward Algorithm with a Linesearch for Some Convex Minimization Problems and its Applications to Data Classification","authors":"Dawan Chumpungam, Panitarn Sarnmeta, S. Suantai","doi":"10.37193/cjm.2023.01.08","DOIUrl":null,"url":null,"abstract":"\" In this paper, we focus on solving convex minimization problem in the form of a summation of two convex functions in which one of them is Frec\\'{e}t differentiable. In order to solve this problem, we introduce a new accelerated viscosity forward-backward algorithm with a new linesearch technique. The proposed algorithm converges strongly to a solution of the problem without assuming that a gradient of the objective function is $L$-Lipschitz continuous. As applications, we apply the proposed algorithm to classification problems and compare its performance with other algorithms mentioned in the literature. \"","PeriodicalId":50711,"journal":{"name":"Carpathian Journal of Mathematics","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Carpathian Journal of Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37193/cjm.2023.01.08","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
" In this paper, we focus on solving convex minimization problem in the form of a summation of two convex functions in which one of them is Frec\'{e}t differentiable. In order to solve this problem, we introduce a new accelerated viscosity forward-backward algorithm with a new linesearch technique. The proposed algorithm converges strongly to a solution of the problem without assuming that a gradient of the objective function is $L$-Lipschitz continuous. As applications, we apply the proposed algorithm to classification problems and compare its performance with other algorithms mentioned in the literature. "
期刊介绍:
Carpathian Journal of Mathematics publishes high quality original research papers and survey articles in all areas of pure and applied mathematics. It will also occasionally publish, as special issues, proceedings of international conferences, generally (co)-organized by the Department of Mathematics and Computer Science, North University Center at Baia Mare. There is no fee for the published papers but the journal offers an Open Access Option to interested contributors.