A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (Q2307744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7181867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems |
scientific article; zbMATH DE number 7181867 |
Statements
A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems (English)
0 references
25 March 2020
0 references
The authors investigate a Bregman ADMM type method for linearly constrained optimization problems with the objective being the sum of a smooth convex function and a dc function. Subgradient and/or proximal steps are used in the numerical scheme. By imposing some geometrical conditions, like the Kurdika-Lojasieewicz property, the authors are able to show convergence to a critical point. Numerical experiments in image processing and least squares problems are considered as well.
0 references
linearly constrained difference-of-convex problems
0 references
Bregman distance
0 references
alternating direction method of multipliers
0 references
Kurdyka-Łojasiewicz function
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9131251
0 references
0.90431464
0 references
0.89895016
0 references
0.8972125
0 references
0.8957059
0 references
0.8946892
0 references
0.89461976
0 references
0.89454705
0 references
0.8922973
0 references
