An accelerated semi-proximal ADMM with extrapolation and increasing penalties is proven to converge at O(1/K) non-ergodically, but a key equivalence used in the mixed sparse optimization application is incorrect.
and Marroco, A.: Sur l’approximation, par ´ el´ ements finis d’ordre un, et la r´ esolution, par p´ enalisation-dualit´ e d’une classe de probl` emes de Dirichlet non lin´ eaires
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
An accelerated semi-proximal ADMM with extrapolation and increasing penalties is proven to converge at O(1/K) non-ergodically, but a key equivalence used in the mixed sparse optimization application is incorrect.