Abstract
We describe an apparently novel way of constructing the subgradient of a convex function defined on a finite dimensional vector space.
This is a preview of subscription content, log in via an institution to check access.
References
M.S. Bazaraa and C.M. Shetty,Nonlinear programming. Theory and algorithms (Wiley, New York, 1979).
J.M. Borwein, “Subgradients of convex operators”, Research Report 82-3, Department of Mathematics, Carnegie-Mellon University (Pittsburgh, PA, 1982).
R.B. Holmes,Geometric functional analysis and its applications (Springer, New York, 1975).
D.G. Luenberger,Optimization by vector space methods (Wiley, New York, 1969).
A.W. Roberts and D.E. Varberg,Convex functions (Academic Press, New York, 1973).
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, NJ, 1970).
J.F. Shapiro,Mathematical programming: Structures and algorithms (Wiley, New York, 1979).
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer, Berlin, 1970).
Author information
Authors and Affiliations
Additional information
Research partially funded on NSERC grant A5116.
Rights and permissions
About this article
Cite this article
Borwein, J.M. A note on the existence of subgradients. Mathematical Programming 24, 225–228 (1982). https://doi.org/10.1007/BF01585105
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585105