A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima (Q5853567)
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 7319278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima |
scientific article; zbMATH DE number 7319278 |
Statements
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (English)
0 references
10 March 2021
0 references
nonsmooth nonconvex optimization
0 references
Bregman-Moreau and Bregman forward-backward envelopes
0 references
relative smoothness
0 references
KL inequality
0 references
nonlinear error bound
0 references
nonisolated local minima
0 references
superlinear 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
0 references
0 references
0 references
0 references
0 references
0 references
0.8084227442741394
0 references
0.7800776362419128
0 references
0.7639462947845459
0 references
0.7458811402320862
0 references
