Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
From MaRDI portal
Publication:730239
DOI10.1016/j.jmaa.2016.11.076zbMath1351.93139OpenAlexW2559135677MaRDI QIDQ730239
Publication date: 23 December 2016
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2016.11.076
Lyapunov and storage functions (93D30) Discrete-time control/observation systems (93C55) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic systems in control theory (general) (93E03)
Related Items
On geometric convergence rate of Markov search towards the fat target, On the convergence rate issues of general Markov search for global minimum
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonautonomous stochastic search in global optimization
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
- Markov chains and stochastic stability
- Special issue editorial: Emergent collective behavior: from fish schools to bacterial colonies
- Random linkage: A family of acceptance/rejection algorithms for global sation
- Chaos, fractals, and noise: Stochastic aspects of dynamics.
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- Convergence of the simulated annealing algorithm for continuous global optimization
- ACO algorithms with guaranteed convergence to the optimal solution
- Evolution strategies. A comprehensive introduction
- Nonautonomous stochastic search for global minimum in continuous optimization
- Stochastic global optimization.
- Stability of evolutionary algorithms
- Dynamical systems: Stability theory and applications
- Optimization of stochastic systems. Topics in discrete-time systems
- Locally contracting iterated functions and stability of Markov chains
- Convergence properties of simulated annealing for continuous global optimization
- Particle Swarm Optimization
- Convergence properties of stochastic optimization procedures
- Minimization by Random Search Techniques
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Iterated Random Functions
- Convergence of simulated annealing using Foster-Lyapunov criteria
- On Accelerated Random Search
- Real Analysis and Probability
- A proof of convergence of general stochastic search for global minimum
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Theory of genetic algorithms
