Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. A New Accelerated Viscosity Forward-backward Algorithm with a Linesearch for Some Convex Minimization Problems and its Applications to Data Classification
Loading...
Thumbnail Image

A New Accelerated Viscosity Forward-backward Algorithm with a Linesearch for Some Convex Minimization Problems and its Applications to Data Classification

Author(s)
Chumpungam, Dawan
Sarnmeta, Panitarn
Suantai, Suthep
Date Issued
January 1, 2023
Type
Article
DOI
10.37193/CJM.2023.01.08
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é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.
Citation
Carpathian Journal of Mathematics, 39(1), 125-138, 2023
Subjects

accelerated algorithm...

convex minimization p...

data classification

forward-backward algo...

linesearch

machine learning

Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback