A new exclusion test.

DOI10.1016/S0377-0427(02)00702-1zbMath1034.65033MaRDI QIDQ1872936

Kurt Georg

Publication date: 19 May 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

performance; Computational complexity; nonlinear systems of equations; Exclusion tests; linera programming

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

65Y20: Complexity and performance of numerical algorithms

Related Items

LP narrowing: A new strategy for finding all solutions of nonlinear equations, Solving a huff-like competitive location and design model for profit maximization in the plane, A new exclusion test for finding the global minimum, An efficient algorithm for finding all solutions of separable systems of nonlinear equations, Nonlinear optimization exclusion tests for finding all solutions of nonlinear equations, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions

Uses Software

• ADOL-C
• PHCpack
• INTOPT_90

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of exclusion algorithms for optimization
• A computational method for finding all the roots of a vector function
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• Rigorous global search: continuous problems
• A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations
• Interval solution of nonlinear equations using linear programming
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• Improving the efficiency of exclusion algorithms
• A Test for Existence of Solutions to Nonlinear Systems
• Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
• Algorithm 755: ADOL-C
• Algorithm 795