On the Complexity of Exclusion Algorithms for Optimization

Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a function over a compact domain. The present paper discusses a new class of tests for such algorithms in the context of global optimization, and presents complexity results concerning the resulting algorithms.

• Type: Journal
• Year: 2002
• Where: JC
• Authors: Eugene L. Allgower, Melissa Erdmann, Kurt Georg
• Keywords: Exclusion Algorithms, Interval Analysis, JC 2002, Well-known Tool