Search arXivSearch

arXiv · 2402.06873

Analysis of Unregularized Optimal Control Problems Constrained by the Boussinesq System

Abstract

This paper investigates solution stability properties of unregularized tracking-type optimal control problems constrained by the Boussinesq system. In our model, the controls may appear linearly and distributed in both of the equations that constitute the Boussiniesq system and in the objective functional. We establish, not only the existence of weak solutions, but also unique existence of strong solutions in $L^p$ sense for the Boussinesq system as well as its corresponding linearized and adjoint systems. The optimal control problem is then analyzed by providing the existence of an optimal control, and by establishing first-order necessary and second order sufficient conditions. Then, using assumptions on the joint growth of the first and second variations of the objective functional, we prove the strong metric Hölder subregularity of the optimality mapping, which in turn allows the study of solution stability of the optimal control and states under various linear and nonlinear perturbations. Such perturbations may appear in the Boussinesq system and the objective functional. As an application, we provide a convergence rate for the optimal solutions of the Tikhonov regularized problem as the Tikhonov parameter tends to zero. Furthermore, the obtained stability of the optimal states provides, to the best knowledge of the authors, the first result on the stability of the second-order sufficient condition in affine PDE-constrained optimization under an assumption on the desired profile which is natural for tracking-type objective functionals.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicolai Jork, John Sebastian H. Simon. 2024-02-10. Analysis of Unregularized Optimal Control Problems Constrained by the Boussinesq System. https://arxiv.org/abs/2402.06873

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

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC