English

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

Optimization and Control 2025-12-12 v2

Abstract

This paper is devoted to investigating the fundamental properties of the high-order proximal operator (HOPE) and the high-order Moreau envelope (HOME) in the nonconvex setting, where the quadratic regularization (p=2p=2) is replaced by a pp-order regularizer with p>1p > 1. After establishing several basic properties of HOPE and HOME, we study the differentiability and weak smoothness of HOME under qq-prox-regularity with q2q \geq 2 and pp-calmness for p(1,2]p \in (1,2] and 2pq2 \leq p \leq q. Furthermore, we propose a high-order proximal-point algorithm (HiPPA) and analyze the convergence of the generated sequence to proximal fixed points. Our results pave the way for the development of a high-order smoothing theory with p>1p>1 that can lead to new algorithmic advances in the nonconvex setting. To illustrate this potential for nonsmooth and nonconvex optimization, we apply HiPPA to the Nesterov-Chebyshev-Rosenbrock functions.

Keywords

Cite

@article{arxiv.2503.04577,
  title  = {Moreau envelope and proximal-point methods under the lens of high-order regularization},
  author = {Alireza Kabgani and Masoud Ahookhosh},
  journal= {arXiv preprint arXiv:2503.04577},
  year   = {2025}
}

Comments

28 pages