Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
From MaRDI portal
(Redirected from Publication:312490)
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
Cites work
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 1303061 (Why is no real title available?)
- scientific article; zbMATH DE number 488523 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 2086595 (Why is no real title available?)
- scientific article; zbMATH DE number 2086979 (Why is no real title available?)
- scientific article; zbMATH DE number 3447978 (Why is no real title available?)
- scientific article; zbMATH DE number 1916891 (Why is no real title available?)
- scientific article; zbMATH DE number 815479 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- A Deterministic Global Optimization Algorithm for Design Problems
- A branch-and-reduce approach to global optimization
- A finite algorithm for global minimization of separable concave programs
- A general reliable quadratic form: An extension of affine arithmetic
- A new framework for sharp and efficient resolution of NCSP with manifolds of solutions
- A reliable affine relaxation method for global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Affine arithmetic: concepts and applications
- Algorithm 681: INTBIS, a portable interval Newton/bisection package
- An efficient and safe framework for solving optimization problems
- An interval branch and bound algorithm for bound constrained optimization problems
- An interval extension based on occurrence grouping
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Anchor-Based Localization via Interval Analysis for MobileAd-HocSensor Networks
- BARON: A general purpose global optimization software package
- Backtrack Programming
- Bound constrained interval global optimization in the COCONUT environment
- Bounding the Solution of Interval Linear Equations
- Branching and bounds tighteningtechniques for non-convex MINLP
- CONOPT—A Large-Scale GRG Code
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
- Consistency in networks of relations
- Constructive Interval Disjunction
- Contractor programming
- Convex envelopes for edge-concave functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Deterministic global optimization using interval constraint propagation techniques
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Encyclopedia of Optimization
- Exclusion Regions for Systems of Equations
- Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
- Experiments with a new selection criterion in a fast interval optimization algorithm
- Extensions of affine arithmetic: application to unconstrained global optimization
- Finding all solutions of nonlinearly constrained systems of equations
- GlobSol user guide
- Global optimization using interval analysis - the multi-dimensional case
- Greedy algorithms for optimizing multivariate Horner schemes
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Horner's rule for interval evaluation revisited
- ICOS: a branch and bound based solver for rigorous global optimization
- Improving interval analysis bounds by translations
- Interval Arithmetic in Matrix Computations, Part I
- Interval analysis for certified numerical solution of problems in robotics
- Interval analysis on directed acyclic graphs for global optimization
- Interval solution of nonlinear equations using linear programming
- Interval-based projection method for under-constrained numerical systems
- Iterative Solution of Nonlinear Equations in Several Variables
- KBFS: K-Best-First Search
- New interval methods for constrained global optimization
- New methods to color the vertices of a graph
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- On rigorous upper bounds to a global optimum
- Optimal multisections in interval branch-and-bound methods of global optimization
- Preconditioners for the Interval Gauss–Seidel Method
- Principles and Practice of Constraint Programming – CP 2004
- QFT prefilter design for multivariable systems using interval constraint satisfaction technique
- Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
- Recent Advances in Constraints
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Safe bounds in linear and mixed-integer linear programming
- Subdivision Direction Selection in Interval Methods for Global Optimization
- Symbolic preconditioning with Taylor models: Some examples
- The Kantorovich Theorem for Newton's Method
- The cluster problem in multivariate global optimization
- Upper bounding in inner regions for global optimization under inequality constraints
- Use of interval slopes for the irrational part of factorable functions
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Writing global optimization software
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
- scientific article; zbMATH DE number 1406243 (Why is no real title available?)
- ICOS: a branch and bound based solver for rigorous global optimization
- Complete search in continuous global optimization and constraint satisfaction
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Interval methods for solving nonlinear constraint satisfaction, optimization and similar problems. From inequalities systems to game solutions
- 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
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems
- Global optimization based on contractor programming: an overview of the IBEX library
- The Fritz-John Condition System in Interval Branch and Bound method
Describes a project that uses
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)
