On the selection of subdivision directions in interval branch-and-bound methods for global optimization
type: Item
instance of: scholarly article
title: On the selection of subdivision directions in interval branch-and-bound methods for global optimization
zbMATH Open document ID: 0841.90116
DOI: 10.1007/BF01097060
author: Dietmar Ratz
author: Tibor Csendes
published in: Journal of Global Optimization
publication date: 1996-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 829909
zbMATH Keywords: interval subdivision selection rule
zbMATH Keywords: interval branch-and-bound algorithms
zbMATH Keywords: global optimization
describes a project that uses: INTBIS
MaRDI profile type: Publication
cites work: Q3345690
cites work: On the convergence of two branch-and-bound algorithms for nonconvex programming problems
cites work: Q4851605
cites work: Q3801355
cites work: The impact of accelerating tools on the interval subdivision algorithm for global optimization
cites work: Q4277813
cites work: Q4004279
cites work: Q4295107
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Algorithm 681: INTBIS, a portable interval Newton/bisection package
cites work: Q4003189
cites work: Q4851623
cites work: Q3928146
cites work: Q5566070
cites work: Interval Methods for Systems of Equations
cites work: Extended univariate algorithms for \(n\)-dimensional global optimization
cites work: Convergence qualification of adaptive partition algorithms in global optimization
cites work: Q4040272
cites work: Experiments using interval analysis for solving a circuit design problem
cites work: Q4855524
cites work: Computation of rational interval functions
full work available at URL: https://doi.org/10.1007/bf01097060
OpenAlex ID: W1982147057
description: scientific article; zbMATH DE number 829909