An interval branch and bound algorithm for bound constrained optimization problems

DOI10.1007/BF00171829zbMath0760.90085OpenAlexW2125642377MaRDI QIDQ1200632

Ralph Baker Kearfott

Publication date: 16 January 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00171829

zbMATH Keywords

branch-and-bound algorithminterval Newton methodreduced gradientsnonlinear algebraic systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Constructing large feasible suboptimal intervals for constrained nonlinear optimization ⋮ Derivation of Physically Motivated Constraints for Efficient Interval Simulations Applied to the Analysis of Uncertain Dynamical Systems ⋮ Interval methods for global optimization ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ First order rejection tests for multiple-objective optimization ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ Nonlinear nonconvex optimization by evolutionary algorithms applied to robust control ⋮ Automatic loop shaping in QFT using hybrid optimization and constraint propagation techniques