Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems (Q6099473)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems |
scientific article; zbMATH DE number 7698139
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems |
scientific article; zbMATH DE number 7698139 |
Statements
Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems (English)
0 references
20 June 2023
0 references
nonconvex nonseparable optimization
0 references
Bregman distance
0 references
improved Peaceman-Rachford splitting method
0 references
Kurdyka-Łojasiewicz property
0 references
convergence
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
