SearcharxivSearch

arXiv · 2510.12345

Carleman Estimates for Backward Anisotropic Stochastic Parabolic Equations with General Dynamic Boundary Conditions and Applications

Abstract

We investigate a backward anisotropic stochastic parabolic equation with general dynamic boundary conditions, where the drift involves both $\mathbb{L}^2$ and $\mathbb{H}^{-1}$ bulk--surface terms. We first establish the well-posedness of this equation. Subsequently, we derive a new Carleman estimate through a two-step approach. In the first step, using a weighted identity method together with a careful treatment of the boundary integral terms arising from the dynamic boundary conditions, we obtain an intermediate Carleman estimate for backward anisotropic stochastic parabolic equations without weak divergence source terms. In the second step, a duality method combined with suitable optimization techniques is employed to incorporate the weak divergence source terms. As applications of the derived Carleman estimate, we address two control problems. First, we establish null controllability for forward anisotropic stochastic parabolic equations with general dynamic boundary conditions. These equations involve both reaction and convection terms, with adapted, bounded stochastic bulk--surface coefficients. Moreover, we provide an explicit estimate of the null controllability cost, i.e., a bound on the minimal norm of controls required to drive the system to zero at the terminal time $T$. Second, we study an insensitizing control problem for this class of equations. The goal is to determine controls for systems with partially unknown initial data such that a given energy functional remains insensitive to small perturbations of these data. In this work, the functional involves the norm of the state over a localized bulk--surface region, together with the norm of its tangential gradient over a localized boundary region.

Explore related subjects

Keep this discovery

BibTeXRIS

Said Boulite, Abdellatif Elgrou, Lahcen Maniar, Abdelaziz Rhandi. 2025-10-14. Carleman Estimates for Backward Anisotropic Stochastic Parabolic Equations with General Dynamic Boundary Conditions and Applications. https://arxiv.org/abs/2510.12345

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC