Abstract Generalized Bisection and a Cost Bound
From MaRDI portal
Publication:3769862
DOI10.2307/2008257zbMath0632.65055OpenAlexW4248368285MaRDI QIDQ3769862
Publication date: 1987
Full work available at URL: https://doi.org/10.2307/2008257
global optimizationanalysis of algorithmsKantorovich theoremgeneralized bisectionbinary search algorithms
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Related Items
Homotopies for solving polynomial systems within a bounded domain, Formulas for the width of interval products, Application of interval Newton's method to chemical engineering problems, A general iterative sparse linear solver and its parallelization for interval Newton methods, Optimizing INTBIS on the CRAY Y-MP, Nonsmooth exclusion test for finding all solutions of nonlinear equations, On the problem of starting points for iterative methods, Interval Newton/generalized bisection when there are singularities near roots, Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems, What can interval analysis do for global optimization?, Some feasibility sampling procedures in interval methods for constrained global optimization, Computation of Topological Degree Using Interval Arithmetic, and Applications, Exclusion regions for optimization problems, On the complexity of exclusion algorithms for optimization, Calculation of multivariate Chebyshev-type inequalities, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Experiments using interval analysis for solving a circuit design problem, Some observations on exclusion regions in branch and bound algorithms
