2002 - IEEE Fellow For contributions to stochastic control, dynamic optimization, and control of large networks.
His main research concerns Markov process, Mathematical optimization, Markov chain, Ergodic theory and Applied mathematics. His research in Markov process intersects with topics in Algorithm, Statistical physics, Lyapunov function and Simulation. His Mathematical optimization research includes elements of Queueing theory and Job shop scheduling.
His Markov chain study incorporates themes from Discrete mathematics, Q-learning and Resolvent. Sean P. Meyn usually deals with Applied mathematics and limits it to topics linked to Stability and Convergence. The various areas that Sean P. Meyn examines in his Markov model study include Range and Mathematical economics.
Sean P. Meyn mostly deals with Mathematical optimization, Markov process, Applied mathematics, Markov chain and Optimal control. His biological study spans a wide range of topics, including Markov decision process and Queueing theory. Sean P. Meyn has included themes like Ergodic theory, Algorithm, Stochastic control and Lyapunov function in his Markov process study.
His research integrates issues of Bounded function, Ergodicity and Combinatorics in his study of Ergodic theory. Sean P. Meyn has researched Applied mathematics in several fields, including Stochastic approximation, Stability, Control theory, Nonlinear system and Markov chain Monte Carlo. Markov chain is closely attributed to Discrete mathematics in his work.
Sean P. Meyn mainly investigates Applied mathematics, Optimal control, Mathematical optimization, Stochastic approximation and Reinforcement learning. His Applied mathematics research is multidisciplinary, incorporating perspectives in Markov process, Duality, Markov chain, Nonlinear system and Function approximation. His Markov process research is multidisciplinary, relying on both Ergodic theory and Stochastic control.
His Function approximation research is multidisciplinary, incorporating elements of Range, Stability and Reproducing kernel Hilbert space. His study in Mathematical optimization is interdisciplinary in nature, drawing from both Quality of service, State space, Decentralised system and Energy storage. His biological study spans a wide range of topics, including Function, Algorithm, Uniform boundedness and Bellman equation.
Sean P. Meyn mainly focuses on Quality of service, Applied mathematics, Reinforcement learning, Mathematical optimization and Stochastic approximation. His Applied mathematics research incorporates elements of Markov process, Function approximation and Nonlinear system. His work in Markov process tackles topics such as Mean squared error which are related to areas like Ergodic theory.
In the field of Reinforcement learning, his study on Q-learning overlaps with subjects such as HVAC. His work on Best response as part of general Mathematical optimization study is frequently linked to Weighting, bridging the gap between disciplines. His Stochastic approximation research is multidisciplinary, relying on both Mathematical economics, Stochastic game, Nash equilibrium, Unobservable and Epsilon-equilibrium.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Markov Chains and Stochastic Stability
Sean Meyn;Richard L. Tweedie.
(1993)
Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
Sean P. Meyn;R. L. Tweedie.
Advances in Applied Probability (1993)
Control Techniques for Complex Networks
Sean Meyn.
(2007)
The O.D. E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
V. S. Borkar;S. P. Meyn.
Siam Journal on Control and Optimization (2000)
Stability of Markovian processes II: continuous-time processes and sampled chains
Sean P. Meyn;R. L. Tweedie.
Advances in Applied Probability (1993)
Stability of queueing networks and scheduling policies
P.R. Kumar;S.P. Meyn.
IEEE Transactions on Automatic Control (1995)
Computable Bounds for Geometric Convergence Rates of Markov Chains
Sean P. Meyn;R. L. Tweedie.
Annals of Applied Probability (1994)
Exponential and Uniform Ergodicity of Markov Processes
D. Down;S. P. Meyn;R. L. Tweedie.
Annals of Probability (1995)
Stability of Markovian processes. I : Criteria for discrete-time chains
Sean P. Meyn;R. L. Tweedie.
Advances in Applied Probability (1992)
Stability and convergence of moments for multiclass queueing networks via fluid limit models
J.G. Dai;S.P. Meyn.
IEEE Transactions on Automatic Control (1995)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Minnesota
University of Florida
University of Illinois at Urbana-Champaign
McGill University
MIT
Indian Institute of Technology Bombay
Texas A&M University
Cornell University
Polytechnic University of Turin
New York University
University of California, Berkeley
Nanjing Normal University
University of Hannover
Iowa State University
University of Wisconsin–Madison
Chinese Academy of Sciences
Chongqing University
University of Georgia
University of Sydney
International Centre of Insect Physiology and Ecology
National Institutes of Health
International Centre for Genetic Engineering and Biotechnology
University of Cincinnati
University of Washington
University of Michigan–Ann Arbor
New York University