On the complexity of exclusion algorithms for optimization
From MaRDI portal
Publication:700180
DOI10.1006/JCOM.2002.0638zbMATH Open1005.68082OpenAlexW2025050040MaRDI QIDQ700180FDOQ700180
Authors: Eugene L. Allgower, Melissa Erdmann, Kurt Georg 
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
Recommendations
Cites Work
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subdivision Direction Selection in Interval Methods for Global Optimization
- The cluster problem in multivariate global optimization
- Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
- A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
- Abstract Generalized Bisection and a Cost Bound
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
Cited In (11)
- A new exclusion test for finding the global minimum
- The complexity of subdivision for diameter-distance tests
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- On a parameterized system of nonlinear equations with economic applications
- Khovanskii-Rolle continuation for real solutions
- Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
- Condition number based complexity estimate for computing local extrema
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
- A new exclusion test.
- Title not available (Why is that?)
- Improving the efficiency of exclusion algorithms
Uses Software
This page was built for publication: On the complexity of exclusion algorithms for optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700180)
