Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
Infinite horizon optimization (IHO) problems present a number of challenges for their solution, most notably, the inclusion of an infinite data set. This hurdle is often circumvented by approximating its solution by solving increasingly longer finite horizon truncations of the original infinite horizon problem. In this paper, we adopt a novel transformation that reduces the infinite dimensional IHO problem into an equivalent one dimensional optimization problem, i.e., minimizing a Hölder continuous objective function with known parameters over a closed and bounded interval of the real line. We exploit the characteristics of the transformed problem in one dimension and introduce an algorithm with a graphical implementation for solving the underlying infinite dimensional optimization problem.
KeywordsInfinite horizon optimization Dynamic programming Nonlinear programming Hölder and Lipschitz continuous functions
- 5.Ghate, A.: Infinite horizon problems. In: Cochran, J.J., Cox Jr., L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York (2011)Google Scholar
- 7.Hansen, P., Jaumard, B., Lu, S.H.: Global optimization of univariate lipschitz functions: I. Survey and properties, and II. New algorithms and computational comparison. Math Program 55(1), 251–272, 273–292 (1992)Google Scholar
- 10.Kiatsupaibul, S.: Markov Chain Monte Carlo Methods for Global Optimization. Ph.D. thesis, University of Michigan (2000)Google Scholar
- 16.Sharky, T.C.: Infinite linear programs. In: Cochran, J.J., Cox Jr., L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, New York (2011)Google Scholar