Global convergence of discrete-time inhomogeneous Markov processes from dynamical systems perspective
DOI10.1016/J.JMAA.2016.11.076zbMATH Open1351.93139OpenAlexW2559135677MaRDI QIDQ730239FDOQ730239
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
global optimizationglobal convergenceLyapunov function[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Foia%EF%BF%BD%EF%BF%BD+operator&go=Go Foia�� operator]inhomogeneous Markov process
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Discrete-time control/observation systems (93C55) Lyapunov and storage functions (93D30) Stochastic systems in control theory (general) (93E03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence theorems for a class of simulated annealing algorithms on ℝd
- Real Analysis and Probability
- Markov chains and stochastic stability
- Chaos, fractals, and noise: Stochastic aspects of dynamics.
- Evolution strategies. A comprehensive introduction
- Dynamical systems: Stability theory and applications
- Particle Swarm Optimization
- Optimization of stochastic systems. Topics in discrete-time systems
- Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
- On Accelerated Random Search
- Iterated Random Functions
- Convergence properties of stochastic optimization procedures
- Minimization by Random Search Techniques
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
- Theory of genetic algorithms
- Stochastic global optimization.
- Convergence properties of simulated annealing for continuous global optimization
- ACO algorithms with guaranteed convergence to the optimal solution
- Convergence of the simulated annealing algorithm for continuous global optimization
- Stability of evolutionary algorithms
- Nonautonomous stochastic search in global optimization
- A proof of convergence of general stochastic search for global minimum
- Locally contracting iterated functions and stability of Markov chains
- Convergence of a simulated annealing algorithm for continuous global optimization.
- Random linkage: A family of acceptance/rejection algorithms for global sation
- Nonautonomous stochastic search for global minimum in continuous optimization
- Sufficient conditions for the convergence of non-autonomous stochastic search for a global minimum
- Convergence of simulated annealing using Foster-Lyapunov criteria
- Special issue editorial: Emergent collective behavior: from fish schools to bacterial colonies
Cited In (7)
- 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
- 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)
