Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-22T04:54:50.283Z Has data issue: false hasContentIssue false
  • English
  • Français

Continuity properties of vector-valued convex functions

Part of: Topological linear spaces and related structures

Published online by Cambridge University Press:  09 April 2009

L. I. Trudzik
L. I. Trudzik
Affiliation:
Department of MathematicsUniversity of MelbourneParkville, Victoria 3052, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We extend various characterizations of scalar-valued lower semicontinuity and determine their relationship to the continuity of vector-valued convex functions. Order completeness of the range space is not assumed.

Keywords

vector-valued convex functionscontinuouslower semicontinuouslower quasicontinuous.

MSC classification

Secondary: 46A40: Ordered topological linear spaces, vector lattices 46A55: Convex sets in topological linear spaces; Choquet theory 90C48: Programming in abstract spaces
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 36 , Issue 3 , June 1984 , pp. 404 - 415
Copyright
Copyright © Australian Mathematical Society 1984

References

[1]Berge, C., Topological spaces (Oliver and Boyd, Edinburgh, 1963).Google Scholar
[2]Borwein, J. M., ‘Continuity and differentiability properties of convex operators,’ Proc. London Math. Soc. (3) 44 (1982), 420–444.CrossRefGoogle Scholar
[3]Borwein, J. M., ‘Convex relations in analysis and optimization,’ Generalized concavity in optimization and economics, pp. 335–377, edited by Schaible, S. and Ziemba, W. T. (Academic Press, London, 1981).Google Scholar
[4]Borwein, J. M. and Wolkowicz, H., Characterizations of optimality without constraint qualification for the abstract convex program,’ Math. Programming Stud. 19 (1982), 77–100.CrossRefGoogle Scholar
[5]Craven, B. D. and Zlobec, S., ‘Complete characterization of optimality for convex programming in Banach spaces,’ Applicable Anal. 11 (1980), 61–78.CrossRefGoogle Scholar
[6]Jameson, G., Ordered linear spaces (Lecture Notes in Math. 141, Springer-Verlag, Berlin, 1970).CrossRefGoogle Scholar
[7]Penot, J. P., ‘Compact nets, filters and relations,’ J. Math. Anal. Appl., to appear.Google Scholar
[8]Peressini, A. L., Ordered topological vector spaces (Harper and Row, New York, 1967).Google Scholar
[9]Rockafellar, R. T., Convex analysis (Princeton Univ. Press, Princeton, N.J., 1970).CrossRefGoogle Scholar
[10]Rockafellar, R. T., Conjugate duality and optimization (CBMS Lecture Note Series 16, SIAM Publications, Philadelphia, Pa., 1974).CrossRefGoogle Scholar
[11]Schaefer, H. H., Topological vector spaces (Graduate Texts in Math. 3, Springer-Verlag, New York, 1980).Google Scholar
[12]Théra, M., ‘Convex lower-semi-continuous vector-valued mappings and applications to convex analysis,’ Operations Research Verfahren 31 (1979), 631–636.Google Scholar
[13]Théra, M., ‘Subdifferential calculus for convex operators,’ J. Math. Anal. Appl. 80 (1981), 78–91.CrossRefGoogle Scholar
[14]Thibault, L., ‘Subdifferentials of compactly Lipschitzian vector-valued functions,’ Ann. Mat. Pura Appl. 125 (1980), 157–192.CrossRefGoogle Scholar
[15]Trudzik, L. I., ‘On optimality in abstract convex programming,’ Research Report No. 13 (1982), Z. Operations Res. Ser. A. 27 (1983), 1–16.Google Scholar