article Open AccessTop 10% cited
On the subdifferentiability of convex functions
Proceedings of the American Mathematical Society · 1965 · Vol. 16(4) · pp. 605–611
Abstract
(Thus the subgradients of f correspond to the nonvertical supporting hyperplanes to the convex set consisting of all the points of E (DR lying above the graph of f.) The set of subgradients of f at x is denoted by of(x). If of(x) is not empty, f is said to be subdifferenticable at x. Iff actually had a gradient x* = Vf(x) at x in the sense of Gateaux (or Frechet), one would in particular have af(x) = { Vf(x) } (see Moreau [5, p. 20]). It is immediate from (1.2) that of(x) is a weak* closed convex set in E* for each xCE, and that the effective domain
Optimization and Variational AnalysisNuclear Receptors and SignalingRetinoids in leukemia and cellular processesCombinatoricsRegular polygonHyperplaneMathematicsGraphConvex setConvex functionSet (abstract data type)Computer scienceConvex optimization
Citations
295
FWCI
3.77
field-weighted impact
References
9
Percentile
94%
vs. same field & year
Citations per year
Cited by
On the variational principle
Journal of Mathematical Analysis and Applications · 1974 · 2,312 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
