Volume 18, No. 6, 2021

Polynomial B-Spline Methods For Nonconvex Optimization Problems

Deepak Gawali


Constrained optimization problems with multivariate polynomial objective functions provide a useful framework for addressing several problem types in engineering. For the purpose of constrained global optimization of multivariate polynomial functions, we offer techniques based on the polynomial B-spline form. Using a bound-and-prune structure, the proposed algorithms are developed. The suggested fundamental constrained global optimization algorithms were put to the test using test issues drawn from the field of systems analysis. The findings are consistent with what has been published.

Pages: 9053-9064

Keywords: B-spline expansion, System analysis, Constrained optimization.

Full Text