A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
From MaRDI portal
(Redirected from Publication:968347)
Recommendations
- Numerical constraint satisfaction problems with non-isolated solutions
- Interval-based projection method for under-constrained numerical systems
- Enhancing numerical constraint propagation using multiple inclusion representations
- scientific article; zbMATH DE number 2086979
- A manifold-based approach to sparse global constraint satisfaction problems
Cites work
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 1304552 (Why is no real title available?)
- scientific article; zbMATH DE number 1440918 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- A right-preconditioning process for the formal-algebraic approach to inner and outer estimation of AE-solution sets.
- Algorithm 852
- An Interval Step Control for Continuation Methods
- Applying interval arithmetic to real, integer, and boolean constraints
- Interval Methods for Systems of Equations
- Iterative Solution of Nonlinear Equations in Several Variables
- Overestimation in Linear Interval Equations
- Parallel robots
- Rigorous Sensitivity Analysis for Systems of Linear and Nonlinear Equations
- Solving Polynomial Systems Using a Branch and Prune Approach
- Testing Unconstrained Optimization Software
- Validated solutions of initial value problems for ordinary differential equations
Cited in
(9)- 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
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- First order rejection tests for multiple-objective optimization
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A branch and prune algorithm for the computation of generalized aspects of parallel robots
- The octagon abstract domain for continuous constraints
- Interval-based projection method for under-constrained numerical systems
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)