On the complexity of exclusion algorithms for optimization

DOI10.1006/jcom.2002.0638zbMath1005.68082OpenAlexW2025050040MaRDI QIDQ700180

Melissa Erdmann, Kurt Georg, Eugene L. Allgower

Publication date: 30 September 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.2002.0638

zbMATH Keywords

interval analysisexclusion algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (9)

A new exclusion test. ⋮ A new exclusion test for finding the global minimum ⋮ The complexity of subdivision for diameter-distance tests ⋮ On a parameterized system of nonlinear equations with economic applications ⋮ AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS ⋮ Khovanskii-Rolle continuation for real solutions ⋮ Condition number based complexity estimate for computing local extrema ⋮ Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations ⋮ Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions

Uses Software

• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• The cluster problem in multivariate global optimization
• Rigorous global search: continuous problems
• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• Abstract Generalized Bisection and a Cost Bound
• Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
• Subdivision Direction Selection in Interval Methods for Global Optimization

This page was built for publication: On the complexity of exclusion algorithms for optimization