Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization (Q5037570)
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: Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization |
scientific article; zbMATH DE number 7482309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization |
scientific article; zbMATH DE number 7482309 |
Statements
Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (English)
0 references
1 March 2022
0 references
composite minimization
0 references
proximal gradient algorithms
0 references
inertial methods
0 references
convex-concave backtracking
0 references
non-Euclidean distances
0 references
Bregman distance
0 references
global convergence
0 references
Kurdyka-Łojasiewicz property
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8178636431694031
0 references
0.7736799120903015
0 references
0.7671787738800049
0 references
0.765307605266571
0 references
0.7602437138557434
0 references
