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.
Copyright © 2012 Geetanjali Panda. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
G. Panda, Minimizing a function using posynomial approximation, J. Math. Comput. Sci. 2 (2012), 1073–1077.
BibTeX
@article{Panda2012,
author = {Panda, Geetanjali},
title = {Minimizing a function using posynomial approximation},
journal = {J. Math. Comput. Sci.},
volume = {2},
year = {2012},
pages = {1073--1077},
doi = {}
}