A parallel interval method implementation for global optimization using dynamic load balancing

DOI10.1007/BF02390523zbMath0833.65053OpenAlexW2326486374MaRDI QIDQ1899458

Per Lindström, Jerry Eriksson

Publication date: 14 March 1996

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02390523

zbMATH Keywords

global optimizationbranch-and-bound algorithminterval analysisparallel computationdynamic load balancing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Parallel numerical computation (65Y05)

Related Items (2)

Supporting adaptive and irregular parallelism for non-linear numerical optimization ⋮ On estimating workload in interval branch-and-bound global optimization algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization using interval analysis - the multi-dimensional case
• What can interval analysis do for global optimization?
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• Anomalies in parallel branch-and-bound algorithms
• A Test for Existence of Solutions to Nonlinear Systems
• A Computational Test for Convergence of Iterative Methods for Nonlinear Systems

This page was built for publication: A parallel interval method implementation for global optimization using dynamic load balancing