Loading...
An Accelerated Convex Optimization Algorithm with Line Search and Applications in Machine Learning
Author(s)
Date Issued
May 1, 2022
Type
Article
Abstract
In this paper, we introduce a new line search technique, then employ it to construct a novel accelerated forward–backward algorithm for solving convex minimization problems of the form of the summation of two convex functions in which one of these functions is smooth in a real Hilbert space. We establish a weak convergence to a solution of the proposed algorithm without the Lipschitz assumption on the gradient of the objective function. Furthermore, we analyze its performance by applying the proposed algorithm to solving classification problems on various data sets and compare with other line search algorithms. Based on the experiments, the proposed algorithm performs better than other line search algorithms.
Citation
Mathematics, 10(9), 2022