Abstract
We investigate the characteristics that have to be possessed by a functional mapping f:ℝ↦ℝ so that it is suitable to be employed in a variable transformation of the type x→f(y) in the convexification of posynomials. We study first the bilinear product of univariate functions f1(y1), f2(y2) and, based on convexity analysis, we derive sufficient conditions for these two functions so that ℱ2(y1,y2)=f1(y1)f2(y2) is convex for all (y1,y2) in some box domain. We then prove that these conditions suffice for the general case of products of univariate functions; that is, they are sufficient conditions for every fi(yi), i=1,2,…,n, so as ℱn(y1,y2,…,yn)=∏i=1nfi(yi) to be convex. In order to address the transformation of variables that are exponentiated to some power κ≠1, we investigate under which further conditions would the function (f)κ be also suitable. The results provide rigorous reasoning on why transformations that have already appeared in the literature, like the exponential or reciprocal, work properly in convexifying posynomial programs. Furthermore, a useful contribution is in devising other transformation schemes that have the potential to work better with a particular formulation. Finally, the results can be used to infer the convexity of multivariate functions that can be expressed as products of univariate factors, through conditions on these factors on an individual basis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.