no code implementations • 15 Nov 2023 • Hari Dahal, Wei Liu, Yangyang Xu
For the former case, DPALM achieves the complexity of $\widetilde{\mathcal{O}}\left(\varepsilon^{-2. 5} \right)$ to produce an $\varepsilon$-KKT point by applying an accelerated proximal gradient (APG) method to each DPALM subproblem.
