Cooling Schedules for Optimal Annealing
From MaRDI portal
Publication:3798159
DOI10.1287/MOOR.13.2.311zbMath0652.65050OpenAlexW2005228957WikidataQ100356754 ScholiaQ100356754MaRDI QIDQ3798159
Publication date: 1988
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/df511a5d9d12bff681438e2dbe2ecef70268c9c9
Numerical mathematical programming methods (65K05) Monte Carlo methods (65C05) Stochastic programming (90C15) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (only showing first 100 items - show all)
Sufficient Conditions for Ergodicity and Convergence of MH, SA, and EM Algorithms ⋮ Hnbue property in a shock model with cumulative damage threshold ⋮ Integrating and accelerating tabu search, simulated annealing, and genetic algorithms ⋮ Multi-way graph partition by stochastic probe ⋮ Particle methods: An introduction with applications ⋮ A Decision-Theoretic Approach to Summarising Posterior Information in a Sample of step Functions ⋮ Actor-Critic–Like Stochastic Adaptive Search for Continuous Simulation Optimization ⋮ Disjunctive Rule Lists ⋮ A theoretical framework for simulated annealing ⋮ The demon algorithm ⋮ Parallel simulated annealing ⋮ Euclidean matching problems and the metropolis algorithm ⋮ Simulated annealing with extended neighbourhood ⋮ A combined multistart-annealing algorithm for continuous global optimization ⋮ Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation ⋮ Analyzing the performance of simultaneous generalized hill climbing algorithms ⋮ Improved bounds for the large-time behaviour of simulated annealing ⋮ Procuring load curtailment from local customers under uncertainty ⋮ Formulating and solving sustainable stochastic dynamic facility layout problem: a key to sustainable operations ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ On the Complexity of Constrained Determinantal Point Processes ⋮ A model and a numerical scheme for the description of distribution and abundance of individuals ⋮ Why adiabatic quantum annealing is unlikely to yield speed-up ⋮ Convergence of the kinetic annealing for general potentials ⋮ Sequential Monte Carlo simulated annealing ⋮ Mathematical aspects of the Digital Annealer's simulated annealing algorithm ⋮ Robust flat waves with a uniform feed using a randomized local search ⋮ Estimation of non-stationary spectra by simulated annealing ⋮ Mixing time and simulated annealing for the stochastic cellular automata ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ A new adaptive mutation simulated annealing algorithm: application to the study of pure and mixed Pt-Pd clusters ⋮ Evolutionary annealing: global optimization in measure spaces ⋮ Limited communication control ⋮ Unnamed Item ⋮ On the classification of NP-complete problems in terms of their correlation coefficient ⋮ A fully distributed learning algorithm for power allocation in heterogeneous networks ⋮ Critical behaviour in charging of electric vehicles ⋮ Unnamed Item ⋮ ADAPTIVE AND MONOTONE SPLINE ESTIMATION OF THE CROSS-SECTIONAL TERM STRUCTURE ⋮ Optimal parameters for search using a barrier tree Markov model ⋮ Simulated annealing algorithms for continuous global optimization: Convergence conditions ⋮ Lévy flights, non-local search and simulated annealing ⋮ Graph Coloring Models and Metaheuristics for Packing Applications ⋮ An analytically derived cooling schedule for simulated annealing ⋮ Optimization of transit route network, vehicle headways and timetables for large-scale transit networks ⋮ Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing ⋮ A simulated annealing algorithm for system cost minimization subject to reliability constraints ⋮ An improved simulated annealing algorithm for bandwidth minimization ⋮ A complete restricted Boltzmann machine on an adiabatic quantum computer ⋮ Robust estimators and designs for field experiments ⋮ Improving inductive logic programming by using simulated annealing ⋮ A note on the depth function of combinatorial optimization problems ⋮ An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem ⋮ Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach ⋮ Convergence in distribution of some self-interacting diffusions ⋮ An effective hybrid optimization strategy for job-shop scheduling problems ⋮ An Approximate Bayesian Marginal Likelihood Approach for Estimating Finite Mixtures ⋮ Sufficient and necessary condition for the convergence of stochastic approximation algorithms ⋮ Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures ⋮ Theory of genetic algorithms ⋮ Stopping and restarting strategy for stochastic sequential search in global optimization ⋮ Convergence of a random algorithm for function optimization ⋮ A critical-shaking neighborhood search for the yard allocation problem ⋮ Adaptive memory programming: a unified view of metaheuristics ⋮ Fast parallel heuristics for the job shop scheduling problem ⋮ A stopping criterion for logarithmic simulated annealing ⋮ Some results characterizing the finite time behaviour of the simulated annealing algorithm. ⋮ Faster Monte Carlo simulations at low temperatures. The waiting time method ⋮ Metastability in stochastic replicator dynamics ⋮ Facility location with tree topology and radial distance constraints ⋮ An alternative approach for neural network evolution with a genetic algorithm: crossover by combinatorial optimization ⋮ Convergence rate of a simulated annealing algorithm with noisy observations ⋮ Optimization by linear kinetic equations and mean-field Langevin dynamics ⋮ Re-use of samples in stochastic annealing ⋮ Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem ⋮ Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time ⋮ An improved Hopfield Lagrange network with application on motor efficiency optimization ⋮ A new method for low density distribution modeling and near threatened species: the study case of \textit{Plectrohyla guatemalensis} ⋮ An embedded diachronic sense change model with a case study from ancient Greek ⋮ Selective inference for latent block models ⋮ State space emulation and annealed sequential Monte Carlo for high dimensional optimization ⋮ Simulation optimization: a review of algorithms and applications ⋮ How to Calculate the Barycenter of a Weighted Graph ⋮ Adaptive Prediction of Stock Exchange Indices by State Space Wavelet Networks ⋮ Reconstruction of jointly sparse vectors via manifold optimization ⋮ Finite-Time Behavior of Slowly Cooled Annealing Chains ⋮ Convergence of Simulated Annealing with Feedback Temperature Schedules ⋮ Extended Pincus theorems and convergence of simulated annealing ⋮ Stability of energy landscape for Ising models ⋮ A new genetic algorithm ⋮ Simulated annealing and object point processes: Tools for analysis of spatial patterns ⋮ Parallel MCMC methods for global optimization ⋮ Minimization of $\ell_{1-2}$ for Compressed Sensing ⋮ Near-optimal solutions of convex semi-infinite programs via targeted sampling ⋮ A two-stage simulated annealing procedure for block layout problems ⋮ Waiting times in evolutionary dynamics with time-decreasing noise ⋮ An information guided framework for simulated annealing ⋮ Global optimization with exploration/selection algorithms and simulated annealing ⋮ Probabilistic exchange algorithms and Euclidean traveling salesman problems ⋮ Adaptive predictions of the Euro/Złoty currency exchange rate using state space wavelet networks and forecast combinations
This page was built for publication: Cooling Schedules for Optimal Annealing
