Efficient use of optimality conditions in Interval Branch and Bound methods
Open Access
- 9 May 2025
- journal article
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 13
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- An interval branch and bound method for global Robust optimizationJournal of Global Optimization, 2021
- Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospectsJournal of Global Optimization, 2015
- INTLAB implementation of an interval global optimization algorithmOptimization Methods and Software, 2009
- New interval methods for constrained global optimizationMathematical Programming, 2005
- On the Relation between Constant Positive Linear Dependence Condition and Quasinormality Constraint QualificationJournal of Optimization Theory and Applications, 2005
- Nonlinear equations and optimizationComputers & Mathematics with Applications, 1993
- Bounds for lagrange multipliers and optimal pointsComputers & Mathematics with Applications, 1993
- An interval branch and bound algorithm for bound constrained optimization problemsJournal of Global Optimization, 1992
- Preconditioners for the Interval Gauss–Seidel MethodSIAM Journal on Numerical Analysis, 1990
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraintsJournal of Mathematical Analysis and Applications, 1967