Return to search

A Vector Parallel Branch and Bound Algorithm

<p> Global optimization problems sometimes attain their extrema on infinite subsets of the search space, forcing mathematically rigorous programs to require large amounts of data to describe these sets. This makes these programs natural candidates for both vectorization methods and parallel computing. Here, we give a brief overview of parallel computing and vectorization methods, exploit their availability by constructing a fully distributed implementation of a mathematically rigorous Vector Parallel Branch and Bound Algorithm using MATLAB&rsquo;s SPMD architecture and interval arithmetic, and analyze the performance of the algorithm across different methods of inter-processor communication.</p><p>

Identiferoai:union.ndltd.org:PROQUEST/oai:pqdtoai.proquest.com:10242153
Date13 September 2017
CreatorsGuilbeau, Jared T.
PublisherUniversity of Louisiana at Lafayette
Source SetsProQuest.com
LanguageEnglish
Detected LanguageEnglish
Typethesis

Page generated in 0.0018 seconds