Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
type: Item
instance of: scholarly article
title: Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
zbMATH Open document ID: 1351.93139
author: Dawid Tarłowski
published in: Journal of Mathematical Analysis and Applications
publication date: 2016-12-23T00:00:00Z
Mathematics Subject Classification ID: 93E03
Mathematics Subject Classification ID: 93C55
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 93D30
Mathematics Subject Classification ID: 93E25
zbMATH DE Number: 6668569
zbMATH Keywords: global optimization
zbMATH Keywords: global convergence
zbMATH Keywords: inhomogeneous Markov process
zbMATH Keywords: Foiaş operator
zbMATH Keywords: Lyapunov function
MaRDI profile type: Publication
full work available at URL: j.jmaa.2016.11.076
OpenAlex ID: W2559135677
cites work: Convergence of simulated annealing using Foster-Lyapunov criteria
cites work: Optimization of stochastic systems. Topics in discrete-time systems
cites work: On Accelerated Random Search
cites work: Convergence theorems for a class of simulated annealing algorithms on ℝd
cites work: Evolution strategies. A comprehensive introduction
cites work: Dynamical systems: Stability theory and applications
cites work: Q5560061
cites work: Q3841898
cites work: Particle Swarm Optimization
cites work: Iterated Random Functions
cites work: Real Analysis and Probability
cites work: ACO algorithms with guaranteed convergence to the optimal solution
cites work: Locally contracting iterated functions and stability of Markov chains
cites work: Special issue editorial: Emergent collective behavior: from fish schools to bacterial colonies
cites work: Q3091758
cites work: Chaos, fractals, and noise: Stochastic aspects of dynamics.
cites work: Convergence of a simulated annealing algorithm for continuous global optimization.
cites work: Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
cites work: Q4788634
cites work: Convergence properties of simulated annealing for continuous global optimization
cites work: Random linkage: A family of acceptance/rejection algorithms for global sation
cites work: Markov chains and stochastic stability
cites work: A proof of convergence of general stochastic search for global minimum
cites work: Stability of evolutionary algorithms
cites work: Nonautonomous stochastic search in global optimization
cites work: Q5630375
cites work: Convergence properties of stochastic optimization procedures
cites work: Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
cites work: Theory of genetic algorithms
cites work: Minimization by Random Search Techniques
cites work: Sufficient conditions for the convergence of non-autonomous stochastic search for a global minimum
cites work: Nonautonomous stochastic search for global minimum in continuous optimization
cites work: Convergence of the simulated annealing algorithm for continuous global optimization
cites work: Q4000303
cites work: Stochastic global optimization.
DOI: 10.1016/J.JMAA.2016.11.076
description: scientific article; zbMATH DE number 6668569