Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
From MaRDI portal
Publication:312490
DOI10.1007/s10898-015-0390-4zbMath1353.90113OpenAlexW2214097909MaRDI QIDQ312490
Victor Reyes, Ignacio J. Araya
Publication date: 15 September 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0390-4
interval arithmeticconstraint propagationbranch and bound algorithminterval-based solvernumerical constrained optimizationnumerical constraint satisfaction
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems ⋮ (Global) optimization: historical notes and recent developments ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
Uses Software
Cites Work
- An interval extension based on occurrence grouping
- Bound constrained interval global optimization in the COCONUT environment
- Upper bounding in inner regions for global optimization under inequality constraints
- Interval-based projection method for under-constrained numerical systems
- A reliable affine relaxation method for global optimization
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
- Interval analysis on directed acyclic graphs for global optimization
- Contractor programming
- An efficient and safe framework for solving optimization problems
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- Global optimization using interval analysis - the multi-dimensional case
- An interval branch and bound algorithm for bound constrained optimization problems
- Consistency in networks of relations
- The cluster problem in multivariate global optimization
- Use of interval slopes for the irrational part of factorable functions
- A finite algorithm for global minimization of separable concave programs
- Interval solution of nonlinear equations using linear programming
- KBFS: K-Best-First Search
- Safe bounds in linear and mixed-integer linear programming
- Optimal multisections in interval branch-and-bound methods of global optimization
- Convex envelopes for edge-concave functions
- Horner's rule for interval evaluation revisited
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Symbolic preconditioning with Taylor models: Some examples
- Improving interval analysis bounds by translations
- Finding all solutions of nonlinearly constrained systems of equations
- A branch-and-reduce approach to global optimization
- BARON: A general purpose global optimization software package
- On rigorous upper bounds to a global optimum
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Affine arithmetic: concepts and applications
- New interval methods for constrained global optimization
- A general reliable quadratic form: An extension of affine arithmetic
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Preconditioners for the Interval Gauss–Seidel Method
- Branching and bounds tighteningtechniques for non-convex MINLP
- GlobSol user guide
- ICOS: a branch and bound based solver for rigorous global optimization
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Encyclopedia of Optimization
- Constructive Interval Disjunction
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Bounding the Solution of Interval Linear Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- New methods to color the vertices of a graph
- CONOPT—A Large-Scale GRG Code
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- Anchor-Based Localization via Interval Analysis for MobileAd-HocSensor Networks
- Exclusion Regions for Systems of Equations
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Iterative Solution of Nonlinear Equations in Several Variables
- QFT prefilter design for multivariable systems using interval constraint satisfaction technique
- A Deterministic Global Optimization Algorithm for Design Problems
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Interval Arithmetic in Matrix Computations, Part I
- Backtrack Programming
- The Kantorovich Theorem for Newton's Method
- Deterministic global optimization using interval constraint propagation techniques
- Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
- Recent Advances in Constraints
- Greedy algorithms for optimizing multivariate Horner schemes
- Principles and Practice of Constraint Programming – CP 2004
- Experiments with a new selection criterion in a fast interval optimization algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
