Solving Polynomial Systems Using a Branch and Prune Approach
DOI10.1137/S0036142995281504zbMATH Open0874.65039OpenAlexW2084965339MaRDI QIDQ4337465FDOQ4337465
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
Recommendations
continuation methodinterval arithmeticpolynomial systemsglobal search methodbranch and prune algorithm
Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Cited In (35)
- Title not available (Why is that?)
- Solving kinematics problems by efficient interval partitioning
- Numerical solution for bounding feasible point sets
- An adaptive learning rate backpropagation‐type neural network for solving n × n systems on nonlinear algebraic equations
- ALGORITHMS USING A BRANCH AND BOUND METHOD FOR FINDING ALL REAL SOLUTIONS TO AN EQUATION OF ONE VARIABLE
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization
- Computing zeros of analytic mappings: A logarithmic residue approach
- The Forthcoming IEEE Standard 1788 for Interval Arithmetic
- Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations
- Improving the DISPGB algorithm using the discriminant ideal
- Safe and tight linear estimators for global optimization
- An improved dynamic multi-objective optimization approach for nonlinear equation systems
- Probabilistic temporal logics via the modal mu-calculus
- Mathematically Rigorous Global Optimization and Fuzzy Optimization
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- Contractor programming
- Gröbner bases for polynomial systems with parameters
- Accelerating filtering techniques for numeric CSPs
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- Computational Science - ICCS 2004
- Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic
- A numerical algorithm to find soft-constrained Nash equilibria in scalar LQ-games
- A branch and prune algorithm for the computation of generalized aspects of parallel robots
- Reverse propagation of McCormick relaxations
- Applying genetic algorithms for solving nonlinear algebraic equations
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Inner and Outer Approximations of Existentially Quantified Equality Constraints
- Structural analysis by generalized embedding method for integro-differential-algebraic equations
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Algorithms for computing Nash equilibria in deterministic LQ games
- A gentle introduction to Numerica
- A new hybrid algorithm based on chaotic maps for solving systems of nonlinear equations
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations
Uses Software
This page was built for publication: Solving Polynomial Systems Using a Branch and Prune Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337465)
