pith. machine review for the scientific record. sign in

arxiv: 2605.05147 · v1 · submitted 2026-05-06 · 🧮 math.CA · math.FA· math.OC

Recognition: unknown

On Characterizations of (Almost) Strictly Convex Functions

Heinz H. Bauschke, Honglin Luo, Xianfu Wang

Pith reviewed 2026-05-08 15:35 UTC · model grok-4.3

classification 🧮 math.CA math.FAmath.OC
keywords strict convexityalmost strict convexitysubdifferentialmonotonicityHilbert spaceFenchel conjugateMoreau envelopeproximal mapping
0
0 comments X

The pith

A subdifferentiable convex function is strictly convex exactly when its subdifferential is strictly monotone.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes direct equivalences between strict convexity of a function and monotonicity properties of its subdifferential operator. For any convex function that admits subgradients at every point in its domain, strict convexity holds if and only if the subdifferential is strictly monotone, and this condition is equivalent to the subdifferential being almost strictly monotone. The authors extend earlier finite-dimensional characterizations of almost strict convexity to the setting of Hilbert spaces, incorporating tools such as the Moreau envelope and proximal mappings, and they obtain parallel results for paramonotone operators. These equivalences supply alternative ways to verify or analyze convexity without direct appeal to the defining inequality.

Core claim

If a convex function is subdifferentiable on its domain, then it is strictly convex if and only if its subdifferential is strictly monotone, equivalently almost strictly monotone. Rockafellar-Wets characterizations of almost strictly convex functions, which link almost strict convexity to almost differentiability of the Fenchel conjugate and strict monotonicity of the subdifferential, are extended from finite-dimensional spaces to Hilbert spaces. Parallel characterizations are established for paramonotone operators, and the results are unified with existing descriptions that employ the Moreau envelope and proximal mappings.

What carries the argument

The subdifferential mapping (the set-valued operator that returns all subgradients supporting the function at each point), whose strict or almost strict monotonicity serves as the exact counterpart to strict or almost strict convexity.

Load-bearing premise

The convex function must be subdifferentiable at every point of its domain.

What would settle it

A convex function on a Hilbert space that is subdifferentiable everywhere, whose subdifferential is strictly monotone, yet fails to satisfy the strict-convexity inequality at some pair of points.

read the original abstract

In this paper, we unify and improve existing results on characterizing strict and almost stricty convex functions via subdifferential mapping, Moreau envelope, and proximal mappings. In particular, it is shown that if a convex function is subdifferentiable on its domain, then it is strictly convex if and only if its subdifferential is strictly monotone, equivalently, almost strictly monotone. Rockafellar-Wets' characterizations of almost strictly convex functions via almost differentiability of Fenchel conjugates and strict monotonicity of subdifferentials are extended from a finite-dimensional space to a Hilbert space. We also establish similar results for paramonotone operators.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper unifies and extends characterizations of strictly convex and almost strictly convex functions in Hilbert spaces. Under the assumption that a convex function is subdifferentiable on its entire domain, it proves that strict convexity is equivalent to the subdifferential being strictly monotone, and that this is also equivalent to the subdifferential being almost strictly monotone. The work extends Rockafellar-Wets results on almost strict convexity (via almost differentiability of Fenchel conjugates and strict monotonicity of subdifferentials) from finite dimensions to Hilbert spaces, incorporates Moreau envelopes and proximal mappings, and derives analogous results for paramonotone operators.

Significance. If the derivations hold, the equivalences provide a clean, assumption-light unification of convexity characterizations that leverages the Hilbert space inner product for monotonicity. This strengthens the link between geometric convexity properties and operator monotonicity, with direct relevance to variational inequalities and proximal algorithms in infinite dimensions. The extension of Rockafellar-Wets without additional parameters or finite-dimensional restrictions is a clear technical contribution.

minor comments (3)
  1. §2, Definition 2.3: the distinction between 'strictly monotone' and 'almost strictly monotone' for the subdifferential is introduced via an inequality involving the inner product, but the subsequent equivalence proof would benefit from an explicit remark on why the 'almost' version does not require a separate case analysis when the function is subdifferentiable everywhere.
  2. Theorem 3.4: the statement of the extension to Hilbert spaces references the finite-dimensional Rockafellar-Wets result but does not include a one-sentence pointer to the precise step where the inner-product structure replaces the finite-dimensional argument; adding this would improve readability for readers familiar with the original work.
  3. The abstract claims results 'via subdifferential mapping, Moreau envelope, and proximal mappings,' yet the main theorems focus primarily on subdifferentials; a brief sentence in the introduction clarifying which characterizations rely on the envelope/proximal formulations would prevent any impression of overstatement.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment and recommendation for minor revision. The summary accurately reflects our unification of characterizations for strictly convex and almost strictly convex functions via subdifferential monotonicity, with extensions to Hilbert spaces and connections to paramonotone operators. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity; derivations are self-contained

