Numerica

swMATH21227MaRDI QIDQ33038FDOQ33038

Author name not available (Why is that?)

Described by source

• A gentle introduction to Numerica

Cited In (46)

• Exclusion regions for optimization problems
• Validated constraints solving --- practicalities, pitfalls, and new developments
• Solving kinematics problems by efficient interval partitioning
• Simulation of discrete linear time-invariant fuzzy dynamic systems
• On verified numerical computations in convex programming
• Constraint and integer programming in OPL
• A certified branch \& bound approach for reliability-based optimization problems
• Termination of floating-point computations
• Efficient interval partitioning-local search collaboration for constraint satisfaction
• Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
• Some observations on exclusion regions in branch and bound algorithms
• An analysis of arithmetic constraints on integer intervals
• Title not available (Why is that?)
• Node selection strategies in interval branch and bound algorithms
• Safe and tight linear estimators for global optimization
• Formulation for reliable analysis of structural frames
• An interval component for continuous constraints.
• Design, implementation, and evaluation of the constraint language cc(FD)
• Consistency techniques in ordinary differential equations
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Constraint propagation on quadratic constraints
• A Constraint Satisfaction Approach for Enclosing Solutions to Parametric Ordinary Differential Equations
• Interval-based projection method for under-constrained numerical systems
• A reliable affine relaxation method for global optimization
• Improving inter-block backtracking with interval Newton
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A standard branch-and-bound approach for nonlinear semi-infinite problems
• Interval computations, rigour and non-rigour in deterministic continuous global optimization
• Contractor programming
• Localizer
• Accelerating filtering techniques for numeric CSPs
• Local consistency for extended CSPs
• Adaptive constructive interval disjunction: algorithms and experiments
• Computing the pessimism of inclusion functions
• CPBPV: a constraint-programming framework for bounded program verification
• Range-only SLAM with indistinguishable landmarks; a constraint programming approach
• Thick set inversion
• Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
• A rigorous global filtering algorithm for quadratic constraints
• A generic interval branch and bound algorithm for parameter estimation
• Domain reduction techniques for global NLP and MINLP optimization
• A microkernel architecture for constraint programming
• Set-membership state estimation with fleeting data
• Actions of the hyperoctahedral group to compute minimal contractors
• Localizer: A Modeling Language for Local Search
• Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem

This page was built for software: Numerica