Pathwise Optimization for Optimal Stopping Problems

References

• Andersen L, Broadie M. Primal-dual simulation algorithm for pricing multidimensional American options. Management Sci. (2004) 50(9):1222–1234Link, Google Scholar
• Belomestny D, Bender C, Schoenmakers J. True upper bounds for Bermudan products via non-nested Monte Carlo. Math. Finance (2009) 19(1):53–71Crossref, Google Scholar
• Bertsekas DP. Dynamic Programming and Optimal Control (2007) 23rd ed.(Athena Scientific, Belmont, MA) Google Scholar
• Borkar VS, Pinto J, Prabhu T. A new learning algorithm for optimal stopping. Discrete Event Dynamic Systems (2009) 19(1):91–113Crossref, Google Scholar
• Boyd S, Vandenberghe L. Convex Optimization (2004) (Cambridge University Press, Cambridge, UK) Crossref, Google Scholar
• Broadie M, Cao M. Improved lower and upper bound algorithms for pricing American options by simulation. Quant. Finance (2008) 8(8):845–861Crossref, Google Scholar
• Brown DB, Smith JE. Dynamic portfolio optimization with transaction costs: Heuristics and dual bounds. Management Sci. (2011) 57(10):1752–1770Link, Google Scholar
• Brown DB, Smith JE, Sun P. Information relaxations and duality in stochastic dynamic programs. Oper. Res. (2010) 58(4):785–801Link, Google Scholar
• Carriere JF. Valuation of the early-exercise price for derivative securities using simulations and splines. Insurance: Math. Econom. (1996) 19(1):19–30Crossref, Google Scholar
• Chen N, Glasserman P. Additive and multiplicative duals for American option pricing. Finance Stochastics (2007) 11(2):153–179Crossref, Google Scholar
• Clément E, Lamberton D, Protter P. An analysis of a least squares regression method for American option pricing. Finance Stochastics (2002) 6(4):449–471Crossref, Google Scholar
• Davis M, Karatzas I, Kelly FP. A deterministic approach to optimal stopping. Probability, Statistics, and Optimization: A Tribute to Peter Whittle (1994) (John Wiley & Sons, New York) 455–466Google Scholar
• de Farias DP, Van Roy B. The linear programming approach to approximate dynamic programming. Oper. Res. (2003) 51(6):850–865Link, Google Scholar
• de Farias DP, Van Roy B. On constraint sampling in the linear programming approach to approximate dynamic programming. Math. Oper. Res. (2004) 293(3):462–478Link, Google Scholar
• Desai VV, Farias VF, Moallemi CC. Approximate dynamic programming via a smoothed linear program. Oper. Res. (2012) 60(3):655–674Link, Google Scholar
• Fill JA. Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. (1991) 1(1):62–87Crossref, Google Scholar
• Glasserman P. Monte Carlo Methods in Financial Engineering (2004) (Springer-Verlag, New York) Crossref, Google Scholar
• Glasserman P, Yu B, Niederreiter H. Simulation for American options: Regression now or regression later? Monte Carlo and Quasi-Monte Carlo Methods (2002) (Springer-Verlag, New York) 213–226Google Scholar
• Haugh MB, Kogan L. Pricing American options: A duality approach. Oper. Res. (2004) 52(2):258–270Link, Google Scholar
• Jamshidian F. Minimax optimality of Bermudan and American claims and their Monte-Carlo upper bound approximation. (2003) . Technical report, NIB Capitial, The Hague, The NetherlandsGoogle Scholar
• Lai G, Margot F, Secomandi N. An approximate dynamic programming approach to benchmark practice-based heuristics for natural gas storage valuation. Oper. Res. (2010) 58(3):564–582Link, Google Scholar
• Longstaff FA, Schwartz ES. Valuing American options by simulation: A simple least-sqaures approach. Rev. Financial Stud. (2001) 14(1):113–147Crossref, Google Scholar
• Manne AS. Linear programming and sequential decisions. Management Sci. (1960) 60(3):259–267Link, Google Scholar
• Montenegro R, Tetali P. Mathematical Aspects of Mixing Times in Markov Chains (2006) (NOW Publishers, Boston) Google Scholar
• Rogers LCG. Monte Carlo valuation of American options. Math. Finance (2002) 12(3):271–286Crossref, Google Scholar
• Rogers LCG. Pathwise stochastic optimal control. SIAM J. Control Optim. (2008) 46(3):1116–1132Crossref, Google Scholar
• Rogers LCG. Dual valuation and hedging of Bermudan options. SIAM J. Financial Math. (2010) 1(1):604–608Crossref, Google Scholar
• Schweitzer P, Seidmann A. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. (1985) 110(2):568–582Crossref, Google Scholar
• Shapiro A, Dentcheva D, Ruszczyński A. Lectures on Stochastic Programming: Modeling and Theory (2009) (SIAM, Philadelphia) Crossref, Google Scholar
• Tsitsiklis JN, Van Roy B. Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives. IEEE Trans. Automatic Control (1999) 44(10):1840–1851Crossref, Google Scholar
• Tsitsiklis JN, Van Roy B. Regression methods for pricing complex American-style options. IEEE Trans. Neural Networks (2001) 12(4):694–703Crossref, Google Scholar
• Van Roy B. On regression-based stopping times. Discrete Event Dynamic Systems (2010) 20(3):307–324Crossref, Google Scholar
• Yu H, Bertsekas DP. A least squares Q-learning algorithm for optimal stopping problems. (2007) . Technical Report 2731, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, CambridgeGoogle Scholar