The homing problem for autoregressive processes
- 25 January 2022
- journal article
- research article
- Published by Oxford University Press (OUP) in IMA Journal of Mathematical Control and Information
- Vol. 39 (1) , 322-344
Abstract
The problem of maximizing or minimizing the time spent by a stochastic process in an interval is considered for autoregressive processes. The control applied to the system is equal to 0, $b$ or $-b$. Particular cases are considered, and the appropriate integral equations are solved explicitly, either exactly or approximately.
Keywords
Funding Information
- Natural Sciences and Engineering Research Council of Canada
This publication has 16 references indexed in Scilit:
- Optimal Consumption and Portfolio Selection with Early Retirement OptionMathematics of Operations Research, 2018
- Optimally ending an epidemicOptimization, 2017
- Time Series Analysis: A Hydrological ProspectiveAmerican Journal of Scientific Research and Essays, 2017
- Continuous-Time Mean-Variance Portfolio Selection with Random HorizonApplied Mathematics & Optimization, 2013
- Explicit solution for a vector-valued LQG homing problemOptimization Letters, 2011
- Non-constant discounting and differential games with random time horizonAutomatica, 2011
- Optimum block replacement policy over a random time horizonJournal of Intelligent Manufacturing, 2009
- Risk-sensitive control for a class of homing problemsAutomatica, 2009
- Optimum replacement intervals with random time horizonJournal of Quality in Maintenance Engineering, 2000
- The risk-sensitive homing problemJournal of Applied Probability, 1985