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. "
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
