# Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems

arXiv: https://arxiv.org/abs/2104.09685 · HTML: https://mlsanity.com/paper/2104.09685/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Apr 2021.

## Built on by (most cited first, 1 of 1)

- [Privacy of the last iterate in cyclically-sampled DP-SGD on nonconvex composite losses](https://mlsanity.com/paper/2407.05237/) (2024)

## Abstract (arXiv)

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.