Thresholds of prox-boundedness of PLQ functions
From MaRDI portal
Abstract: Introduced in the 1960s, the Moreau envelope has grown to become a key tool in non-smooth analysis and optimization. Essentially an infimal convolution with a parametrized norm squared, the Moreau envelope is used in many applications and optimization algorithms. An important aspect in applying the Moreau envelope to nonconvex functions is determining if the function is prox-bounded, that is, if there exists a point and a parameter such that the Moreau envelope is finite. The infimum of all such is called the threshold of prox-boundedness (prox-threshold) of the function In this paper, we seek to understand the prox-thresholds of piecewise linear-quadratic (PLQ) functions. (A PLQ function is a function whose domain is a union of finitely many polyhedral sets, and that is linear or quadratic on each piece.) The main result provides a computational technique for determining the prox-threshold for a PLQ function, and further analyzes the behavior of the Moreau envelope of the function using the prox-threshold. We provide several examples to illustrate the techniques and challenges.
Recommendations
- Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness
- Bounds for the number of threshold functions
- scientific article; zbMATH DE number 3314811
- A Lower Bound of the Number of Threshold Functions
- Quantitative Voronovskaya-type results for polynomially bounded functions
- Almost optimal bounds for direct product threshold theorem
- F-thresholds, integral closure and convexity
- On the existence of \(F\)-thresholds and related limits
- scientific article; zbMATH DE number 1225796
- On the constructive characterization of threshold functions
Cited in
(2)
This page was built for publication: Thresholds of prox-boundedness of PLQ functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821970)