On the Iteration Complexity of Smoothed Proximal ALM for Nonconvex Optimization Problem with Convex Constraints

Jiawei Zhang, Wenqiang Pu, Zhi-Quan Luo

It is well-known that the lower bound of iteration complexity for solving nonconvex unconstrained optimization problems is $\Omega (1/{\epsilon }^2)$, which can be achieved by standard gradient de…