On the complexity of exclusion algorithms for optimization
From MaRDI portal
(Redirected from Publication:700180)
Recommendations
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
- Abstract Generalized Bisection and a Cost Bound
- Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
- Rigorous global search: continuous problems
- Subdivision Direction Selection in Interval Methods for Global Optimization
- The cluster problem in multivariate global optimization
Cited in
(11)- On a parameterized system of nonlinear equations with economic applications
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Khovanskii-Rolle continuation for real solutions
- Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations
- Improving the efficiency of exclusion algorithms
- The complexity of subdivision for diameter-distance tests
- scientific article; zbMATH DE number 3974159 (Why is no real title available?)
- Condition number based complexity estimate for computing local extrema
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
- A new exclusion test.
- A new exclusion test for finding the global minimum
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)