Asymptotic Lower Bounds for Optimal Tracking: a Linear Programming Approach
classification
🧮 math.PR
q-fin.MF
keywords
boundslowerproblemtrackingasymptoticlinearprogrammingtarget
read the original abstract
We consider the problem of tracking a target whose dynamics is modeled by a continuous It\=o semi-martingale. The aim is to minimize both deviation from the target and tracking efforts. We establish the existence of asymptotic lower bounds for this problem, depending on the cost structure. These lower bounds can be related to the time-average control of Brownian motion, which is characterized as a deterministic linear programming problem. A comprehensive list of examples with explicit expressions for the lower bounds is provided.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.