New Bregman proximal type algoritms for solving DC optimization problems (Q6043133)
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: New Bregman proximal type algoritms for solving DC optimization problems |
scientific article; zbMATH DE number 7682193
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New Bregman proximal type algoritms for solving DC optimization problems |
scientific article; zbMATH DE number 7682193 |
Statements
New Bregman proximal type algoritms for solving DC optimization problems (English)
0 references
4 May 2023
0 references
difference-of-convex optimization
0 references
nonconvex optimization
0 references
nonsmooth optimization
0 references
Bregman proximal DC algorithms
0 references
Bregman distances
0 references
Kurdyka-Łojasiewicz inequality
0 references
0 references
0 references
0 references
0 references
0 references
