Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
type: Item
instance of: scholarly article
title: Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
zbMATH Open document ID: 0997.90104
DOI: 10.1023/A:1008354711345
author: András Erik Csallner
author: Tibor Csendes
author: Mihály Csaba Markót
published in: Journal of Global Optimization
publication date: 2002-11-07T00:00:00Z
review text: A global optimization problem is considered whose objective function \(f(\cdot)\) is defined over an \(n\)-dimensional box, and an inclusion function for \(f(\cdot)\) is known. Several interval branch-and-bound algorithms are proposed. The usual bisection step was substituted by the subdivision of the actual interval into many subintervals. The convergence properties are investigated theoretically as well as the convergence improvements by means of the acceleration tests. The numerical testing results are supposed to the published in a subsequent paper.
reviewed by: Antanas Žilinskas
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 1523202
zbMATH Keywords: global optimization
zbMATH Keywords: branch-and-bound
zbMATH Keywords: interval arithmetic
describes a project that uses: INTOPT_90
describes a project that uses: C-XSC 2.0
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1523202