Solving Polynomial Systems Using a Branch and Prune Approach

DOI10.1137/S0036142995281504zbMath0874.65039OpenAlexW2084965339MaRDI QIDQ4337465

Deepak Kapur, Pascal Van Hentenryck, David Allen McAllester

Publication date: 2 November 1997

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0036142995281504

zbMATH Keywords

continuation methodinterval arithmeticpolynomial systemsglobal search methodbranch and prune algorithm

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)

Related Items (30)

Contractor programming ⋮ Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations ⋮ Gröbner bases for polynomial systems with parameters ⋮ \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton} ⋮ An improved dynamic multi-objective optimization approach for nonlinear equation systems ⋮ Numerical solution for bounding feasible point sets ⋮ Efficiently counting affine roots of mixed trigonometric polynomial systems ⋮ Solving kinematics problems by efficient interval partitioning ⋮ Algorithms for computing Nash equilibria in deterministic LQ games ⋮ A branch and prune algorithm for the computation of generalized aspects of parallel robots ⋮ Improving the DISPGB algorithm using the discriminant ideal ⋮ Reverse propagation of McCormick relaxations ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ A new hybrid algorithm based on chaotic maps for solving systems of nonlinear equations ⋮ A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems ⋮ A new framework for sharp and efficient resolution of NCSP with manifolds of solutions ⋮ An adaptive learning rate backpropagation‐type neural network for solving n × n systems on nonlinear algebraic equations ⋮ Safe and tight linear estimators for global optimization ⋮ A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization ⋮ Canonical dual least square method for solving general nonlinear systems of quadratic equations ⋮ Applying genetic algorithms for solving nonlinear algebraic equations ⋮ The Forthcoming IEEE Standard 1788 for Interval Arithmetic ⋮ Structural analysis by generalized embedding method for integro-differential-algebraic equations ⋮ Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic ⋮ Computing zeros of analytic mappings: A logarithmic residue approach ⋮ A gentle introduction to Numerica ⋮ A numerical algorithm to find soft-constrained Nash equilibria in scalar LQ-games ⋮ Probabilistic temporal logics via the modal mu-calculus ⋮ A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations ⋮ Accelerating filtering techniques for numeric CSPs

Uses Software

• PASCAL-XSC

This page was built for publication: Solving Polynomial Systems Using a Branch and Prune Approach