Proximal determination of convex functions
From MaRDI portal
Abstract: We provide comparison principles for convex functions through its proximal mappings. Consequently, we prove that the norm of the proximal operator determines a convex the function up to a constant. A new characterization of Lipschitzianity in terms of the proximal operator is given.
Recommendations
Cites work
- Convex analysis and monotone operator theory in Hilbert spaces
- Determination of convex functions via subgradients of minimal norm
- scientific article; zbMATH DE number 3398324 (Why is no real title available?)
- Integration of primal lower nice functions in Hilbert spaces
- Integration of subdifferentials of lower semicontinuous functions on Banach spaces
- Proximité et dualité dans un espace hilbertien
- Subdifferential determination of essentially directionally smooth functions in Banach space
- Variational Analysis in Sobolev and BV Spaces
Cited in
(9)- Determination of convex functions via subgradients of minimal norm
- Scaling, proximity, and optimization of integrally convex functions
- Protoconvex functions
- scientific article; zbMATH DE number 7352424 (Why is no real title available?)
- The optimal value and optimal solutions of the proximal average of convex functions
- Metric compatibility and determination in complete metric spaces
- Convergence of slopes in Asplund spaces
- Convergence of subdifferentials versus convergence of slopes
- Computing proximal points of nonconvex functions
This page was built for publication: Proximal determination of convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026427)