23 citations · 25 across the 4 of their papers we have counts for
5 papers
The q-Levenberg-Marquardt method for unconstrained nonlinear optimization
Danijela Protic, Miomir Stankovic
A q-Levenberg-Marquardt method is an iterative procedure that blends a q-steepest descent and q-Gauss-Newton methods. When the current solution is far from the correct one the algo…
Distributed Value Function Approximation for Collaborative Multi-Agent Reinforcement Learning
Milos S. Stankovic, Marko Beko, Srdjan S. Stankovic
In this paper we propose several novel distributed gradient-based temporal difference algorithms for multi-agent off-policy learning of linear approximation of the value function i…
Distributed Time Synchronization for Networks with Random Delays and Measurement Noise
Milos S. Stankovic, Srdjan S. Stankovic, Karl Henrik Johansson
In this paper a new distributed asynchronous algorithm is proposed for time synchronization in networks with random communication delays, measurement noise and communication dropou…
Distributed Stochastic Approximation: Weak Convergence and Network Design
Miloš S. Stanković, Nemanja Ilić, Srdjan S. Stanković
This paper studies distributed stochastic approximation algorithms based on broadcast gossip on communication networks represented by digraphs. Weak convergence of these algorithms…
Lie Bracket Approximation of Extremum Seeking Systems
Hans-Bernd Dürr, Miloš S. Stanković, Christian Ebenbauer +1
Extremum seeking feedback is a powerful method to steer a dynamical system to an extremum of a partially or completely unknown map. It often requires advanced system-theoretic tool…