Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers

Remigijus Paulavičius () and Julius Žilinskas ()
Additional contact information
Remigijus Paulavičius: Vilnius Pedagogical University
Julius Žilinskas: Vilnius Gediminas Technical University

A chapter in Parallel Scientific Computing and Optimization, 2009, pp 93-102 from Springer

Abstract: Abstract Parallel branch and bound for global Lipschitz minimization is considered. A combination of extreme (infinite and first) and Euclidean norms over a multidimensional simplex is used to evaluate the lower bound. OpenMP has been used to implement the parallel version of the algorithm for multicore computers. The efficiency of the developed parallel algorithm is investigated solving multidimensional test functions for global optimization.

Keywords: Global Optimization; Feasible Region; Parallel Version; Sequential Algorithm; Lipschitz Bound (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-09707-7_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387097077

DOI: 10.1007/978-0-387-09707-7_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().