This paper investigates conditions under which the convex subdifferential is maximally monotone in locally convex spaces, providing a general theoretical framework for understanding subdifferential properties.
Contribution
It introduces equivalent conditions for maximal monotonicity of the subdifferential in the broad setting of locally convex spaces, extending existing theory.
Findings
01
Characterization of maximal monotonicity conditions
02
Extension of subdifferential theory to locally convex spaces
03
Theoretical framework for upper envelope representations
Abstract
Abstract Equivalent conditions that make the convex subdifferential maximal monotone are investigated in the general settings of locally convex spaces.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Mathematical Inequalities and Applications · Fixed Point Theorems Analysis
Full text
The maximal monotonicity of the subdifferential in locally convex
spaces via upper envelopes
M.D. Voisei
Abstract
Equivalent conditions that make the convex subdifferential maximal
monotone are investigated in the general settings of locally convex
spaces.
1 Preliminaries and notations
The aim of this paper is to provide equivalent conditions that allow
the convex subdifferentials of all proper convex lower semicontinuous
functions defined in a locally convex space be maximal monotone. Our
goal will be achieved through the introduction of several types of
upper envelopes for a function followed by a study of their properties
in connection with the maximal monotonicity of that function subdifferential.
We will address our objective mainly via our characterization of maximal
monotonicity that says that an operator is maximal monotone iff it
is representable and of type NI (introduced in [10, Theorem 2.3];
see also [11, Theorem 3.4], or Theorem 10
below). That characterization is provided in terms of the Fitzpatrick
functionφT:X×X∗→R
of a multi-valued operator T:X⇉X∗ which is
given by (see [2])
[TABLE]
where (X,τ) is a non-trivial (that is, X={0}) real Hausdorff
separated locally convex space (LCS for short), X∗ is its
topological dual usually endowed with the weak-star topology denoted
by w∗, (X∗,w∗)∗ is identified with X, ⟨x,x∗⟩:=x∗(x)=:c(x,x∗),
for x∈X, x∗∈X∗ denotes the duality product
or *coupling *of X×X∗, and GraphT={(x,x∗)∈X×X∗∣x∗∈T(x)}
stands for the graph of T:X⇉X∗.
When X is a Banach space, Rockafellar showed in [7, Theorem A]
that if f:X→R is proper convex lower semicontinuous
then its convex subdifferential∂f:X⇉X∗,
defined by x∗∈∂f(x) if f(x) is finite and for every
y∈X, f(y)≥f(x)+⟨y−x,x∗⟩, is maximal monotone
(∂f∈M(X) for short). In particular the normal
cone to C which is given by NC=∂ιC∈M(X),
whenever C⊂X is closed convex. Here ιC(x)=0, for
x∈C; ιC(x)=+∞, for x∈X∖C denotes
the indicator function of C.
Due to the biconjugate formula and since the maximal monotonicity
is a duality property, the same holds when X is the topological
dual of a Banach space endowed with the weak-star topology. Let us
mention here that, when X is a non-reflexive Banach space, its
dual X∗ is neither a Banach space nor barreled under any topology
(including its Mackey topology) compatible with the duality (X∗,X).
Part of the arguments used in [7] coming from [6, Proposition 6 (b), (c)]
and [1, (A), (B)] is to show that the subdifferentiability
domain of a proper convex lower semicontinuous function determines
perfectly the function in the sense that the function coincide with
the closed convex hull of its restriction on its subdifferentiability
domain. Also, as a consequence, every proper convex lower semicontinuous
function defined in a Banach space coincides with the supremum of
the supporting affine functions determined by its subgradients (see
again [1, Theorem 2, p. 609]).
Naturally, one may ask whether these properties are characteristic
to the previously mentioned two distinct types of spaces: Banach spaces
and duals of Banach spaces (endowed with the weak star topology) and,
whether these properties can be extended to general LCS’s, in the
sense of finding conditions such as conditions (A), (B) in [1]
that allow all the convex subdifferential be maximal monotone.
It is interesting to mention here that the answer for the question
stated in [1, p. 606]: “It would be interesting to
know whether every space for which (A) and (B) always hold is necessarily
a Banach space "in disguise" (i.e. in
its Mackey topology) as the counter-examples seem to suggest.” is
negative since, given a non-reflexive Banach space X, its topological
dual X∗ has properties (A), (B) with respect to the duality
(X∗,X) but no barreled (and moreover Banach space) topology
on X∗ compatible with the duality (X∗,X) exists.
Our main argument is built on the introduction of several envelopes
that associate naturally to a function whose subdifferential is maximal
monotone.
As usual, given a LCS (E,μ) and A⊂E we denote by “A#”
the portable hull of A (see [14] for more details),
“convA” the convex hull of A, “clμ(A)=Aμ”
the μ−closure of A, “intμA”
the μ−*topological interior *of A, “coreA”
the algebraic interior of A.
For f,g:E→R we set [f≤g]:={x∈E∣f(x)≤g(x)};
the sets [f=g], [f<g], and [f>g] being defined in a similar
manner. We write f≥g shorter for f(z)≥g(z), for every
z∈E.
The class of closed convex neighborhoods of x∈X in (X,τ)
is denoted by Vτ(x).
For a multi-function T:X⇉X∗, D(T)=PrX(GraphT),
R(T)=PrX∗(GraphT) stand for
the domain and the range of T respectively, where PrX,
PrX∗ denote the projections of X×X∗
onto X, X∗ respectively. When no confusion can occur, T:X⇉X∗
will be identified with GraphT⊂X×X∗.
We consider the following classes of functions and operators on (X,τ)
Λ(X)
the class formed by proper convex functions f:X→R.
Recall that f is proper if domf:={x∈X∣f(x)<∞}
is nonempty and f does not take the value −∞,
Γτ(X)
the class of functions f∈Λ(X)
that are τ–lower semi-continuous (*τ–*lsc
for short),
M(X)
the class of non-empty monotone operators T:X⇉X∗
(GraphT=∅). Recall that T:X⇉X∗
is monotone if, for all (x1,x1∗),(x2,x2∗)∈GraphT,
⟨x1−x2,x1∗−x2∗⟩≥0
or, equivalently, GraphT⊂Graph(T+).
M(X)
the class of maximal monotone operators T:X⇉X∗.
The maximality is understood in the sense of graph inclusion as subsets
of X×X∗.
To a proper function f:(X,τ)→R
we associate the following notions:
Epif:={(x,t)∈X×R∣f(x)≤t}
is
the epigraph of f,
convf:X→R,
the
convex hull of f, which is the greatest convex function
majorized by f, (convf)(x):=inf{t∈R∣(x,t)∈conv(Epif)}
for x∈X,
clτconvf:X→R,
the
τ−lsc convex hull of f, which is the greatest *τ–*lsc
convex function majorized by f, (clτconvf)(x):=inf{t∈R∣(x,t)∈clτ(convEpif)}
for x∈X,
f∗:X∗→R
is the convex
conjugate of f:X→R with respect
to the dual system (X,X∗), f∗(x∗):=sup{⟨x,x∗⟩−f(x)∣x∈X}
for x∗∈X∗.
Accordingly, for C⊂X, σC(x∗):=sup{⟨x,x∗⟩∣x∈C}=ιC∗(x∗),
for x∗∈X∗. Recall that f∗∗:=(f∗)∗=clconvf
whenever clconvf (or equivalently
f∗) is proper. Here, for functions defined in X∗, all
the conjugates are taken with respect to the dual system (X∗,X).
Throughout this article the conventions ∞−∞=∞, sup∅=−∞,
and inf∅=∞ are enforced while the use of the topology
notation is avoided when the topology is clearly understood.
2 Functions with maximal monotone subdifferentials
In this section we are concerned with properties of functions f:X→R
for which ∂f∈M(X) and try to identify the
natural function framework under which we can find conditions on a
function that make its subdifferential maximal monotone.
Theorem 1
Let X be a LCS and let f:X→R.
For every (x,x∗)∈X×X∗,
[TABLE]
(i)* If Graph(∂f)=∅ then
f, clconvf, f∗ are proper,
f∗∗=clconvf, Graph(∂f)⊂Graph(∂(clconvf)),
and, for every x∈D(∂f), ∂f(x)=∂(clconvf)(x).*
If, in addition, ∂f∈M(X) then ∂f=∂(clconvf)
and convD(∂f) is dense in conv(dom(clconv)f).
(ii)* If h:R→R has
∂h∈M(R) then h is proper convex.
There exists a proper convex g:R→R
which is not lsc but ∂g∈M(R).*
(iii)* If X is at least two-dimensional then there
exists g:X→R which is neither convex nor
lsc such that ∂g∈M(X).*
(iv)* Assume, in addition, that X is a Banach space
or that f is continuous at some x∈domf.
Then f is lsc and ∂f∈M(X) iff f∈Γ(X).*
(v)* Conversely, if ∂(clconvf)∈M(X)
then f is proper. There exists g:X→R which
is neither convex nor lsc such that ∂(clconvg)∈M(X)
and Graph(∂g)⊊Graph(∂(clconvg)).*
Similarly one can show the following result.
Corollary 2
Let X be a LCS and let f:X→R.
Assume that X is a Banach space or that f is continuous at some
x∈domf. If ∂f∈M(X)
then clf is convex.
If, outside its subdifferentiability domain, we increase the values
of a function whose subdifferential is maximal monotone, we still
get the same maximal monotone subdifferential; but, as previously
seen, this process can remove the convexity and/or the lower semicontinuity
of the function given these properties are present. More precisely,
[TABLE]
Therefore, in order to be able to find conditions that make the subdifferential
maximal monotone, the subdifferentiability domain of a function plays
an important role.
In Banach spaces it is known that the subdifferentiability domain
of a proper convex lsc function is dense in the domain of the function
(see again [15, Theorem 3.1.4 (i), p. 162]). That allows
to strengthen part of Theorem 1 (i), (iv).
Proposition 3
Let X be a Banach space and let
f:X→R be such that ∂f∈M(X).
Then D(∂f) is dense in domf. Moreover,
if f is lsc at x∈dom(clconvf)
then there exists (xn)n⊂D(∂f) such that xn→x
in X and f(xn)→f(x)=(clconvf)(x).
In particular
[TABLE]
[TABLE]
Based on the previous theorem we conclude that the natural function
framework, under which we could identify properties of f that make
∂f maximal monotone, is that of proper convex lsc functions;
outside this class, as the examples in this section show, that task
is impossible.
3 Upper envelopes
First, given X a LSC and f:X→R, we define
the upper envelope of the continuous affine functions defined
by ∂f as f∪:X→R given by
[TABLE]
and the portable hull off by
[TABLE]
Here for C⊂X, C# denotes the portable hull of C
and recall that a set C⊂X is portable if C=C#
(see [14]).
Note that, for every C⊂X, ιC∪:=(ιC)∪=ιC#=(ιC)#=:ιC#.
Throughout this article we use the same notation E# for the
portable hull of a set E⊂X×R. The notation
f# is natural via its epigraph as we will see in the next result.
Theorem 4
Let (X,τ) be a LCS and let
f:X→R. Then
(i)* f∪≤f#≤f and, for every x∈D(∂f),
f∪(x)=f#(x)=f(x);*
(ii) f∪ is proper iff Graph(∂f)=∅
iff f# is proper iff Graph(∂f)=∅;
in this case f∪,f#∈Γτ(X);
(iii)* Epi(f∪)=∅;
moreover*
[TABLE]
(iv)* ∂f∪∣D(∂f)=∂f#∣D(∂f)=∂f,
in particular Graph∂f⊂Graph∂f∪∩Graph∂f#;*
(v)* f∪∪:=(f∪)∪=f∪=(f∪)#=:f∪#,
f##:=(f#)#=f#;*
(vi)* NEpif∈M(X×R)
iff f=f#,*
(vii)* NEpi(f∪),NEpi(f#)∈M(X×R)
and (Epi(f∪))#=Epi(f∪),*
Let us call a function fportable if f=f#. As previously
seen
•
For every f, the envelopes f∪, f# are portable.
•
f is portable iff Epif is portable.
Remark 5
Note that Epi(f∪) is the
intersection of all the supporting semi-spaces that contain Epif
determined by non-vertical support hyperplanes to Epif,
that is, Epi(f∪) has the form of a partial
portable hull of Epif and is given by (x,v)∈Epi(f∪)
iff
[TABLE]
or Epi(f∪)=(Epif)G#,
where G:={(a,λ;a∗,α)∈Graph(NEpif)∣λ=f(a),α=0}
(see [14]).
With respect to the dual system (X,X∗) the dual notion of the
upper envelope for g:X∗→R is similarly
defined as
[TABLE]
Naturally, for f:X→R, one can consider
[TABLE]
These functions are proper iff Graph∂f=∅
in which case their expanded forms are
[TABLE]
[TABLE]
In particular f∗∪(0)=−infD(∂f)f.
Remark 6
The parallelism between the normal cone and the subdifferential
stops in two fundamental instances.
First, one cannot expect the Fitzpatrick function of a subdifferential
to have separated variables in general. Even though, for every f:X→R,
x∈X, x∗∈X∗
[TABLE]
there exists examples for which the inequality in (9)
can be strict. Take f(x)=21x2, x∈R for
which Graph(∂f)={(x,x)∣x∈R},
∂f∈M(R), and φ∂f(x,y)=41(x+y)2,
x,y∈R, while f∪(x)=f∗(x)=f(x)=21x2,
x∈R.
Second, even though f##=f#, f∪∪=f∪ one
cannot expect that ∂f∪∈M(X) or ∂f#∈M(X)
. Note that in every LCS X and for every C⊂X, σC:(X∗,w∗)→R
has σC=σC∪=σC# while ∂σC(∪)(#)=NC−1∈M(X∗)
iff C=C# (see [14]).
Indeed, for every x∗∈X∗
[TABLE]
obtained by taking a∈C, a∗=0. That discrepancy comes from
the fact that, in general, σC(∪)=σC#.
Notice, in passing that, for f=ιC or f=σC for
C closed convex, (9) becomes an identity.
Theorem 7
Let (X,τ) be a LCS and let f:X→R
be such that Graph∂f=∅. Then
(i)* f∪≤clconvf≤f∘∈Γτ(X)
and, for every x∈D(∂f), f∘(x)=f(x);*
(ii)* f∘∘=f∘, f∗∘∗=f∪,
f∗∪=f∘∗, f∗∘=f∪∗;*
(iii)* For every x∈X, ∂f(x)=∂f∘(x)∩R(∂f);
in particular Graph∂f⊂Graph∂f∘;*
*(iv) x∈D(∂f) iff ∂f∘(x)∩R(∂f)=∅; ***
(v)* ∂f=∂f∘ iff R(∂f)=R(∂f∘).*
Remark 8
Given (X,τ) a LCS and f:X→R
such that Graph∂f=∅ the function
g=f+ιD(∂f) satisfies domg=D(∂f)=D(∂g),
g∘=f∘=clconvg≤g
whilst g∘=g is possible, e.g., when D(∂f)
is not convex.
Also, one has
[TABLE]
with the possibility that f∪=(clconvf)∪.
For example take f=ιC, for which (clconvC)#⊊C#,
e.g., C is open convex in a Banach space for which C#=X,
clconvC=(clconvC)#=C
while f#=f∪=ιX, (clconvf)#=(clconvf)∪=f∘=ιC,
Graph∂f=C×{0}, Graph(∂f∪)=X×{0},
∂f∘=NC.
In general for C non-empty closed convex ιC∘=ιC
and ∂ιC(∘)=NC which can be non-maximal
monotone (see e.g. [3, 4]).
As a prelude to the remaining results of this paper we reprove a known
result [12, Theorem 9, p. 282] in order to reveal
a general argument for proving the maximality of the subdifferential
(see Theorem 10 below) and the necessity for the introduction
of another type of envelope in a natural way (see (12) below).
Theorem 9
Let (X,τ) be a LCS and let
f∈Γ(X) be continuous on int(domf).
Then ∂f∈M(X).
Proof. Since int(Epif)=∅
we know that Epif=(Epif)#=Epi(f#),
i.e., f=f#=f∪+ι(domf)#. In
particular
[TABLE]
Denote the closed convex level sets of f by Mλ:={x∈X∣f(x)≤λ},
λ∈R.
If f=ιC for some closed convex C⊂X with intC=∅
then ∂f=NC∈M(X) (see [14, Corollary 4])
and we are done.
Assume that f is non-constant on domf. For every
x∈domf such that f(x)>infXf, intMf(x)=∅;
in particular ∂(f+ιMf(x))=∂f+NMf(x).
Similarly, int(Epi(f+ιMf(x))=∅,
f+ιMf(x)∈Γ(X) together with (10) and the
fact that, due to x∈Mf(x) every n∗∈NMf(x)(a)
has ⟨x−a,n∗⟩≤0, imply
[TABLE]
Therefore, for every x∈domf, φ∂f(x,0)≥0.
The same considerations applied to f−x∗ for an arbitrary x∗∈X∗
show in general that
[TABLE]
Fix x0∈domf, x0∗∈domf∗.
For every x∈X, x∗∈X∗ take C∗ a closed convex
weak-star neighborhood of x0∗ that contains x∗ and
x−x0∈domσC∗; such as
[TABLE]
Then f□σC∗=(f∗+ιC∗)∗ since ιC∗
is continuous at x0∗∈domf∗, dom(f□σC∗)=domf+domσC∗∋x,
int(Epi(f□σC∗))=∅,
and (a,a∗)∈∂(f□σC∗) iff a∈∂f∗(a∗)+NC∗(a∗),
a∗∈R(∂f)∩C∗ (see e.g. [15, Theorem 2.8.7, p. 126]).
Then, according to (11)
[TABLE]
[TABLE]
[TABLE]
We showed that ∂f is of NI-type so ∂f∈M(X)
since ∂f is representable; a representative being given
by F(x,x∗)=f(x)+f∗(x∗), x∈X, x∗∈X∗;
F∈Γτ×w∗(X×X∗).
As we have seen in the previous proof, for the convex subdifferential
the characterization of maximal monotonicity [10, Theorem 2.3]
takes the following special form.
Theorem 10
Let (X,τ) be a LCS and let
f∈Γτ(X). The following are equivalent:
(i)* ∂f∈M(X),*
(ii)* under review*
(iii)* For every (x,x∗)∈X×X∗, φ∂f(x,x∗)≥⟨x,x∗⟩
or ∂f is of NI–type.*
Proposition 11
Let (X,τ) be a LCS and
let f∈Γτ(X). If ∂f∈M(X) then
f=f∪ and f∗=f∗∪.
Remark 12
Note again that whenever f∈Γτ(X)
has Graph(∂f)=∅ conditions
f=f∪ and f∗=f∗∪ are equivalent to f∪=f∘.
Indeed, if f=f∪ and f∗=f∗∪ then, by the biconjugate
formula, f=f∘. Conversely, if f∪=f∘, from
f∪≤f≤f∘ we know that f=f∪ and f=f∗∪∗.
The latter implies f∗=f∗∪.**
4 Maximal monotonicity via the low-upper envelope
For f:X→R define f⌣:X→R
by
[TABLE]
as the low-upper envelope of the continuous functions defined
by ∂f.
Remark 13
In the case of continuity of f the definition of
f⌣ is suggested in the proof of Theorem 9
by the use of the implicit upper envelope (f+ιMf(x))∪(x)
which equals f⌣(x) due to ∂(f+ιMf(x))=∂f+NMf(x).
However in general f⌣(x)≤(f+ιMf(x))(x).
In the case of a maximal monotone subdifferential the properness of
f⌣ is ensured by Theorem 10 (ii). The properties
of f⌣ are summarized in the next result.
Theorem 14
Let (X,τ) be a LCS and let f:X→R.
Then
(i)* f⌣≤f∪≤f#≤f; for every
x∈D(∂f), f⌣(x)=f(x) and, for every x∈domf,
f⌣(x)=f∪(x);*
(ii) f⌣ is proper iff Graph(∂f)=∅
and f∗(0)=f∗∪(0); in this case f⌣∈Γτ(X);
(iii)* For every x∈X, f⌣(x)≤φ∂f(x,0)+f(x).*
Corollary 15
Let (X,τ) be a LCS and let
f:X→R. Then, for every x∗∈X∗,
(f−x∗)⌣ is proper iff Graph(∂f)=∅
and f∗=f∗∪.
Theorem 16
Let (X,τ) be a LCS. The
following are equivalent:
(i)* For every f∈Γτ(X), ∂f∈M(X),*
(ii)* For every f∈Γτ(X), x∈domf,
x∗∈X∗, φ∂f(x,x∗)≥⟨x,x∗⟩,*
(iii)* For every f∈Γτ(X), x∈domf,
f(x)=f⌣(x),*
(iv)* For every f∈Γτ(X), f=f⌣,*
(v)* For every f∈Γτ(X), x∈domf
there is a net {(ai,ai∗)}i∈I⊂Graph(∂f)
such that ai→x, f(ai)→f(x), and ⟨x−ai,ai∗⟩+f(ai)→f(x),*
(vi)* For every f∈Γτ(X), x∈domf
there is a net {(ai,ai∗)}i∈I⊂Graph(∂f)
such that ⟨x−ai,ai∗⟩→0,*
(vii)* For every f∈Γτ(X), x∈domf,
ϵ>0 there is (aϵ,aϵ∗)∈Graph(∂f)
such that ⟨x−aϵ,aϵ∗⟩≥−ϵ.*
In this case for every f∈Γτ(X), D(∂f)τ=clτ(domf),
R(∂f)w∗=clw∗(domf∗)
are convex.
Remark 17
For a fixed f∈Γτ(X), Theorem
16 none of the subpoints (ii)–(vii) imply
(i). Indeed, for a closed convex C⊂X we always have, for
every x∈C=domιC, x∗∈X∗, φNC(x,x∗)=ιC#(x)+σC(x∗)≥⟨x,x∗⟩,
ιC⌣(x)=ιC∪=ιC#(x)=ιC#(x)=ιC(x),
when 0∈C, σC⌣=σC∈Γw∗(X∗),
and for subpoints (v)–(vii) we can take again f=ιC,
ai=aϵ=x, ai∗=aϵ∗=0 while NC
can be non-maximal monotone.**
Similar considerations can be performed for the extended notion of
the low-upper envelope of f:X→R given by
[TABLE]
Theorem 18
Let (X,τ) be a LCS. The following
are equivalent:
(i)* For every f∈Γτ(X), ∂f∈M(X),*
(ii)* For every f∈Γτ(X), x∈domf,
f(x)=infϵ>0fϵ⌣(x),*
(iii)’* For every f∈Γτ(X), ϵ>0, x∈domf,
f(x)=fϵ⌣(x),*
(iv)’* For every f∈Γτ(X), ϵ>0, f=fϵ⌣.*
We conclude this paper by presenting several proofs for the maximality
of the subdifferential in a Banach space. We seek minimal Banach space
considerations such as a minimal impact of Bronsted-Rockafellar’s
Lemma [1, Lemma, p. 608] or Ekeland’s Variational
Principle.
Theorem 19
Let (X,∥⋅∥) be a Banach
space. For every f∈Γ(X), ∂f∈M(X).
Proof 1. Let f∈Γ(X). Let x∈domf,
ϵ>0. Take x∗∈∂ϵf(x) and the equivalent
norm \|u\|=\left\llbracket u\right\rrbracket+|\langle u,x^{*}\rangle|,
u∈X. According to [1, Lemma, p. 608] there exists
(aϵ,aϵ∗)∈Graph∂f
such that ∥x−aϵ∥≤ϵ and ∥x∗−aϵ∗∥≤ϵ.
In particular ∣⟨x−aϵ,x∗⟩∣≤ϵ
and
[TABLE]
We have ∣⟨x−aϵ,aϵ∗⟩∣≤∣⟨x−aϵ,aϵ∗−x∗⟩∣+∣⟨x−aϵ,x∗⟩∣≤ϵ+ϵ.
Using Theorem 16 we get ∂f∈M(X).
Alternatively, since (aϵ,aϵ∗)∈Graph∂f
and x∗∈∂ϵf(x) we have
Proof 2. Let f∈Γ(X), x∈domf,
x∗∈X∗. According to [15, Theorems 3.1.1, 3.1.4 (i)]
there is (xn,xn∗)n≥1⊂∂f such that xn∗∈∂2n−2f(x),
∥xn−x∥≤n−1, ∣f(xn)−f(x)∣≤n−2+n−1, for
every n≥1. We have
[TABLE]
[TABLE]
Let n→∞ to get φ∂f(x,x∗)≥⟨x,x∗⟩.
According to Theorem 16, ∂f∈M(X).
Bibliography15
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A. Brøndsted and R. T. Rockafellar. On the subdifferentiability of convex functions. Proc. Amer. Math. Soc. , 16:605–611, 1965.
2[2] Simon Fitzpatrick. Representing monotone operators by convex functions. In Workshop/Miniconference on Functional Analysis and Optimization (Canberra, 1988) , volume 20 of Proc. Centre Math. Anal. Austral. Nat. Univ. , pages 59–65. Austral. Nat. Univ., Canberra, 1988.
3[3] V. P. Fonf. On supportless convex sets in incomplete normed spaces. Proc. Amer. Math. Soc. , 120(4):1173–1176, 1994.
4[4] V. L. Klee, Jr. Extremal structure of convex sets. II. Math. Z. , 69:90–104, 1958.
5[5] George J. Minty. On the maximal domain of a “monotone” function. Michigan Math. J. , 8:135–137, 1961.
6[6] Jean-Jacques Moreau. Étude locale d’une fonctionnelle convexe . Université de Montpellier, Montpellier, 1963.
7[7] R. T. Rockafellar. On the maximal monotonicity of subdifferential mappings. Pacific J. Math. , 33:209–216, 1970.
8[8] R. Tyrrell Rockafellar. Convex analysis . Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ, 1997. Reprint of the 1970 original, Princeton Paperbacks.