On the convergence of adaptive partition algorithms in global optimization
From MaRDI portal
Recommendations
- Global convergence revisited: Reply to A. Žilinskas
- Convergence qualification of adaptive partition algorithms in global optimization
- A partition-based global optimization algorithm
- Average performance of a class of adaptive algorithms for global optimization
- On convergence of "divide the best" global optimization algorithms
Cites work
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A probabilistic algorithm for global optimization
- A Sequential Method Seeking the Global Maximum of a Function
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Convergence qualification of adaptive partition algorithms in global optimization
- Extended univariate algorithms for n-dimensional global optimization
- Global optimization on convex sets
- Globally convergent methods for n-dimensional multiextremal optimization
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- Set partition by globally optimized cluster seed points
- Two algorithms for one-dimensional multimodai minimization
Cited in
(4)- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Convergence qualification of adaptive partition algorithms in global optimization
- On convergence conditions of partitioned solution procedures for consolidation problems
- Global convergence revisited: Reply to A. Žilinskas
This page was built for publication: On the convergence of adaptive partition algorithms in global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3496164)
