Pages that link to "Item:Q4695422"
From MaRDI portal
The following pages link to Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $ (Q4695422):
Displaying 15 items.
- On the geometrical convergence of Gibbs sampler in \(\mathbb R^d\) (Q1268005) (← links)
- A strong approximation theorem for stochastic recursive algorithms (Q1289391) (← links)
- Weak convergence rates for stochastic approximation with application to multiple targets and simulated annealing (Q1296615) (← links)
- Convergence of the simulated annealing algorithm for continuous global optimization (Q1573995) (← links)
- Global convergence of the stochastic tâtonnement process (Q1587386) (← links)
- Simulated annealing with a potential function with discontinuous gradient on \(\mathbb R^d\) (Q1609667) (← links)
- An adaptive simulated annealing algorithm. (Q1888770) (← links)
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization (Q1955543) (← links)
- Simulated annealing algorithms for continuous global optimization: Convergence conditions (Q1973485) (← links)
- Stochastic gradient Hamiltonian Monte Carlo for non-convex learning (Q2137760) (← links)
- Improving simulated annealing through derandomization (Q2397439) (← links)
- Lévy flights, non-local search and simulated annealing (Q2458594) (← links)
- (Q3983465) (← links)
- Some Limit Properties of Markov Chains Induced by Recursive Stochastic Algorithms (Q5037552) (← links)
- Unadjusted Langevin algorithm with multiplicative noise: total variation and Wasserstein bounds (Q6103981) (← links)
