English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

In this paper, we consider a multi-block generalized alternating directionmethod of multiplier (GADMM) algorithm for minimizing a linearly constrainedseparable nonconvex and possibly nonsmooth optimization problem. The GADMMgeneralizes the classical ADMM by including proximal terms in each primalupdates and an over-relaxation parameter in the dual update. We prove that anylimit point of the sequence is a critical point. By introducing a modifiedaugmented Lagrangian we show that the sequence generated by the GADMM isbounded and the norm of the difference of consecutive terms approaches to zero.Under the powerful {K\L} properties we show that the GADMM sequence has afinite length and converges to a stationary point, and we drive its convergencerate. Given a proper lower-semicontinuous function $f:\mathbb R^n\to\mathbb R$and a critical point $x^*\in\mathbb R^n$, the {K\L} property asserts that thereexists a continuous concave monotonically increasing function $\psi$ such thataround $x^*$ it holds $\psi'(f(x)-f(x^*))\cdot{\rm dist}(0,\partial f(x))\ge 1$. When $\psi(s)=s^{1-\theta}$ with $\theta\in[0,1]$ this is equivalent to$|f(x)-f(x^*)|^{\theta}{\rm dist}(0,\partial f(x))^{-1}$ to remain boundedaround $x^*$. We show that if $\theta=0$, the sequence generated by GADMMconverges in a finite numbers of iterations. If $\theta\in(0,1/2]$, then therate of convergence is $cQ^{k}$ where $c>0$, $Q\in(0,1)$, and $k\in\mathbb N$is the iteration number. If $\theta\in(1/2,1]$ then the rate $\mathcalO(1/k^{r})$ where $r=(1-\theta)/(2\theta-1)$ will be achieved.

Multi-Block Nonconvex Nonsmooth Proximal ADMM: Convergence and Rates under Kurdyka-{\L}ojasiewicz Property