By the definition of the subdifferential, meansRearrangement bounds by , and equality is attained at . Taking the supremum in the definition of the convex conjugate gives . Conversely this equality bounds every member of that supremum and rearranges to the subgradient inequality. ThereforeApply the same argument to and use the Fenchel-Moreau theorem . With the canonical Hilbert identification of the bidual, the equality is also equivalent to . This proves subgradient inversion under convex conjugacy:The conditions include finiteness at the points in question; expressions involving are not subgradients merely by formal subtraction.
Articles by others on the same topic
There are currently no matching articles.