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

DOI10.1007/S10898-006-9034-ZMaRDI QIDQ868630zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On convergence of "divide the best" global optimization algorithms
• Range division and contraction algorithm for a class of global optimization problems
• The convergence speed of interval methods for global optimization
• scientific article; zbMATH DE number 562738
• Publication:4490820

Cites work

• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 54095 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 869737 (Why is no real title available?)
• scientific article; zbMATH DE number 3238721 (Why is no real title available?)
• scientific article; zbMATH DE number 3313523 (Why is no real title available?)
• A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
• An algorithm for nonconvex programming problems
• Branch-and-Bound Methods: A Survey
• Global optimization using interval analysis - the multi-dimensional case
• Interval Methods for Systems of Equations
• Interval branch and bound with local sampling for constrained global optimization
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• New subinterval selection criteria for interval global optimization
• Optimization by simulated annealing

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

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