Abstract
We show that the recent relaxed-inertial proximal point algorithm due to Attouch and Cabot remains convergent when the function to be minimized is not convex, being only endowed with certain generalized convexity properties. Numerical experiments showcase the improvements brought by the relaxation and inertia features to the standard proximal point method in this setting, too.
| Original language | English |
|---|---|
| Pages (from-to) | 3393-3410 |
| Number of pages | 18 |
| Journal | Optimization |
| Volume | 73 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 1 Jan 2024 |
Keywords
- Proximal point algorithms
- generalized convexity
- inertial iterative methods
- prox-convexity
- relaxed iterative methods
Fingerprint
Dive into the research topics of 'Proximal point type algorithms with relaxed and inertial effects beyond convexity'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver