Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
From MaRDI portal
(Redirected from Publication:730239)
Recommendations
- On the Convergence and Applications of Generalized Simulated Annealing
- Convergence of a random algorithm for function optimization
- Convergence of Markovian stochastic approximation with discontinuous dynamics
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Quantitative bounds on convergence of time-inhomogeneous Markov chains
Cites work
- scientific article; zbMATH DE number 1193442 (Why is no real title available?)
- scientific article; zbMATH DE number 50672 (Why is no real title available?)
- scientific article; zbMATH DE number 1857675 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3355976 (Why is no real title available?)
- A proof of convergence of general stochastic search for global minimum
- ACO algorithms with guaranteed convergence to the optimal solution
- Chaos, fractals, and noise: Stochastic aspects of dynamics.
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Convergence of simulated annealing using Foster-Lyapunov criteria
- Convergence of the simulated annealing algorithm for continuous global optimization
- Convergence properties of simulated annealing for continuous global optimization
- Convergence properties of stochastic optimization procedures
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Dynamical systems: Stability theory and applications
- Evolution strategies. A comprehensive introduction
- Iterated Random Functions
- Locally contracting iterated functions and stability of Markov chains
- Markov chains and stochastic stability
- Minimization by Random Search Techniques
- Nonautonomous dynamical systems
- Nonautonomous stochastic search for global minimum in continuous optimization
- Nonautonomous stochastic search in global optimization
- On Accelerated Random Search
- Optimization of stochastic systems. Topics in discrete-time systems
- Particle Swarm Optimization
- Random linkage: A family of acceptance/rejection algorithms for global sation
- Real Analysis and Probability
- Special issue editorial: Emergent collective behavior: from fish schools to bacterial colonies
- Stability of evolutionary algorithms
- Stochastic global optimization.
- Sufficient conditions for the convergence of non-autonomous stochastic search for a global minimum
- Theory of genetic algorithms
Cited in
(8)- Markovian perturbations of discrete iterations: Lyapunov functions, global minimization, and associative memory
- Global convergence of the stochastic tâtonnement process
- Convergence of a random algorithm for function optimization
- On the convergence rate issues of general Markov search for global minimum
- On asymptotic convergence rate of random search
- Convergence rates for inhomogeneous Markov chains from stochastic approximation algorithms
- On geometric convergence rate of Markov search towards the fat target
- On the convergence of global rational approximants for stochastic discrete event systems
This page was built for publication: Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730239)
