Minimizing a function using posynomial approximation

Abstract

This paper discusses the use of Bernstein polynomial approximation to minimize a function of single variable  on an interval. Bernstein operator is used to prove that a single dimensional minimization problem is equivalent to a Posynomial Programming problem. Original problem is solved using the dual of this approximate problem.