Cited in
(75)- Exploiting binary floating-point representations for constraint propagation
- Finding all solutions of separable systems of piecewise-linear equations using integer programming
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
- Computation of spectral sets for uncertain linear fractional-order systems
- A certified branch \& bound approach for reliability-based optimization problems
- Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- An analysis of arithmetic constraints on integer intervals
- Logic Programming
- Model repair for probabilistic systems
- Constraint propagation on quadratic constraints
- QFT prefilter design for multivariable systems using interval constraint satisfaction technique
- How do you compute the midpoint of an interval?
- Knowledge compilation using interval automata and applications to planning
- An effective method to interval observer design for time-varying systems
- Polynomial function intervals for floating-point software verification
- Interval-based projection method for under-constrained numerical systems
- A reliable affine relaxation method for global optimization
- Predicate Abstraction of Programs with Non-linear Computation
- GPDOF
- GLOPTLAB
- ICOS
- NDA
- INTOPT_90
- COPRIN
- Gappa
- ALIAS
- gaol
- GLOPEQ
- CGLS
- AQCS
- PolyPaver
- Lurupa
- PSICO
- IBEX
- IbexOpt
- Manip
- PVSio
- FloPSy
- Boost Interval Arithmetic
- AUSTIN
- cGOP
- Numerica
- Newton
- LPH
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Improving inter-block backtracking with interval Newton
- Logic Programming
- raSAT: an SMT solver for polynomial constraints
- Automated design of fractional PI QFT controller using interval constraint satisfaction technique (ICST)
- Contractor programming
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- Real Algebraic Strategies for MetiTarski Proofs
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- Interval observer design for consistency checks of nonlinear continuous-time systems
- \(\delta \)-complete decision procedures for satisfiability over the reals
- Local consistency for extended CSPs
- Variable symmetry breaking in numerical constraint problems
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
- Probabilistic constraints for nonlinear inverse problems
- When Interval Analysis Helps Inter-block Backtracking
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- LP narrowing: A new strategy for finding all solutions of nonlinear equations
- Reverse propagation of McCormick relaxations
- Formalization of Bernstein polynomials and applications to global optimization
- A branch and prune algorithm for the computation of generalized aspects of parallel robots
- Standardized interval arithmetic and interval arithmetic used in libraries
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Exploiting single-cycle symmetries in continuous constraint problems
- raSAT: An SMT Solver for Polynomial Constraints
- A rigorous global filtering algorithm for quadratic constraints
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- Enhancing numerical constraint propagation using multiple inclusion representations
- Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems. Empirical evaluation of innovations
- dReal: an SMT solver for nonlinear theories over the reals
This page was built for software: RealPaver
