A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms
From MaRDI portal
Publication:645553
DOI10.1007/s10898-010-9531-yzbMath1228.90084OpenAlexW2066433902MaRDI QIDQ645553
Jordan Ninin, Frédéric Messine
Publication date: 8 November 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9531-y
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A general framework for convexity analysis in deterministic global optimization, The small octagons of maximal width, On rigorous upper bounds to a global optimum, Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces, On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method, An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices, Node selection strategies in interval branch and bound algorithms, Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigorous global search: continuous problems
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Generalized subinterval selection criteria for interval global optimization
- Empirical investigation of the convergence speed of inclusion functions in a global otimization context
- A Deterministic Global Optimization Algorithm for Design Problems
- Deterministic global optimization using interval constraint propagation techniques
- Global Optimization and Constraint Satisfaction
- Experiments with a new selection criterion in a fast interval optimization algorithm
