Interval branch and bound with local sampling for constrained global optimization

DOI10.1007/S10898-004-6097-6zbMath1093.90088OpenAlexW1964993547MaRDI QIDQ811876

N. E. Zubov

Publication date: 23 January 2006

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

Full work available at URL: https://doi.org/10.1007/s10898-004-6097-6

zbMATH Keywords

Global optimizationConstraintsSamplingInterval branch and bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (6)

Stochastic filter methods for generally constrained global optimization ⋮ Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ Combining interval branch and bound and stochastic search ⋮ Some feasibility sampling procedures in interval methods for constrained global optimization ⋮ A fast memoryless interval-based algorithm for global optimization

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• An algorithm for nonconvex programming problems
• Computation of rational interval functions
• An Algorithm for Separable Nonconvex Programming Problems
• Lipschitz continuity and the termination of interval methods for global optimization

This page was built for publication: Interval branch and bound with local sampling for constrained global optimization