Search arXivSearch

arXiv · 1403.4198

Finite-Horizon Parameterizing Manifolds, and Applications to Suboptimal Control of Nonlinear Parabolic PDEs

Abstract

This article proposes a new approach based on finite-horizon parameterizing manifolds (PMs) for the design of low-dimensional suboptimal controllers to optimal control problems of nonlinear partial differential equations (PDEs) of parabolic type. Given a finite horizon $[0,T]$ and a low-mode truncation of the PDE, a PM provides an approximate parameterization of the uncontrolled high modes by the controlled low ones so that the unexplained high-mode energy is reduced, in an $L^2$-sense, when this parameterization is applied. Analytic formulas of such PMs are derived by application of the method of pullback approximation of the high-modes (Chekroun, Liu, and Wang, 2013, http://arxiv.org/pdf/1310.3896v1.pdf). These formulas allow for an effective derivation of reduced ODE systems, aimed to model the evolution of the low-mode truncation of the controlled state variable, where the high-mode part is approximated by the PM function applied to the low modes. A priori error estimates between the resulting PM-based low-dimensional suboptimal controller $u_R^\ast$ and the optimal controller $u^*$ are derived. These estimates demonstrate that the closeness of $u_R^\ast$ to $u^*$ is mainly conditioned on two factors: (i) the parameterization defect of a given PM, associated respectively with $u_R^\ast$ and $u^*$; and (ii) the energy kept in the high modes of the PDE solution either driven by $u_R^\ast$ or $u^*$ itself. The practical performances of such PM-based suboptimal controllers are numerically assessed for various optimal control problems associated with a Burgers-type equation. The numerical results show that a PM-based reduced system allows for the design of suboptimal controllers with good performances provided that the associated parameterization defects and energy kept in the high modes are small enough, in agreement with the rigorous results.

Explore related subjects

Keep this discovery

BibTeXRIS

Mickaël D. Chekroun, Honghu Liu. 2014-04-10. Finite-Horizon Parameterizing Manifolds, and Applications to Suboptimal Control of Nonlinear Parabolic PDEs. https://doi.org/10.1007/s10440-014-9949-1

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