Pedamallu, Chandra SekharÖzdamar, LinetCsendes, Tibor2023-06-162023-06-1620070925-50011573-2916https://doi.org/10.1007/s10898-006-9043-yhttps://hdl.handle.net/20.500.14365/923In bound constrained global optimization problems, partitioning methods utilizing Interval Arithmetic are powerful techniques that produce reliable results. Subdivision direction selection is a major component of partitioning algorithms and it plays an important role in convergence speed. Here, we propose a new subdivision direction selection scheme that uses symbolic computing in interpreting interval arithmetic operations. We call this approach symbolic interval inference approach (SIIA). SIIA targets the reduction of interval bounds of pending boxes directly by identifying the major impact variables and re-partitioning them in the next iteration. This approach speeds up the interval partitioning algorithm (IPA) because it targets the pending status of sibling boxes produced. The proposed SIIA enables multi-section of two major impact variables at a time. The efficiency of SIIA is illustrated on well-known bound constrained test functions and compared with established subdivision direction selection methods from the literature.eninfo:eu-repo/semantics/closedAccessbox-constrained global optimizationinterval branch and bound methodssymbolic computingsubdivision direction selectionGlobal OptimizationBound MethodsArticle10.1007/s10898-006-9043-y2-s2.0-33846106858