Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems

DOI10.1007/S10898-006-9034-ZzbMath1211.90242OpenAlexW2026498381MaRDI QIDQ868630

N. E. Zubov

Publication date: 6 March 2007

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

Full work available at URL: https://doi.org/10.1007/s10898-006-9034-z

zbMATH Keywords

optimizationconvergence analysisalgorithm prototypegeneral global search problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Interval branch and bound with local sampling for constrained global optimization
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• Global optimization using interval analysis - the multi-dimensional case
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Interval Methods for Systems of Equations
• An algorithm for nonconvex programming problems
• Branch-and-Bound Methods: A Survey
• New subinterval selection criteria for interval global optimization

This page was built for publication: Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems