The following pages link to Algorithm 852 (Q3549165):
Displaying 41 items.
- RealPaver (Q16577) (← links)
- Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Finding all solutions of separable systems of piecewise-linear equations using integer programming (Q413729) (← links)
- Polynomial function intervals for floating-point software verification (Q457251) (← links)
- An effective method to interval observer design for time-varying systems (Q472606) (← links)
- Probabilistic constraints for nonlinear inverse problems (Q481705) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- Reverse propagation of McCormick relaxations (Q496587) (← links)
- Constraint propagation on quadratic constraints (Q606897) (← links)
- Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645) (← links)
- Computation of spectral sets for uncertain linear fractional-order systems (Q718190) (← links)
- LP narrowing: A new strategy for finding all solutions of nonlinear equations (Q732502) (← links)
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Contractor programming (Q840818) (← links)
- Variable symmetry breaking in numerical constraint problems (Q900305) (← links)
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
- Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems (Q907591) (← links)
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions (Q968347) (← links)
- Interval observer design for consistency checks of nonlinear continuous-time systems (Q987611) (← links)
- Local consistency for extended CSPs (Q1035707) (← links)
- Enhancing numerical constraint propagation using multiple inclusion representations (Q1039582) (← links)
- Interval propagation and search on directed acyclic graphs for numerical constraint solving (Q1041436) (← links)
- A certified branch \& bound approach for reliability-based optimization problems (Q1679494) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization (Q1753511) (← links)
- Automated design of fractional PI QFT controller using interval constraint satisfaction technique (ICST) (Q1929008) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations (Q2154032) (← links)
- Improving inter-block backtracking with interval Newton (Q2267807) (← links)
- Formalization of Bernstein polynomials and applications to global optimization (Q2351165) (← links)
- A branch and prune algorithm for the computation of generalized aspects of parallel robots (Q2453696) (← links)
- Exploiting Binary Floating-Point Representations for Constraint Propagation (Q2806863) (← links)
- raSAT: An SMT Solver for Polynomial Constraints (Q2817923) (← links)
- A fuzzy constraint-based approach to data reconciliation in material flow analysis (Q2930725) (← links)
- Model Repair for Probabilistic Systems (Q3000664) (← links)
- Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite (Q3523054) (← links)
- Constructive Interval Disjunction (Q3523079) (← links)
- QFT prefilter design for multivariable systems using interval constraint satisfaction technique (Q5167592) (← links)
- A Tabu Search Method for Interval Constraints (Q5387647) (← links)
- How do you compute the midpoint of an interval? (Q5498687) (← links)
