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

DOI10.1007/BF01097060zbMath0841.90116OpenAlexW1982147057MaRDI QIDQ1904648

Tibor Csendes, Dietmar Ratz

Publication date: 24 July 1996

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

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

zbMATH Keywords

global optimizationinterval branch-and-bound algorithmsinterval subdivision selection rule

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items (26)

Interval QFT: a mathematical and computational enhancement of QFT ⋮ On the selection of subdivision directions in interval branch-and-bound methods for global optimization ⋮ Experiments with range computations using extrapolation ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ Solving a huff-like competitive location and design model for profit maximization in the plane ⋮ Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints ⋮ Interval Methods for Global Optimization Using the Boxing Method ⋮ Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ Heuristic rejection in interval 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 ⋮ A new hybrid genetic algorithm for global optimization ⋮ Efficient interval partitioning for constrained global optimization ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms ⋮ On the properties of Sard kernels and multiple error estimates for bounded linear functionals of bivariate functions with application to non-product cubature ⋮ The extrapolated interval global optimization algorithm ⋮ New interval methods for constrained global optimization ⋮ An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions ⋮ Lipschitz continuity and the termination of interval methods for global optimization ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Parallel methods for verified global optimization practice and theory ⋮ Experiments with new stochastic global optimization search techniques ⋮ New results on verified global optimization ⋮ Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization

Uses Software

• INTBIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the selection of subdivision directions in interval branch-and-bound methods for global optimization