Solving Nonconvex Optimization Problems in Systems and Control: A Polynomial B-spline Approach

Many problems in systems and control 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 three test problems from systems and control. The obtained results agree with those reported in literature.