Interval branch and bound with local sampling for constrained global optimization

DOI10.1007/S10898-004-6097-6MaRDI QIDQ811876zbMATH OpenOpenAlexFDO

Authors 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 optimizationSamplingConstraintsInterval branch and bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 818540
• A fast memoryless interval-based algorithm for global optimization
• New interval methods for constrained global optimization
• Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
• Interval tools for global optimization

Cites work

• scientific article; zbMATH DE number 869737 (Why is no real title available?)
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• A global optimization algorithm using Lagrangian underestimates and the interval Newton method
• An Algorithm for Separable Nonconvex Programming Problems
• An algorithm for nonconvex programming problems
• Computation of rational interval functions
• Lipschitz continuity and the termination of interval methods for global optimization
• Optimization by simulated annealing
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.

Cited in

(8)

• Combining interval branch and bound and stochastic search
• On an efficient use of gradient information for accelerating interval global optimization algorithms
• A fast memoryless interval-based algorithm for global optimization
• Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
• Stochastic filter methods for generally constrained global optimization
• Geometric branch-and-bound methods for constrained global optimization problems
• Some feasibility sampling procedures in interval methods for constrained global optimization
• Bound constrained interval global optimization in the COCONUT environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q811876)