IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v11y2020i1d10.1007_s13198-019-00922-6.html
   My bibliography  Save this article

A GPU parallel Bernstein algorithm for polynomial global optimization

Author

Listed:
  • Priyadarshan Dhabe

    (Indian Institute of Technology Bombay)

  • P. S. V. Nataraj

    (Indian Institute of Technology Bombay)

Abstract

We come up with a graphics processing unit (GPU) parallel Bernstein algorithm (BA) aimed at global optimization of multi-variate real polynomials (Garloff in Interval Comput 2:164–168, 1993). We first propose parallel algorithms for (a) computing the multi-index set associated with the Bernstein coefficients (BCs), (b) computing the initial set of BCs using the Matrix method (Ray and Nataraj in Reliab Comput 17(1):40–71, 2012), (c) finding the minimum BC from a given set of BCs, and (d) finding the BCs of the child patches from the parent patch. We then incorporate the above components into the proposed parallel Bernstein algorithm. All the parallel algorithms are programmed for GPU accelerating devices through compute unified device architecture. We compared performance of serial and GPU parallel BA using a test suite of 8 multivariate examples. For the test examples, the proposed parallel algorithm is found 30 times faster as compared to serial one, and needs 96% less time.

Suggested Citation

  • Priyadarshan Dhabe & P. S. V. Nataraj, 2020. "A GPU parallel Bernstein algorithm for polynomial global optimization," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 21-44, February.
  • Handle: RePEc:spr:ijsaem:v:11:y:2020:i:1:d:10.1007_s13198-019-00922-6
    DOI: 10.1007/s13198-019-00922-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-019-00922-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13198-019-00922-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. P. Nataraj & M. Arounassalame, 2011. "Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm," Journal of Global Optimization, Springer, vol. 49(2), pages 185-212, February.
    2. Salhi, S. & Queen, N. M., 2004. "A hybrid algorithm for identifying global and local minima when optimizing functions with many minima," European Journal of Operational Research, Elsevier, vol. 155(1), pages 51-67, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. P. S. Dhabe & P. S. V. Nataraj, 2017. "The Bernstein algorithm using the modified implicit Bernstein form and its GPU parallelization using CUDA," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(4), pages 826-841, December.
    2. P. S. Dhabe & P. S. V. Nataraj, 2017. "A parallel Bernstein algorithm for global optimization based on the implicit Bernstein form," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1654-1671, November.
    3. Titi, Jihad & Garloff, Jürgen, 2019. "Matrix methods for the tensorial Bernstein form," Applied Mathematics and Computation, Elsevier, vol. 346(C), pages 254-271.
    4. Evrim Dalkiran & Hanif Sherali, 2013. "Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality," Journal of Global Optimization, Springer, vol. 57(4), pages 1147-1172, December.
    5. Titi, Jihad & Garloff, Jürgen, 2017. "Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 246-258.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:ijsaem:v:11:y:2020:i:1:d:10.1007_s13198-019-00922-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.