275. High-order Moreau envelope in nonsmooth convex setting: L-smoothness and inexact gradient method
Invited abstract in session TD-5: Nonsmooth optimization algorithms, stream Nonsmooth and nonconvex optimization algorithms.
Thursday, 14:10 - 15:50Room: M:N
Authors (first author is the speaker)
| 1. | Alireza Kabgani
|
| Department of Mathematics, University of Antwerp | |
| 2. | Masoud Ahookhosh
|
| Department of Mathematics, University of Antwerp |
Abstract
In this talk, we revisit the differentiability and Lipschitz continuity properties of the gradient of the high-order Moreau envelope for nonsmooth convex functions. Leveraging these insights, we propose an inexact gradient method and explore its convergence under mild conditions. Additionally, we establish the global convergence of the method by leveraging the Kurdyka-Lojasiewicz inequality. We illustrate the effectiveness of our approach through both theoretical analyses and numerical results.
Keywords
- Convex and non-smooth optimization
- Analysis and engineering of optimization algorithms
Status: accepted
Back to the list of papers