Black Box Optimization for Ergodic Systems in Markov Chains
Mathematics · 09.04.2026 · 14 (8) · 1246
DOI: 10.3390/math14081246 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 09.04.2026. Verfasst von Julio B. Clempner. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
This paper studies a black-box methodology for optimizing ergodic stochastic systems, focusing on the construction of scalar measures that reliably indicate progress toward optimality. Our starting point is a state-value quantity that inherently exhibits oscillatory behavior and does not converge under standard conditions. We show that, despite its fluctuations, this quantity admits a recursive representation derived from a one-step-ahead fixed-local-optimal policy. The approach relies on identifying a Lyapunov-like function whose evolution reflects the long-run behavior of the system without requiring explicit knowledge of its internal dynamics. Such a function provides a monotonic indicator—non-increasing over time—that remains valid for any initial probability distribution. Whenever an optimal trajectory of the Markov chain exists, the proposed method guarantees convergence to it. We also provide a constructive procedure for obtaining the Lyapunov-like function and validate the methodology through theoretical analysis and numerical simulations.
Zitieren
APA
Clempner, J. B. (2026). Black Box Optimization for Ergodic Systems in Markov Chains. Mathematics, 14(8), 1246. https://doi.org/10.3390/math14081246
Vancouver
Clempner JB. Black Box Optimization for Ergodic Systems in Markov Chains. Mathematics. 2026;14(8):1246. doi:10.3390/math14081246
BibTeX
@article{Clempner2026,
author = {Clempner, Julio B.},
title = {Black Box Optimization for Ergodic Systems in Markov Chains},
journal = {Mathematics},
year = {2026},
volume = {14},
number = {8},
pages = {1246},
doi = {10.3390/math14081246}
}
EUVIMED