Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems
From MaRDI portal
Publication:868630
DOI10.1007/S10898-006-9034-ZzbMATH Open1211.90242OpenAlexW2026498381MaRDI QIDQ868630FDOQ868630
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
Cites Work
- Title not available (Why is that?)
- Optimization by Simulated Annealing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- Global optimization using interval analysis - the multi-dimensional case
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch-and-Bound Methods: A Survey
- Title not available (Why is that?)
- An algorithm for nonconvex programming problems
- New subinterval selection criteria for interval global optimization
- Interval branch and bound with local sampling for constrained global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general CDC formulation for specializing the cell exclusion algorithms of finding all zeros of vector functions
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 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
