Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems [article]

Weiwei Kong
2021 arXiv   pre-print
This thesis focuses on developing and analyzing accelerated and inexact first-order methods for solving or finding stationary points of various nonconvex composite optimization (NCO) problems. The main tools mainly come from variational and convex analysis, and the key results are in the form of iteration complexity bounds and how these bounds compare to other ones in the literature.
arXiv:2104.09685v3 fatcat:mizwtraemjhotc4wg3vy72v6sm