On the complexity of exclusion algorithms for optimization
type: Item
instance of: scholarly article
title: On the complexity of exclusion algorithms for optimization
zbMATH Open document ID: 1005.68082
author: Eugene L. Allgower
author: Melissa Erdmann
author: Kurt Georg
published in: Journal of Complexity
publication date: 2002-09-30T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1809753
zbMATH Keywords: exclusion algorithms
zbMATH Keywords: interval analysis
describes a project that uses: INTOPT_90
MaRDI profile type: Publication
full work available at URL: jcom.2002.0638
OpenAlex ID: W2025050040
cites work: Subdivision Direction Selection in Interval Methods for Global Optimization
cites work: Abstract Generalized Bisection and a Cost Bound
cites work: Rigorous global search: continuous problems
cites work: Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
cites work: The cluster problem in multivariate global optimization
cites work: Q3207999
cites work: Q4040272
cites work: A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
cites work: A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
DOI: 10.1006/JCOM.2002.0638
description: scientific article; zbMATH DE number 1809753