[图书][B] Moments, positive polynomials and their applications
JB Lasserre - 2009 - books.google.com
Many important applications in global optimization, algebra, probability and statistics,
applied mathematics, control theory, financial mathematics, inverse problems, etc. can be …
applied mathematics, control theory, financial mathematics, inverse problems, etc. can be …
Nonlinear optimal control via occupation measures and LMI-relaxations
We consider the class of nonlinear optimal control problems (OCPs) with polynomial data,
ie, the differential equation, state and control constraints, and cost are all described by …
ie, the differential equation, state and control constraints, and cost are all described by …
[图书][B] Markov chains and invariant probabilities
O Hernández-Lerma, JB Lasserre - 2012 - books.google.com
This book is about discrete-time, time-homogeneous, Markov chains (Mes) and their ergodic
behavior. To this end, most of the material is in fact about stable Mes, by which we mean …
behavior. To this end, most of the material is in fact about stable Mes, by which we mean …
A semidefinite programming approach to the generalized problem of moments
JB Lasserre - Mathematical Programming, 2008 - Springer
We consider the generalized problem of moments (GPM) from a computational point of view
and provide a hierarchy of semidefinite programming relaxations whose sequence of …
and provide a hierarchy of semidefinite programming relaxations whose sequence of …
Learning in Markov decision processes under constraints
We consider reinforcement learning (RL) in Markov Decision Processes in which an agent
repeatedly interacts with an environment that is modeled by a controlled Markov process. At …
repeatedly interacts with an environment that is modeled by a controlled Markov process. At …
A convex analytic approach to risk-aware Markov decision processes
WB Haskell, R Jain - SIAM Journal on Control and Optimization, 2015 - SIAM
In classical Markov decision process (MDP) theory, we search for a policy that, say,
minimizes the expected infinite horizon discounted cost. Expectation is, of course, a risk …
minimizes the expected infinite horizon discounted cost. Expectation is, of course, a risk …
Dynamic mechanism design with hidden income and hidden actions
M Doepke, RM Townsend - Journal of Economic Theory, 2006 - Elsevier
We develop general recursive methods to solve for optimal contracts in dynamic principal-
agent environments with hidden states and hidden actions. Starting from a general …
agent environments with hidden states and hidden actions. Starting from a general …
From infinite to finite programs: Explicit error bounds with applications to approximate dynamic programming
We consider linear programming (LP) problems in infinite dimensional spaces that are in
general computationally intractable. Under suitable assumptions, we develop an …
general computationally intractable. Under suitable assumptions, we develop an …
Constrained average cost Markov control processes in Borel spaces
O Hernández-Lerma, J González-Hernández… - SIAM Journal on Control …, 2003 - SIAM
This paper considers constrained Markov control processes in Borel spaces, with
unbounded costs. The criterion to be minimized is a long-run expected average cost, and …
unbounded costs. The criterion to be minimized is a long-run expected average cost, and …
Adaptive CSMA for decentralized scheduling of multi-hop networks with end-to-end deadline constraints
Consider a multihop wireless network serving multiple flows in which wireless interference
constraints between links are described by a link-interference graph. The timely-throughput …
constraints between links are described by a link-interference graph. The timely-throughput …