Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
From MaRDI portal
Publication:312490
DOI10.1007/S10898-015-0390-4zbMATH Open1353.90113OpenAlexW2214097909MaRDI QIDQ312490FDOQ312490
Authors: Victor Reyes, I. 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
Recommendations
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
- Interval tools for global optimization
- An interval branch and bound algorithm for bound constrained optimization problems
- scientific article; zbMATH DE number 970348
- New interval methods for constrained global optimization
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)
Cites Work
- BARON: A general purpose global optimization software package
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- ICOS: a branch and bound based solver for rigorous global optimization
- CONOPT—A Large-Scale GRG Code
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Title not available (Why is that?)
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
- Title not available (Why is that?)
- Consistency in networks of relations
- Encyclopedia of Optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Iterative Solution of Nonlinear Equations in Several Variables
- Finding all solutions of nonlinearly constrained systems of equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global optimization using interval analysis - the multi-dimensional case
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Title not available (Why is that?)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- New methods to color the vertices of a graph
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Title not available (Why is that?)
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A branch-and-reduce approach to global optimization
- Title not available (Why is that?)
- Convex envelopes for edge-concave functions
- Improving interval analysis bounds by translations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Deterministic global optimization using interval constraint propagation techniques
- Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
- An efficient and safe framework for solving optimization problems
- An interval branch and bound algorithm for bound constrained optimization problems
- 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
- Horner's rule for interval evaluation revisited
- Symbolic preconditioning with Taylor models: Some examples
- On rigorous upper bounds to a global optimum
- 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
- Interval analysis for certified numerical solution of problems in robotics
- Preconditioners for the Interval Gauss–Seidel Method
- GlobSol user guide
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Constructive Interval Disjunction
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
- Bounding the Solution of Interval Linear Equations
- An interval extension based on occurrence grouping
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anchor-Based Localization via Interval Analysis for MobileAd-HocSensor Networks
- Exclusion Regions for Systems of Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bound constrained interval global optimization in the COCONUT environment
- Title not available (Why is that?)
- 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
- QFT prefilter design for multivariable systems using interval constraint satisfaction technique
- A Deterministic Global Optimization Algorithm for Design Problems
- Extensions of affine arithmetic: application to unconstrained global optimization
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Writing global optimization software
- Interval Arithmetic in Matrix Computations, Part I
- Backtrack Programming
- The Kantorovich Theorem for Newton's Method
- 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
- Interval analysis on directed acyclic graphs for global optimization
- Contractor programming
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
Cited In (18)
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
- Combining interval branch and bound and stochastic search
- A class of problems that can be solved using interval algorithms
- Title not available (Why is that?)
- ICOS: a branch and bound based solver for rigorous global optimization
- Complete search in continuous global optimization and constraint satisfaction
- Interval methods for solving nonlinear constraint satisfaction, optimization and similar problems. From inequalities systems to game solutions
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- An interval branch and bound algorithm for bound constrained optimization problems
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- On solving mixed-integer constraint satisfaction problems with unbounded variables
- Domain reduction techniques for global NLP and MINLP optimization
- (Global) optimization: historical notes and recent developments
- Global optimization based on contractor programming: an overview of the IBEX library
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems
- The Fritz-John Condition System in Interval Branch and Bound method
Uses Software
This page was built for publication: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312490)
