From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
From MaRDI portal
Publication:1955543
DOI10.1007/s10898-012-9860-0zbMath1273.90177OpenAlexW1980963573MaRDI QIDQ1955543
Marc C. Robini, Pierre-Jean Reissman
Publication date: 14 June 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9860-0
Markov chainscombinatorial optimizationsimulated annealingMonte Carlo methodsgraph drawingstochastic continuation
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity, A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem, Disparity and optical flow partitioning using extended Potts priors, Energy Minimization Methods, Global versus local search: the impact of population sizes on evolutionary algorithm performance, A stochastic approach to full inverse treatment planning for charged-particle therapy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- On simulated annealing with temperature-dependent energy and temperature-dependent communication
- The tunneling method for global optimization in multidimensional scaling
- Nonstationary Markov chains and convergence of the annealing algorithm
- Rough large deviation estimates for simulated annealing: Application to exponential schedules
- Simulated annealing with time-dependent energy function via Sobolev inequalities
- Piecewise constant triangular cooling schedules for generalized simulated annealing algorithms
- Simulated annealing with time-dependent energy function
- Modern multidimensional scaling: theory and applications
- Convergence of the simulated annealing algorithm for continuous global optimization
- On the convergence of generalized hill climbing algorithms
- Analysis of static simulated annealing algorithms
- An algorithm for drawing general undirected graphs
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
- Simulated annealing algorithms for continuous global optimization: Convergence conditions
- Metropolis, simulated annealing, and iterated energy transformation algorithms: Theory and experiments
- Simulated Annealing With An Optimal Fixed Temperature
- Optimization by Stochastic Continuation
- Convergence properties of simulated annealing for continuous global optimization
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Stochastic nonlinear image restoration using the wavelet transform
- Cooling Schedules for Optimal Annealing
- On the Convergence Rate of Annealing Processes
- Simulated annealing process in general state space
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Solving Scheduling Problems by Simulated Annealing
- On the Convergence and Applications of Generalized Simulated Annealing
- Classification of Acceptance Criteria for the Simulated Annealing Algorithm
- A Fast Multi-Scale Method for Drawing Large Graphs
- Simulated annealing, acceleration techniques, and image restoration
- Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- ON THE CONVERGENCE OF METROPOLIS-TYPE RELAXATION AND ANNEALING WITH CONSTRAINTS
- Cycle Decompositions and Simulated Annealing
- Convergence in Probability of Compressed Annealing
- Drawing graphs. Methods and models
- Some results characterizing the finite time behaviour of the simulated annealing algorithm.
- Finite-time performance analysis of static simulated annealing algorithms
