Abstract
Subvexormal functions and subinvexormal functions are proposed, whose properties are shared commonly by most generalized convex functions and most generalized invex functions, respectively. A necessary and sufficient condition for a subvexormal function to be subinvexormal is given in the locally Lipschitz and regular case. Furthermore, subvex functions and subinvex functions are introduced. It is proved that the class of strictly subvex functions is equivalent to that of functions whose local minima are global and that, in the locally Lipschitz and regular case, both strongly subvex functions and strongly subinvex functions can be characterized as functions whose relatively stationary points (slight extension of stationary points) are global minima.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Mangasarian, O. L., Nonlinear Programming, McGraw-Hill, New York, New York, 1969.
Vial, J. R., Strong and Weak Convexity of Sets and Functions, Mathematics of Operations Research, Vol. 8, pp. 231–259, 1983.
Ben-Israel, A., and Mond, B., What is Invexity?, Journal of the Australian Mathematical Society, Vol. 28B, pp. 1–9, 1986.
Hanson, M. A., and Mond, B., Convex Transformable Programming Problems and Invexity, Journal of Information and Optimization Sciences, Vol. 8, pp. 201–207, 1987.
Jeyakumar, W., Strong and Weak Invexity in Mathematical Programming, Methods of Operations Research, Vol. 55, pp. 107–125, 1985.
Ewing, G. M., Sufficient Conditions for Global Minima of Suitable Convex Functions from Variational and Control Theory, SIAM Review, Vol. 19, pp. 202–220, 1977.
Kaul, R. N., and Kaur, S., Generalization of Convex and Related Functions, European Journal of Operational Research, Vol. 9, pp. 369–377, 1982.
Weir, T., Programming with Semilocally Convex Functions, Journal of Mathematical Analysis and Applications, Vol. 168, pp. 1–12, 1992.
Kaul, R. N., Lyall, V., and Kaur, S., Locally Connected Sets and Functions, Journal of Mathematical Analysis and Applications, Vol. 134, pp. 30–45, 1988.
Yang, X. Q., and Chen, G. Y., A Class of Nonconvex Functions and Prevariational Inequalities, Journal of Mathematical Analysis and Applications, Vol. 169, pp. 359–373, 1992.
Bector, C. R., Chandra, S., Gupta, S., and Suneja, S. K., Univex Sets, Functions, and Univex Nonlinear Programming, Generalized Convexity, Edited by S. Komlosi, T. Rapcsak, and S. Schaible, Springer Verlag, Berlin, Germany, pp. 1–18, 1993.
Jeyakumar, V., and Mond, B., On Generalized Convex Mathematical Programming, Journal of the Australian Mathematical Society, Vol. 34B, pp. 43–53, 1992.
Hanson, M. A., On Sufficiency of the Kuhn-Tucker Conditions, Journal of Mathematical Analysis and Applications, Vol. 80, pp. 545–550, 1982.
Craven, B. D., Invex Functions and Constrained Local Minima, Bulletin of the Australian Mathematical Society, Vol. 24, pp. 357–366, 1981.
Jeyakumar, V., Equivalence of Saddle Points and Optima, and Duality for a Class of Nonsmooth Nonconvex Problems, Journal of Mathematical Analysis and Applications, Vol. 130, pp. 334–343, 1988.
Bector, C. R., Suneja, S. K., and Lalitha, C. S., Generalized B-Vex Functions and Generalized B-Vex Programming, Journal of Optimization Theory and Applications, Vol. 76, pp. 561–587, 1993.
Zang, I., and Avriel, M., On Functions Whose Local Minima Are Global, Journal of Optimization Theory and Applications, Vol. 16, pp. 183–190, 1975.
Zang, I., Choo, E. V., and Avriel, M., On Functions Whose Stationary Points Are Global Minima, Journal of Optimization Theory and Applications, Vol. 22, pp. 195–208, 1977.
Tanaka, Y., Fukushima, M., and Ibarak, T., On Generalized Pseudoconvex Functions, Journal of Mathematical Analysis and Applications, Vol. 144, pp. 342–355, 1989.
Tanaka, Y., Note on Generalized Convex Functions, Journal of Optimization Theory and Applications, Vol. 66, pp. 345–349, 1990.
Li, X. F., Dong, J. L., and Liu, Q. H., On Properties of Generalized Convex Functions, Northeast Operations Research and Applied Mathematics, Vol. 9, pp. 122–123, 1996.
Bazaraa, M. S., Goode, J. J., and Shetly, C. M., Constraint Qualifications Revisited, Management Science, Vol. 18, pp. 567–573, 1972.
Ursescu, C., Tangent Sets Calculus and Necessary Conditions for Extremality, SIAM Journal on Control and Optimization, Vol. 20, pp. 563–574, 1982.
Clarke, F. H., Optimization and Nonsmooth Analysis, Wiley-Interscience, New York, New York, 1983.
Li, X. F., Dong, J. L., and Liu, Q.H., Lipschitz B-Vex Functions and Nonsmooth Programming, Journal of Optimization Theory and Applications, Vol. 93, pp. 557–574, 1997.
Bector, C. R., and Singh, C., B-Vex Functions, Journal of Optimization Theory and Applications, Vol. 71, pp. 237–253, 1991.
Weir, T., and Mond, B., Preinvex Functions in Multiple-Objective Optimization, Journal of Mathematical Analysis and Applications, Vol. 136, pp. 29–38, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, X.F., Dong, J.L. Subvexormal Functions and Subvex Functions. Journal of Optimization Theory and Applications 103, 675–704 (1999). https://doi.org/10.1023/A:1021744309992
Issue Date:
DOI: https://doi.org/10.1023/A:1021744309992