SearcharxivSearch

arXiv · 2105.05895

Lipschitz Stability and Hadamard Directional Differentiability for Elliptic and Parabolic Obstacle-Type Quasi-Variational Inequalities

Abstract

This paper is concerned with the sensitivity analysis of a class of parameterized fixed-point problems that arise in the context of obstacle-type quasi-variational inequalities. We prove that, if the operators in the considered fixed-point equation satisfy a positive superhomogeneity condition, then the maximal and minimal element of the solution set of the problem depend locally Lipschitz continuously on the involved parameters. We further show that, if certain concavity conditions hold, then the maximal solution mapping is Hadamard directionally differentiable and its directional derivatives are precisely the minimal solutions of suitably defined linearized fixed-point equations. In contrast to prior results, our analysis requires neither a Dirichlet space structure, nor restrictive assumptions on the mapping behavior and regularity of the involved operators, nor sign conditions on the directions that are considered in the directional derivatives. Our approach further covers the elliptic and parabolic setting simultaneously and also yields Hadamard directional differentiability results in situations in which the solution set of the fixed-point equation is a continuum and a characterization of directional derivatives via linearized auxiliary problems is provably impossible. To illustrate that our results can be used to study interesting problems arising in practice, we apply them to establish the Hadamard directional differentiability of the solution operator of a nonlinear elliptic quasi-variational inequality, which emerges in impulse control and in which the obstacle mapping is obtained by taking essential infima over certain parts of the underlying domain, and of the solution mapping of a parabolic quasi-variational inequality, which involves boundary controls and in which the state-to-obstacle relationship is described by a partial differential equation.

Explore related subjects

Keep this discovery

BibTeXRIS

Constantin Christof, Gerd Wachsmuth. 2021-05-12. Lipschitz Stability and Hadamard Directional Differentiability for Elliptic and Parabolic Obstacle-Type Quasi-Variational Inequalities. https://arxiv.org/abs/2105.05895

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