What is it about?
We present a new algorithm to solve smooth nonconvex composite optimization problems that is state-of-the-art in its theoretical convergence rate, and numerical studies in the paper reveals that the algorithm performs competitively on optimization problems that arise in practice.
Featured Image
Why is it important?
This paper contributes to the literature on solving smooth nonconvex composite optimization problems efficiently both in theory and numerically.
Perspectives
This paper designs an efficient algorithm to solve nonconvex optimization problems by adapting an algorithm that solves convex optimization problems. A clear understanding of the latter algorithm is needed in order to do this.
Dr Chee Khian Sim
University of Portsmouth
Read the Original
This page is a summary of: A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems, Computational Optimization and Applications, May 2021, Springer Science + Business Media,
DOI: 10.1007/s10589-021-00280-9.
You can read the full text:
Contributors
The following have contributed to this page
