Some tests of generalized bisection
DOI10.1145/29380.29862zbMATH Open0632.65056OpenAlexW2006086279MaRDI QIDQ3769863FDOQ3769863
Authors: Ralph Baker Kearfott
Publication date: 1987
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1987-13/
Recommendations
homotopyinterval arithmeticquasi-Newton methodcontinuation methodshomotopy methodglobal constrained optimizationtest problemgeneralized bisection``expansion and ``exclusion stepshybrid steepest descent/quasi-Newton methods
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)
Cited In (28)
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
- OPTIMAL INVESTMENT STRATEGY VIA INTERVAL ARITHMETIC
- A dimension-reducing method for solving systems of nonlinear equations in
- Corrigenda: “Some Tests of Generalized Bisection”
- Calculation of multivariate Chebyshev-type inequalities
- Experiments using interval analysis for solving a circuit design problem
- Global optimization by continuous grasp
- A rapid generalized method of bisection for solving systems of non-linear equations
- On the complexity of isolating real roots and computing with certainty the topological degree
- The use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB method
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method
- The bisection method in higher dimensions
- A general iterative sparse linear solver and its parallelization for interval Newton methods
- Optimizing INTBIS on the CRAY Y-MP
- Title not available (Why is that?)
- Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
- Computation of the distance to semi-algebraic sets
- Homotopies for solving polynomial systems within a bounded domain
- Abstract Generalized Bisection and a Cost Bound
- Interval Newton/generalized bisection when there are singularities near roots
- Global convergence and the Powell singular function
- Interval solution of nonlinear equations using linear programming
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- Interval QFT: a mathematical and computational enhancement of QFT
- Solving systems of nonlinear equations In using a rotating hyperplane in
- Finding all solutions of a class of nonlinear equations using an improved LP test
- Global root bracketing method with adaptive mesh refinement
- Finding all solutions of nonlinear equations using the dual simplex method
This page was built for publication: Some tests of generalized bisection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769863)