A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
DOI10.1007/S10601-009-9082-3zbMATH Open1203.65086OpenAlexW2129041497MaRDI QIDQ968347FDOQ968347
Alexandre Goldsztejn, Laurent Granvilliers
Publication date: 5 May 2010
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-009-9082-3
numerical examplesCSPinterval analysisbranch and prune algorithmglobal constraint for under-constrained systems of equationspreconditioned interval Newton
Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 852
- Testing Unconstrained Optimization Software
- Interval Methods for Systems of Equations
- Iterative Solution of Nonlinear Equations in Several Variables
- A right-preconditioning process for the formal-algebraic approach to inner and outer estimation of AE-solution sets.
- Parallel robots
- Validated solutions of initial value problems for ordinary differential equations
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- Applying interval arithmetic to real, integer, and boolean constraints
- Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations
- Overestimation in Linear Interval Equations
- An Interval Step Control for Continuation Methods
- Solving Polynomial Systems Using a Branch and Prune Approach
Cited In (8)
- The octagon abstract domain for continuous constraints
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- Exclusion regions for parameter-dependent systems of equations
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- Estimating the robust domain of attraction for difference inclusions using an interval Lyapunov equation
- First order rejection tests for multiple-objective optimization
- A branch and prune algorithm for the computation of generalized aspects of parallel robots
Uses Software
This page was built for publication: A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968347)
