On the selection of subdivision directions in interval branch-and-bound methods for global optimization

DOI10.1007/BF01097060zbMath0841.90116MaRDI QIDQ1904648

Tibor Csendes, Dietmar Ratz

Publication date: 24 July 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimization; interval branch-and-bound algorithms; interval subdivision selection rule

Mathematics Subject Classification ID

90C30: Nonlinear programming

65G30: Interval and finite arithmetic

Related Items

A new hybrid genetic algorithm for global optimization, Interval QFT: a mathematical and computational enhancement of QFT, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, Lipschitz continuity and the termination of interval methods for global optimization, Experiments with range computations using extrapolation, Solving a huff-like competitive location and design model for profit maximization in the plane, Efficient interval partitioning for constrained global optimization, Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms, Heuristic rejection in interval global optimization, Experiments with new stochastic global optimization search techniques, Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization, Parallel methods for verified global optimization practice and theory, On the selection of subdivision directions in interval branch-and-bound methods for global optimization, Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm, On the Asaithambi-Zuhe-Moore algorithm for computing the range of values, New interval methods for constrained global optimization, New results on verified global optimization

Uses Software

• INTBIS

Cites Work

• Extended univariate algorithms for \(n\)-dimensional global optimization
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• Convergence qualification of adaptive partition algorithms in global optimization
• Experiments using interval analysis for solving a circuit design problem
• Lipschitzian optimization without the Lipschitz constant
• The impact of accelerating tools on the interval subdivision algorithm for global optimization
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization
• Interval Methods for Systems of Equations
• Algorithm 681: INTBIS, a portable interval Newton/bisection package
• Computation of rational interval functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item