Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.27552

Optimal Two-Mode Switching with Setup Costs for a Controlled Ornstein--Uhlenbeck Process

Hongkun Xia·Dacheng Yao
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study an infinite-horizon discounted optimal switching problem for an Ornstein--Uhlenbeck process whose mean-reversion level can be switched between two values. Switching incurs positive, potentially asymmetric fixed costs, and the mode with the higher mean-reversion level entails an additional running cost. The revenue rate is proportional to the positive part of the state. We characterize the value function and identify parameter conditions under which an optimal policy either remains permanently in one mode after a possible costly initial switch or follows a threshold rule. The threshold formulation allows infinite boundaries and therefore includes one-way switching. A key technical contribution is to establish existence and uniqueness of the relevant solutions to the coupled nonlinear free-boundary equations arising from value-matching and smooth-fit conditions. In the corresponding parameter regimes, these solutions determine the finite switching thresholds and the coefficients of the candidate value functions. A verification argument then establishes the optimality of the resulting policies over all admissible switching strategies.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hongkun Xia, Dacheng Yao. 2026-10-20. Optimal Two-Mode Switching with Setup Costs for a Controlled Ornstein--Uhlenbeck Process. https://arxiv.org/abs/2610.27552

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Signature Methods for Optimal Market Making

We propose a signature-based method to solve the optimal market-making problem under a mean-variance criterion. By exploiting signature linearization techniques, we reduce the market-making problem to a pseudo-linear optimization over the expected signature of an augmented market path, and we develop a signature algorithm named Sig-REINFORCE to learn the optimal bid and ask quotes. We test our method in two scenarios, in which market-order arrivals follow either a Poisson or a self-exciting Hawkes process, and we benchmark it against a Proximal Policy Optimization (PPO) baseline.

math.OC↗
arXiv2026

Kurdyka-Łojasiewicz-based convergence analysis with approximate weakly convex subdifferentials: bundle, quadratic penalty, and moving balls approximation methods

The Kurdyka-Lojasiewicz (KL) property has been widely used for establishing global sequential convergence and analyzing local convergence rate of optimization algorithms. Most existing analysis frameworks rely on the construction of a suitable KL potential function such that along the sequence generated, it admits sufficient descents and its exact subdifferentials are suitably controlled by successive changes of the iterates. Nevertheless, a handful of important algorithms, such as bundle methods and quadratic penalty methods, are not known to have potential functions verifying the aforementioned properties, rendering their convergence analysis out of the reach of existing KL-based convergence analysis template. In this paper, we develop a new convergence analysis framework to extend the applicability of KL-based analysis. Our framework is built on a weakly convex KL potential function $ψ$. It allows approximate sufficient descents, the use of diminishing stepsizes, and controls on enlarged subdifferentials of $ψ$ known as the $\varrho$-weakly-convex-$\varepsilon$-subdifferentials. We illustrate the usefulness of our framework by establishing the global sequential convergence and analyzing the local convergence rate of some recent variants of bundle method, quadratic penalty method and moving balls approximation method. Specifically, we show that these methods fall under our framework by presenting explicit and natural choices of $ψ$, and derive suitable choices of model parameters, penalty parameters and constraint shrinkage parameters, respectively, for establishing their global sequential convergence and local convergence rate based on the KL property and exponent of $ψ$.

math.OC↗
arXiv2026

When Weak Submodularity Meets Matroids: How Does Standard Greedy Behave?

Weakly submodular maximization finds numerous applications in machine learning, data mining and statistics. In particular, under a cardinality constraint, the standard greedy algorithm is known to attain the tight $(1-e^{-γ})$-approximation guarantee, where $γ$ denotes the submodularity ratio. However, when considering general matroid constraints, \emph{how well standard greedy can perform} has remained a longstanding open question. In this paper, we resolve this question by studying the worst-case approximation guarantee $R_{\mathrm{gr}}(γ,r)$ of standard forward greedy, where $r$ is the rank of matroid. Specifically, our first contribution is the following refined lower bound \begin{equation*} R_{gr}(γ,r)\ge \max\left\{ \fracγ{r}, \frac{γ^2} {B_γ+\sqrt{γ(r-1)}}, \frac{γ^{r+1}} {2-γ+γ^{r+1}}, \frac{γ^2} {14\left(B_γ+\sqrt{γ(1-γ)(r-1)}\right)} \right\}, \end{equation*} where $B_γ\triangleq2-γ+γ^2$. This lower bound not only strictly improves upon the previous guarantee of $0.4γ^2/(1+\sqrt{γr})$, but also can recover the classical $1/2$-approximation guarantee at $γ=1$. Subsequently, a corresponding upper bound is established for $R_{\mathrm{gr}}(γ,r)$, namely, \begin{equation}\label{eq_upper_abstract} R_{gr}(γ,r) \le\min\left\{\frac{1}{2},20\max\left\{\fracγ{r}, \frac{γ^2}{B_γ+ \sqrt{γ(1-γ)(r-1)}}\right\}\right\}. \end{equation} For every fixed $γ\in(0,1)$, this equation effectively sharpens the recent $O_γ(1/\log(n-1))$ upper bound to $O_γ(r^{-1/2})$, where $n$ is the size of ground set. Putting all these results together, we eventually can obtain \[R_{gr}(γ,r) = Θ\left( \max\left\{\fracγ{r}, \frac{γ^2} {1+\sqrt{γ(1-γ)r}}\right\} \right).\]

math.OC↗