Global solutions to general polynomial benchmark optimization problems
Optimization and Control
2012-07-30 v1
Abstract
The goal of this paper is to solve a class of high-order polynomial benchmark optimization problems, including the Goldstein-Price problem and the Three Hump Camel Back problem. By using a generalized canonical duality theory, we are able to transform the nonconvex primal problems to concave dual problems over convex domain(without duality gap), which can be solved easily to obtain global solutions.
Cite
@article{arxiv.1207.6490,
title = {Global solutions to general polynomial benchmark optimization problems},
author = {Xiaojun Zhou},
journal= {arXiv preprint arXiv:1207.6490},
year = {2012}
}
Comments
9pages,6 figures