full rationale

The paper establishes if-and-only-if characterizations of strict and almost strict convexity for subdifferentiable convex functions in Hilbert spaces, expressed via strict monotonicity of the subdifferential, almost differentiability of the Fenchel conjugate, and properties of Moreau envelopes and proximal mappings. These equivalences follow directly from standard convex analysis definitions and the inner-product structure of Hilbert spaces, extending Rockafellar-Wets results without reducing any claim to a fitted input, self-definition, or load-bearing self-citation. No step in the derivation chain renames a known result or smuggles an ansatz; the central theorems are proved from first principles under the explicit subdifferentiability hypothesis and remain independent of the cited prior work.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The results rest on standard background from convex analysis and monotone operator theory in Hilbert spaces without introducing new free parameters or postulated entities.

axioms (2)
  • domain assumption A convex function is subdifferentiable on its domain
    This is the explicit hypothesis for the central equivalence theorem stated in the abstract.
  • standard math Standard properties of Hilbert spaces, Fenchel conjugates, and monotone operators hold
    Invoked for the extension of Rockafellar-Wets results and for paramonotone operator characterizations.

pith-pipeline@v0.9.0 · 5402 in / 1284 out tokens · 103758 ms · 2026-05-08T15:35:34.895124+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

28 extracted references

  1. [1]

    BAUSCHKE, J.M

    H.H. BAUSCHKE, J.M. BORWEIN,ANDP.L. COMBETTES, Essential smoothness, essential strict con- vexity, and Legendre functions in Banach spaces,Communications in Contemporary Mathematics3 (2001), 615–647

  2. [2]

    BAUSCHKE, R.I

    H.H. BAUSCHKE, R.I. BOT¸ , W.L. HARE,ANDW.M. MOURSI, Attouch-Th ´era duality revisited: paramonotonicity and operator splitting,Journal of Approximation Theory164 (2012), 1065–1084

  3. [3]

    BAUSCHKE ANDP.L

    H.H. BAUSCHKE ANDP.L. COMBETTES,Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer, New York, second ed., 2017

  4. [4]

    BAUSCHKE, R

    H.H. BAUSCHKE, R. GOEBEL, Y. LUCET,ANDX. WANG, The proximal average: basic theory,SIAM Journal on Optimization19 (2008), 766–785

  5. [5]

    BAUSCHKE, E

    H.H. BAUSCHKE, E. MATOU ˇSKOV ´A,ANDS. REICH, Projection and proximal point methods: con- vergence results and counterexamples,Nonlinear Analysis: Theory, Methods & Applications56 (2004), 715–738

  6. [6]

    BAUSCHKE, S.M

    H.H. BAUSCHKE, S.M. MOFFAT,ANDX. WANG, Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality,Set-Valued and Variational Analysis20 (2012), 131– 153

  7. [7]

    BAUSCHKE, X

    H.H. BAUSCHKE, X. WANG,ANDL. YAO, Rectangularity and paramonotonicity of maximally monotone operators,Optimization63 (2014), 487–504

  8. [8]

    BECK,First-Order Methods in Optimization, SIAM, 2017

    A. BECK,First-Order Methods in Optimization, SIAM, 2017

  9. [9]

    BORWEIN ANDA.S

    J.M. BORWEIN ANDA.S. LEWIS,Convex Analysis and Nonlinear Optimization: Theory and Examples, second edition. Springer, New York, 2006

  10. [10]

    BRUCK ANDS

    R.E. BRUCK ANDS. REICH, Nonexpansive projections and resolvents of accretive operators in Banach spaces,Houston Journal of Mathematics3 (1977), 459–470

  11. [11]

    BURACHIK ANDA.N

    R.S. BURACHIK ANDA.N. IUSEM, A generalized proximal point algorithm for the variational in- equality problem in a Hilbert space,SIAM Journal on Optimization8 (1998), 197–216

  12. [12]

    CENSOR, A.N

    Y. CENSOR, A.N. IUSEM,ANDS.A. ZENIOS, An interior point method with Bregman functions for the variational inequality problem with paramonotone operators,Mathematical Programming81 (1998), Ser. A, 373–400

  13. [13]

    HIRIART-URRUTY ANDC

    J.-B. HIRIART-URRUTY ANDC. LEMAR ´ECHAL,Convex Analysis and Minimization Algorithms: I Fun- damentals, Springer-Verlag, Berlin, 1993. 23

  14. [14]

    HIRIART-URRUTY ANDC

    J.-B. HIRIART-URRUTY ANDC. LEMAR ´ECHAL,Convex Analysis and Minimization Algorithms: II Ad- vanced Theory and Bundle Methods, Springer-Verlag, Berlin, 1993

  15. [15]

    IUSEM, On some properties of paramonotone operators,Journal of Convex Analysis5 (1998), 269–278

    A.N. IUSEM, On some properties of paramonotone operators,Journal of Convex Analysis5 (1998), 269–278

  16. [16]

    JOFR ´E ANDL

    A. JOFR ´E ANDL. THIBAULT, D-representation of subdifferentials of directionally Lipschitz func- tions,Proceedings of the American Mathematical Society110 (1990), 117–123

  17. [17]

    MOFFAT, W.M

    S.M. MOFFAT, W.M. MOURSI,ANDX. WANG, Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions,Mathematical Programming160 (2016), Ser. A, 193– 223

  18. [18]

    NGHIA, Geometric characterizations of Lipschitz stability for convex optimization prob- lems,SIAM Journal on Optimization35 (2025), 927–958

    T.T.A. NGHIA, Geometric characterizations of Lipschitz stability for convex optimization prob- lems,SIAM Journal on Optimization35 (2025), 927–958

  19. [19]

    PHELPS,Convex Functions, Monotone Operators and Differentiability, second edition, Springer- Verlag, Berlin, 1993

    R.R. PHELPS,Convex Functions, Monotone Operators and Differentiability, second edition, Springer- Verlag, Berlin, 1993

  20. [20]

    PLANIDEN ANDX

    C. PLANIDEN ANDX. WANG, Proximal mappings and Moreau envelopes of single-variable con- vex piecewise cubic functions and multivariable gauge functions,Nonsmooth Optimization and Its Applications, 89–130, Birkh¨auser/Springer, Cham, 2019

  21. [21]

    POLIQUIN ANDR.T

    R.A. POLIQUIN ANDR.T. ROCKAFELLAR, Tilt stability of a local minimum,SIAM Journal on Opti- mization8 (1998), 287–299

  22. [22]

    ROCKAFELLAR,Convex Analysis, Princeton Univ

    R.T. ROCKAFELLAR,Convex Analysis, Princeton Univ. Press, Princeton, 1970

  23. [23]

    ROCKAFELLAR ANDR.J-B

    R.T. ROCKAFELLAR ANDR.J-B. WETS,Variational Analysis, Springer, 2004

  24. [24]

    SIMONS,From Hahn-Banach to Monotonicity, second edition, Springer, New York, 2008

    S. SIMONS,From Hahn-Banach to Monotonicity, second edition, Springer, New York, 2008

  25. [25]

    STROMBERG,An Introduction to Classical Real Analysis, AMS Chelsea Publishing, Providence, RI, 1981

    K.R. STROMBERG,An Introduction to Classical Real Analysis, AMS Chelsea Publishing, Providence, RI, 1981

  26. [26]

    THIBAULT ANDD

    L. THIBAULT ANDD. ZAGRODNY, Integration of subdifferentials of lower semicontinuous func- tions on Banach spaces,Journal of Mathematical Analysis and Applications189 (1995), 33–58

  27. [27]

    VOLLE ANDJ.-B

    M. VOLLE ANDJ.-B. HIRIART-URRUTY, A characterization of essentially strictly convex functions on reflexive Banach spaces,Nonlinear Analysis: Theory, Methods & Applications75 (2012), 1617–1622

  28. [28]

    Z ˘ALINESCU,Convex Analysis in General Vector Spaces, World Scientific Publishing Co., Inc., River Edge, NJ, 2002

    C. Z ˘ALINESCU,Convex Analysis in General Vector Spaces, World Scientific Publishing Co., Inc., River Edge, NJ, 2002. 24