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

DOI10.1007/BF02390523MaRDI QIDQ1899458zbMATH OpenOpenAlexFDO

Authors Jerry Eriksson, Per Lindström

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

branch-and-bound algorithmglobal optimizationparallel computationinterval analysisdynamic load balancing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 804619
• scientific article; zbMATH DE number 1756137
• A parallel global optimization method and its implementation on a transputer system
• A parallel algorithm for global optimization
• Balancing global and local search in parallel efficient global optimization algorithms
• Generalized parallel computational schemes for time-consuming global optimization
• scientific article; zbMATH DE number 1373525

Cites work

• scientific article; zbMATH DE number 3917583 (Why is no real title available?)
• scientific article; zbMATH DE number 3707674 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• A Computational Test for Convergence of Iterative Methods for Nonlinear Systems
• A Test for Existence of Solutions to Nonlinear Systems
• Anomalies in parallel branch-and-bound algorithms
• Global optimization using interval analysis - the multi-dimensional case
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• What can interval analysis do for global optimization?

Cited in

(9)

• scientific article; zbMATH DE number 1756137 (Why is no real title available?)
• Branch-and-Bound interval global optimization on shared memory multiprocessors
• scientific article; zbMATH DE number 2080143 (Why is no real title available?)
• Some new acceleration mechanisms in verified global optimization
• Supporting adaptive and irregular parallelism for non-linear numerical optimization
• On estimating workload in interval branch-and-bound global optimization algorithms
• Parallel branch-and-bound attraction based methods for global optimzation
• A parallel method for verifying global optimization
• A new parallel method for verified global optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899458)