Abstract
The construct of anL 1-Support is extended to the environment of a lower semicontinuous function over a solid, finite union of polytopes by utilizing the convex envelope of the function. The existence of and a characterization for theL 1-Support of the convex envelope are established. The characterization is solely dependent upon the original function’s characteristics and thus the need to calculate the functional form of the convex envelope explicity is eliminated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.G. Bartle,The elements of real analysis (John Wiley, New York, 1976).
J. Falk, “Lagrange multipliers and nonconvex programs”,SIAM Journal on Control and Optimization 7 (1969) 534–545.
S.J. Grotzinger, “L 1-supports and global optimization”, contributed paper, Eleventh International Symposium on Mathematical Programming, University of Bonn (Bonn, West Germany, August 1982).
S.J. Grotzinger, “On characterizingL 1-supports, natural and Chebyshev approximates,”Mathematical Programming 26 (1983) 87–99.
R.T. Rockaffelar,Convex analysis (Princeton University Press, Princeton, 1970).
J. Stoer and C. Witzgall,Convexity and optimization in finite dimensions I (Springer-Verlag, New York, 1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Grotzinger, S.J. Supports and convex envelopes. Mathematical Programming 31, 339–347 (1985). https://doi.org/10.1007/BF02591955
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591955