P. S. V. Nataraj and M. Arounassalame. A New Subdivision Algorithm for the Bernstein Polynomial Approach to Global Optimization. International Journal of Automation and Computing, vol. 4, no. 4, pp. 342-352, 2007. DOI: 10.1007/s11633-007-0342-7
Citation: P. S. V. Nataraj and M. Arounassalame. A New Subdivision Algorithm for the Bernstein Polynomial Approach to Global Optimization. International Journal of Automation and Computing, vol. 4, no. 4, pp. 342-352, 2007. DOI: 10.1007/s11633-007-0342-7

A New Subdivision Algorithm for the Bernstein Polynomial Approach to Global Optimization

  • In this paper,an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems.The proposed algorithm is based on the Bernstein polynomial approach.Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point,modified rules for the selection of the subdivision direction,and a new acceleration device to avoid some unnecessary subdivisions.The performance of the proposed algorithm is numerically tested on a collection of 16 test problems.The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return