Papers
Topics
Authors
Recent
Search
2000 character limit reached

Moreau envelope and proximal-point methods under the lens of high-order regularization

Published 6 Mar 2025 in math.OC | (2503.04577v1)

Abstract: This paper is devoted to investigating the fundamental properties of high-order proximal operator (HOPE) and high-order Moreau envelope (HOME) in the nonconvex setting, meaning that the quadratic regularization ($p=2$) is replaced with a regularization with $p>1$. After studying several basic properties of HOPE and HOME, we investigate the differentiability and weak smoothness of HOME under $q$-prox-regularity $q\geq 2$ and $p$-calmness for $p \in (1,2]$ and $2 \leq p \leq q$. Further, we design of a high-order proximal-point algorithm (HiPPA) for which the convergence of the generated sequence to proximal fixed points is studied. Our results pave the way toward the high-order smoothing theory with $p>1$ that can lead to algorithmic developments in the nonconvex setting, where our numerical experiments of HiPPA on Nesterov-Chebyshev-Rosenbrock functions show the potential of this development for nonsmooth and nonconvex optimization.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.