Interval branch and bound with local sampling for constrained global optimization
type: Item
instance of: scholarly article
title: Interval branch and bound with local sampling for constrained global optimization
zbMATH Open document ID: 1093.90088
author: N. E. Zubov
published in: Journal of Global Optimization
publication date: 2006-01-23T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5000080
zbMATH Keywords: Constraints
zbMATH Keywords: Global optimization
zbMATH Keywords: Interval branch and bound
zbMATH Keywords: Sampling
MaRDI profile type: Publication
full work available at URL: s10898-004-6097-6
OpenAlex ID: W1964993547
cites work: Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
cites work: Lipschitz continuity and the termination of interval methods for global optimization
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: An algorithm for nonconvex programming problems
cites work: Q4874513
cites work: Optimization by Simulated Annealing
cites work: Computation of rational interval functions
cites work: A global optimization algorithm using Lagrangian underestimates and the interval Newton method
cites work: A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
DOI: 10.1007/S10898-004-6097-6
description: scientific article; zbMATH DE number 5000080