On the Complexity of Exclusion Algorithms for Optimization

✍ Scribed by Eugene Allgower; Melissa Erdmann; Kurt Georg

• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 133 KB
• Volume: 18
• Category: Article
• ISSN: 0885-064X
• DOI: 10.1006/jcom.2002.0638

✦ Synopsis

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.