In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed.We study the effect of the use of increasing convex or increasing concave transformations on the approximation of univariate (convex) functions.In this paper, we show that these transformations can be used to construct upper and lower bounds for nonconvex functions.Moreover, we show that by using such transformations of the input variable or the output variable, we obtain tighter upper and lower bounds for the approximation of convex functions than without these approximations.We show that these transformations can be applied to the approximation of a (convex) Pareto curve that is associated with a (convex) bi-objective optimization problem.
|Place of Publication||Tilburg|
|Number of pages||23|
|Publication status||Published - 2006|
|Name||CentER Discussion Paper|
- approximation theory
- convex/concave transformation
- Pareto curve