An interval branch and bound algorithm for bound constrained optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970348
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- scientific article; zbMATH DE number 970354
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
Cited in
(21)- Combining interval branch and bound and stochastic search
- Geometric branch-and-bound methods for constrained global optimization problems
- scientific article; zbMATH DE number 1975073 (Why is no real title available?)
- Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques
- Interval methods for global optimization
- scientific article; zbMATH DE number 3974726 (Why is no real title available?)
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
- Node selection strategies in interval branch and bound algorithms
- Constructing large feasible suboptimal intervals for constrained nonlinear optimization
- Mathematically rigorous global optimization in floating-point arithmetic
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Bound constrained interval global optimization in the COCONUT environment
- Nonlinear nonconvex optimization by evolutionary algorithms applied to robust control
- Derivation of physically motivated constraints for efficient interval simulations applied to the analysis of uncertain dynamical systems
- On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
- First order rejection tests for multiple-objective optimization
- A revised bound improvement sequence algorithm
- scientific article; zbMATH DE number 6183018 (Why is no real title available?)
- Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
- The Fritz-John Condition System in Interval Branch and Bound method
This page was built for publication: An interval branch and bound algorithm for bound constrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200632)
