Abstract Generalized Bisection and a Cost Bound

DOI10.2307/2008257MaRDI QIDQ3769862zbMATH OpenOpenAlexFDO

Authors Ralph Baker Kearfott

Publication date 1987

Full work available at URL https://doi.org/10.2307/2008257

zbMATH Keywords

global optimizationanalysis of algorithmsKantorovich theoremgeneralized bisectionbinary search algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Some tests of generalized bisection
• Box-bisection for solving second-degree systems and the problem of clustering
• A bisection method for systems of nonlinear equations
• Publication:4885369
• Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems

Cited in

(23)

• Exclusion regions for optimization problems
• Calculation of multivariate Chebyshev-type inequalities
• Experiments using interval analysis for solving a circuit design problem
• What can interval analysis do for global optimization?
• Some observations on exclusion regions in branch and bound algorithms
• Formulas for the width of interval products
• Some tests of generalized bisection
• A general iterative sparse linear solver and its parallelization for interval Newton methods
• Optimizing INTBIS on the CRAY Y-MP
• scientific article; zbMATH DE number 903755 (Why is no real title available?)
• Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
• Homotopies for solving polynomial systems within a bounded domain
• Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
• Interval Newton/generalized bisection when there are singularities near roots
• The multivariate bisection algorithm
• Nonsmooth exclusion test for finding all solutions of nonlinear equations
• Bisections above Tight Lower Bounds
• scientific article; zbMATH DE number 4062838 (Why is no real title available?)
• Some feasibility sampling procedures in interval methods for constrained global optimization
• Computation of Topological Degree Using Interval Arithmetic, and Applications
• On the complexity of exclusion algorithms for optimization
• Application of interval Newton's method to chemical engineering problems
• On the problem of starting points for iterative methods

This page was built for publication: Abstract Generalized Bisection and a Cost Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769862)