Namespaces
Variants
Actions

Difference between revisions of "Talk:Subdifferential"

From Encyclopedia of Mathematics
Jump to: navigation, search
m
Line 11: Line 11:
 
::''Let C be a non empty closed convex set. Then for h the support function of C and each vector x, the subdifferential of h at x consists of the points (if any) where the linear function <.,x> achieves its maximum over C.''
 
::''Let C be a non empty closed convex set. Then for h the support function of C and each vector x, the subdifferential of h at x consists of the points (if any) where the linear function <.,x> achieves its maximum over C.''
  
::To me this does not agree with the claim about the subdifferential of the support function of a compact subset.
+
::To me this does not agree with the claim about the subdifferential of the support function of a compact subset.--Edouard 14:14, 8 October 2013 (CEST)

Revision as of 12:14, 8 October 2013

The article says

"The subdifferential of the support function of a convex set coincides with the set itself"

This seems to disagree with corollary 25.5.3 of Rockafellar's book. Or am I mistaken?

Could you please explain a little, what is the problem? I do not have that book on my table. I also note that compactness is required. --Boris Tsirelson (talk) 23:22, 7 October 2013 (CEST)
This is a corollary 23.5.3 of Theorem 23.5 that relates the subdifferential of a convex function to its dual function. It says
Let C be a non empty closed convex set. Then for h the support function of C and each vector x, the subdifferential of h at x consists of the points (if any) where the linear function <.,x> achieves its maximum over C.
To me this does not agree with the claim about the subdifferential of the support function of a compact subset.--Edouard 14:14, 8 October 2013 (CEST)
How to Cite This Entry:
Subdifferential. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Subdifferential&oldid=30607