Usually, generalized convex functions have been introduced in order to weaken as much as possible the convexity requirements for results related to optimization theory (in particular, optimality conditions and duality results), to optimal control problems, to variational inequalities, etc. For instance, this is the motivation for employing pseudo-convex and quasi-convex functions in [142, 143]; [228] use convexlike functions to give a very general condition for minimax problems on compact sets. Some approaches to generate new classes of generalized convex functions have been to select a property of convex functions which is to be retained and then forming the wider class of functions having this property: both pseudo-convexity and quasi-convexity can be assigned to this perspective. Other generalizations have been obtained through altering the expressions in the definition of convexity, such as the arcwise convex functions in [8] and [9], the (h, ϕ)-convex function in [17], the (α, λ)-convex functions in [27], the semilocally generalized convex functions in [113], etc.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). Invex Functions (The Smooth Case). In: Invexity and Optimization. Nonconvex Optimization and Its Applications, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78562-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-78562-0_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78561-3
Online ISBN: 978-3-540-78562-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)