Abstract
A family of real functions, calledr-convex functions, which represents a generalization of the notion of convexity is introduced. This family properly includes the family of convex functions and is included in the family of quasiconvex functions. Some properties ofr-convex functions are derived and relations with other generalizations of convex functions are discussed.
Similar content being viewed by others
References
K.J. Arrow and A.C. Enthoven, “Quasi-concave programming,”Econometrica 29 (1961) 779–800.
R.G. Bartle,The elements of real analysis (John Wiley & Sons, 1964).
W. Fenchel, “Convex cones, sets and functions,”Lecture notes (Princeton University, 1953).
G.H. Hardy, J.E. Littlewood and G. Polya,Inequalities (Cambridge University Press, 1967).
A. Klinger and O.L. Mangasarian, “Logarithmic convexity and geometric programming,”Journal of Mathematical Analysis and Applications 24 (1968) 388–408.
O.L. Mangasarian, “Pseudo-convex functions,”SIAM Journal on Control, Ser. A, 3 (1965) 281–290.
B. Martos, “Nem-lineáris programmozási Módszerek Hatóköre,” (the power of nonlinear programming methods) MTA Közgazdaságtudományi Intėzetėnek Közlemėnyei No. 20 (Budapest, 1966) (in Hungarian).
J. Ponstein, “Seven kinds of convexity,”SIAM Review 9 (1967) 115–119.
Author information
Authors and Affiliations
Additional information
Research for this paper was supported in part by the Gerard Swope Fund at the Technion.
Rights and permissions
About this article
Cite this article
Avriel, M. r-convex functions. Mathematical Programming 2, 309–323 (1972). https://doi.org/10.1007/BF01584551
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584551