A METHOD FOR PRICING AMERICAN OPTIONS USING SEMI‐INFINITE LINEAR PROGRAMMING
DOI10.1111/j.1467-9965.2012.00523.xzbMath1294.91170arXiv1103.4483OpenAlexW2116277703MaRDI QIDQ5411398
Publication date: 23 April 2014
Published in: Mathematical Finance (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.4483
upper boundsoptimal stoppingAmerican optionsharmonic functionssemi-infinite linear programmingexcessive functions
Numerical methods (including Monte Carlo methods) (91G60) Linear programming (90C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Semi-infinite programming (90C34) Stopping times; optimal stopping problems; gambling theory (60G40) Derivative securities (option pricing, hedging, etc.) (91G20)
Related Items
Cites Work
- Unnamed Item
- Existence and explicit determination of optimal stopping times
- Convexity of the optimal stopping boundary for the American put option
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- On the optimal stopping problem for one-dimensional diffusions.
- Bounds for the American perpetual put on a stock index
- COMPARISON OF NUMERICAL AND ANALYTICAL APPROXIMATIONS OF THE EARLY EXERCISE BOUNDARY OF AMERICAN PUT OPTIONS
- A harmonic function technique for the optimal stopping of diffusions
- Semi-Infinite Programming: Theory, Methods, and Applications
- Optimal stopping of Hunt and Lévy processes
- Construction of the Value Function and Optimal Rules in Optimal Stopping of One-Dimensional Diffusions
- Pricing American Options: A Duality Approach
- Optimal Stopping of One-Dimensional Diffusions
- User’s guide to viscosity solutions of second order partial differential equations
- Linear Programming Formulation for Optimal Stopping Problems
- Monte Carlo valuation of American options
- A Forward Algorithm for Solving Optimal Stopping Problems
This page was built for publication: A METHOD FOR PRICING AMERICAN OPTIONS USING SEMI‐INFINITE LINEAR PROGRAMMING