On regularized optimal execution problems and their singular limits
We investigate the portfolio execution problem under a framework in which volatility and liquidity are both uncertain. In our model, we assume that a multidimensional Markovian stochastic factor drives both of them. Moreover, we model indirect liquidity costs as temporary price impact, stipulating a power law to relate it to the agent's turnover rate. We first analyze the regularized setting, in which the admissible strategies do not ensure complete execution of the initial inventory. We prove the existence and uniqueness of a continuous and bounded viscosity solution of the Hamilton-Jacobi-Bellman equation, whence we obtain a characterization of the optimal trading rate. As a byproduct of our proof, we obtain a numerical algorithm. Then, we analyze the constrained problem, in which admissible strategies must guarantee complete execution to the trader. We solve it through a monotonicity argument, obtaining the optimal strategy as a singular limit of the regularized counterparts.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Schatten-$p$ Quasi-Norm Regularized Matrix Optimization via Iterative Reweighted Singular Value Minimization
In this paper we study general Schatten-$p$ quasi-norm (SPQN) regularized matrix minimization problems. In particular, we first introduce a class of first-order stationary points for them, and show that the first-order s…
Exploratory Optimal Stopping: A Singular Control Formulation
This paper explores continuous-time and state-space optimal stopping problems from a reinforcement learning perspective. We begin by formulating the stopping problem using randomized stopping times, where the decision ma…
reinforcement-learningReinforcement LearningOnline and stochastic optimization beyond Lipschitz continuity: A Riemannian approach
Motivated by applications to machine learning and imaging science, we study a class of online and stochastic optimization problems with loss functions that are not Lipschitz continuous; in particular, the loss functions …
Stochastic OptimizationWell-Posed KL-Regularized Control via Wasserstein and Kalman-Wasserstein KL Divergences
Kullback-Leibler (KL) divergence regularization is widely used in reinforcement learning, but it becomes infinite under support mismatch and can degenerate in low-noise regimes. Using a unified information-geometric fram…
Reinforcement LearningRegularized Singular Value Decomposition and Application to Recommender System
Singular value decomposition (SVD) is the mathematical basis of principal component analysis (PCA). Together, SVD and PCA are one of the most widely used mathematical formalism/decomposition in machine learning, data min…
BIG-bench Machine LearningRecommendation Systems