English
Related papers

Related papers: An analytic recursive method for optimal multiple …

200 papers

The pricing of options in exponential Levy models amounts to the computation of expectations of functionals of Levy processes. In many situations, Monte-Carlo methods are used. However, the simulation of a Levy process with infinite Levy…

Computational Finance · Quantitative Finance 2014-02-07 El Hadj Aly Dia

Consider a regenerative storage process with a nondecreasing L\'evy input (subordinator) such that every cycle may be split into two periods. In the first (off) the output is shut off and the workload accumulates. This continues until some…

Probability · Mathematics 2020-03-31 Royi Jacobovic , Offer Kella

We present a method to solve optimal stopping problems in infinite horizon for a L\'evy process when the reward function can be non-monotone. To solve the problem we introduce two new objects. Firstly, we define a random variable $\eta(x)$…

Probability · Mathematics 2015-10-06 Elena Boguslavskaya

We study two-armed Levy bandits in continuous-time, which have one safe arm that yields a constant payoff s, and one risky arm that can be either of type High or Low; both types yield stochastic payoffs generated by a Levy process. The…

Probability · Mathematics 2009-06-05 Asaf Cohen , Eilon Solan

We establish a recursive representation that fully decouples jumps from a large class of multivariate inhomogeneous stochastic differential equations with jumps of general time-state dependent unbounded intensity, not of L\'evy-driven type…

Probability · Mathematics 2024-09-04 Qinjing Qiu , Reiichiro Kawai

This article treats long term average impulse control problems with running costs in the case that the underlying process is a L\'evy process. Under quite general conditions we characterize the value of the control problem as the value of a…

Probability · Mathematics 2020-05-15 Sören Christensen , Tobias Sohr

We construct an efficient numerical scheme for solving obstacle problems in divergence form. The numerical method is based on a reformulation of the obstacle in terms of an L1-like penalty on the variational problem. The reformulation is an…

Numerical Analysis · Mathematics 2014-04-08 Giang Tran , Hayden Schaeffer , William M. Feldman , Stanley J. Osher

We study a Monte Carlo algorithm for simulation of probability distributions based on stochastic step functions, and compare to the traditional Metropolis/Hastings method. Unlike the latter, the step function algorithm can produce an…

Probability · Mathematics 2015-12-07 Torquil Macdonald Sørensen , Fred Espen Benth

We consider a class of two-sided singular control problems. A controller either increases or decreases a given spectrally negative Levy process so as to minimize the total costs comprising of the running and control costs where the latter…

Optimization and Control · Mathematics 2015-02-06 Erik J. Baurdoux , Kazutoshi Yamazaki

Several methods have been proposed in the literature to solve reliability-based optimization problems, where failure probabilities are design constraints. However, few methods address the problem of life-cycle cost or risk optimization,…

Computation · Statistics 2020-07-09 H. M. Kroetz , M. Moustapha , A. T. Beck , B. Sudret

This paper concerns an optimal impulse control problem associated with a refracted L\'{e}vy process, involving the reduction of reserves to a predetermined level whenever they exceed a specified threshold. The ruin time is determined by…

Optimization and Control · Mathematics 2026-01-29 Zhongqin Gao , Yan Lv , Jingmin He

One-step generative modeling has emerged as a leading approach to amortize the inference cost of diffusion and flow-matching models. Among distillation-free methods, MeanFlow training is notoriously unstable, with non-decreasing loss and…

Machine Learning · Computer Science 2026-05-12 Juanwu Lu , Ziran Wang

We provide, in a general setting, explicit solutions for optimal stopping problems that involve diffusion process and its running maximum. Our approach is to use the excursion theory for Levy processes. Since general diffusions are, in…

Optimization and Control · Mathematics 2016-09-13 Masahiko Egami , Tadao Oryu

We propose a recursive algorithm for the numerical computation of the optimal value function $\inf_{t\le\tau\le T} E \Big[\sup_{0\le s\le T } Y_s / Y_{\tau} \big| {\cal F}_t\Big]$ over the stopping times $\tau$ with respect to the…

Probability · Mathematics 2017-02-09 Yue Liu , Nicolas Privault

This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of…

Probability · Mathematics 2013-05-28 Adrien Brandejsky , Benoîte de Saporta , François Dufour

In this paper, we study a version of the perpetual American call/put option where exercise opportunities arrive only periodically. Focusing on the exponential L\'evy models with i.i.d. exponentially-distributed exercise intervals, we show…

Probability · Mathematics 2017-12-27 José Luis Pérez , Kazutoshi Yamazaki

We study the numerical solution of nonlinear partially observed optimal stopping problems. The system state is taken to be a multi-dimensional diffusion and drives the drift of the observation process, which is another multi-dimensional…

Optimization and Control · Mathematics 2010-01-20 Mike Ludkovski

We present a methodology for obtaining explicit solutions to infinite time horizon optimal stopping problems involving general, one-dimensional, It\^o diffusions, payoff functions that need not be smooth and state-dependent discounting.…

Computational Finance · Quantitative Finance 2012-10-10 Timothy C. Johnson

We consider an optimal stopping time problem related with many models found in real options problems. The main goal of this work is to bring for the field of real options, different and more realistic pay-off functions, and negative…

Optimization and Control · Mathematics 2017-01-10 Manuel Guerra , Cláudia Nunes , Carlos Oliveira

We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…

Information Theory · Computer Science 2017-03-17 Sohail Bahmani , Justin Romberg