Primal-dual block-proximal splitting for a class of non-convex problems

Logo poskytovatele

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Přírodovědeckou fakultu. Oficiální stránka publikace je na webu muni.cz.
Autoři

MAZURENKO Stanislav JAUHIAINEN Jyrki VALKONEN Tuomo

Rok publikování 2020
Druh Článek v odborném periodiku
Časopis / Zdroj Electronic Transactions on Numerical Analysis
Fakulta / Pracoviště MU

Přírodovědecká fakulta

Citace
www https://epub.oeaw.ac.at/?arp=0x003bd91d
Doi http://dx.doi.org/10.1553/etna_vol52s509
Klíčová slova primal-dual algorithms; convex optimization; non-smooth optimization; step length
Popis We develop block structure-adapted primal-dual algorithms for non-convex non-smooth optimisation problems, whose objectives can be written as compositions G(x) + F(K(x)) of non-smooth block-separable convex functions G and F with a nonlinear Lipschitz-differentiable operator K. Our methods are refinements of the nonlinear primal-dual proximal splitting method for such problems without the block structure, which itself is based on the primal-dual proximal splitting method of Chambolle and Pock for convex problems. We propose individual step length parameters and acceleration rules for each of the primal and dual blocks of the problem. This allows them to convergence faster by adapting to the structure of the problem. For the squared distance of the iterates to a critical point, we show local O(1/N), O(1/N-2), and linear rates under varying conditions and choices of the step length parameters. Finally, we demonstrate the performance of the methods for the practical inverse problems of diffusion tensor imaging and electrical impedance tomography.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.