Algorithm 852
From MaRDI portal
Publication:3549165
DOI10.1145/1132973.1132980zbMath1346.65020OpenAlexW2073787328WikidataQ113310695 ScholiaQ113310695MaRDI QIDQ3549165
Frédéric Benhamou, Laurent Granvilliers
Publication date: 21 December 2008
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132973.1132980
Numerical computation of solutions to systems of equations (65H10) General methods in interval analysis (65G40)
Related Items (42)
Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems ⋮ Optimization modulo non-linear arithmetic via incremental linearization ⋮ Contractor programming ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations ⋮ A fuzzy constraint-based approach to data reconciliation in material flow analysis ⋮ Constraint propagation on quadratic constraints ⋮ A certified branch \& bound approach for reliability-based optimization problems ⋮ Automated design of fractional PI QFT controller using interval constraint satisfaction technique (ICST) ⋮ raSAT: an SMT solver for polynomial constraints ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ 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 ⋮ Variable symmetry breaking in numerical constraint problems ⋮ Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test ⋮ On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach ⋮ Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems ⋮ Estimation of the Minimal Duration of an Attitude Change for an Autonomous Agile Earth-Observing Satellite ⋮ Constructive Interval Disjunction ⋮ Polynomial function intervals for floating-point software verification ⋮ An effective method to interval observer design for time-varying systems ⋮ A Tabu Search Method for Interval Constraints ⋮ A branch and prune algorithm for the computation of generalized aspects of parallel robots ⋮ Probabilistic constraints for nonlinear inverse problems ⋮ Model Repair for Probabilistic Systems ⋮ A reliable affine relaxation method for global optimization ⋮ Reverse propagation of McCormick relaxations ⋮ Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization ⋮ QFT prefilter design for multivariable systems using interval constraint satisfaction technique ⋮ A new framework for sharp and efficient resolution of NCSP with manifolds of solutions ⋮ Improving inter-block backtracking with interval Newton ⋮ Computation of spectral sets for uncertain linear fractional-order systems ⋮ Interval observer design for consistency checks of nonlinear continuous-time systems ⋮ LP narrowing: A new strategy for finding all solutions of nonlinear equations ⋮ Exploiting Binary Floating-Point Representations for Constraint Propagation ⋮ raSAT: An SMT Solver for Polynomial Constraints ⋮ RealPaver ⋮ Local consistency for extended CSPs ⋮ Enhancing numerical constraint propagation using multiple inclusion representations ⋮ Interval propagation and search on directed acyclic graphs for numerical constraint solving ⋮ How do you compute the midpoint of an interval? ⋮ Formalization of Bernstein polynomials and applications to global optimization
Uses Software
This page was built for publication: Algorithm 852
