Convergence of a simulated annealing algorithm for continuous global optimization.
The author considers a simulated annealing algorithm for minimizing a continuous function \(f\) over a convex, compact, full-dimensional set \(X\). It is assumed that \(f\) has only a finite number of global minima over \(X\). The cooling schedule is based on the distance between the function value in the current point and an estimate of the global optimum. Under certain assumptions on the cooling schedule and on the distribution of the next candidate point it is shown that the considered simulated annealing algorithm converges in probability to a global optimum.
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Convergence of the simulated annealing algorithm for continuous global optimization
- scientific article; zbMATH DE number 1857675
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- scientific article; zbMATH DE number 4186782
- On the efficiency of a continuous version of the simulated annealing algorithm
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- Convergence of the simulated annealing algorithm for continuous global optimization
- On the convergence rate issues of general Markov search for global minimum
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Nonautonomous stochastic search for global minimum in continuous optimization
- Mesh generation for FEM based on centroidal Voronoi tessellations
- Stopping and restarting strategy for stochastic sequential search in global optimization
- Improving simulated annealing through derandomization
- A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm
- An analytically derived cooling schedule for simulated annealing
- A combined multistart-annealing algorithm for continuous global optimization
- Adaptive Prediction of Stock Exchange Indices by State Space Wavelet Networks
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- scientific article; zbMATH DE number 1857675 (Why is no real title available?)
- Tail probability estimates of continuous-time simulated annealing processes
- Study of multiscale global optimization based on parameter space partition
- A simulated annealing approach for reliability-based chance-constrained programming
- Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
- Simulated annealing type algorithms for multivariate optimization
- A simulated annealing driven multi-start algorithm for bound constrained global optimization
This page was built for publication: Convergence of a simulated annealing algorithm for continuous global optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928424)
