Solving Nonconvex Optimization Problems: A Polynomial B-Spline Approach
Abstract
Many problems in engineering can be formulated as constrained optimization problems with multivariate polynomial objective functions. We propose algorithms based on polynomial B-spline form for constrained global optimization of multivariate polynomial functions. The proposed algorithms are based on a branch-and-bound framework. We tested the proposed basic constrained global optimization algorithms by considering test problems from systems analysis. The obtained results agree with those reported in literature.