Math 2.0

Calculus of variations and optimal control; optimization Definition

Optimal control of partial differential equations

Builds on Optimal controlPartial differential equationBanach spaceConvex setSobolev space

Definition

Let YY, ZZ and VV be real Banach spaces, called the state space, the target space of the equation, and the control space. Let e ⁣:Y×V→Ze \colon Y \times V \to Z be a map that encodes a partial differential equation with its boundary conditions. Thus e(y,u)=0e(y, u) = 0 means that yy solves the equation with control uu. Let Vad⊆VV_{\mathrm{ad}} \subseteq V be a nonempty set of admissible controls, and let J ⁣:Y×V→ℝJ \colon Y \times V \to \R be a cost functional. An optimal control problem for a partial differential equation is the problem minimize J(y,u)subject to e(y,u)=0,  u∈Vad.\text{minimize } J(y, u) \quad \text{subject to } e(y, u) = 0, \; u \in V_{\mathrm{ad}}. A pair (y∗,u∗)(y^*, u^*) with e(y∗,u∗)=0e(y^*, u^*) = 0 and u∗∈Vadu^* \in V_{\mathrm{ad}} is optimal if J(y∗,u∗)≤J(y,u)J(y^*, u^*) \le J(y, u) for all such pairs (y,u)(y, u).

Remarks

Example: let Ω⊆ℝd\Omega \subseteq \R^d be a bounded open set, let yd∈L2(Ω)y_d \in L^2(\Omega), α>0\alpha > 0 and a<ba < b. Minimize 12∥y−yd∥L2(Ω)2+α2∥u∥L2(Ω)2\frac12 \norm{y - y_d}_{L^2(\Omega)}^2 + \frac{\alpha}{2} \norm{u}_{L^2(\Omega)}^2 over u∈L2(Ω)u \in L^2(\Omega) with a≤u≤ba \le u \le b almost everywhere, where y∈H01(Ω)y \in H^1_0(\Omega) is the weak solution of −Δy=u-\Delta y = u in Ω\Omega, y=0y = 0 on ∂Ω\partial \Omega. This fits the definition with Y=H01(Ω)Y = H^1_0(\Omega), V=L2(Ω)V = L^2(\Omega), Z=H−1(Ω)Z = H^{-1}(\Omega) and e(y,u)=−Δy−ue(y, u) = -\Delta y - u. Here the problem has a unique solution, because the control-to-state map is linear and bounded. So the reduced cost is strictly convex, continuous and coercive on the closed convex set VadV_{\mathrm{ad}}. Non-example: if the state equation is an ordinary differential equation in ℝn\R^n, the problem is an ordinary optimal control problem, not one for a partial differential equation. When e(y,u)=0e(y, u) = 0 has a unique solution y=S(u)y = S(u) for each uu, the problem reduces to minimizing f(u)=J(S(u),u)f(u) = J(S(u), u) over VadV_{\mathrm{ad}}.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Banach space concept
  2. Convex set concept
  3. Optimal control concept
  4. Partial differential equation concept
  5. Sobolev space concept
  6. Optimal control of partial differential equations definition

Further reading

  1. Web https://en.wikipedia.org/wiki/PDE-constrained_optimization
About this page
TagDVA7AZ0HDJ
URIm2://DVA7AZ0HDJ
Kinddefinition
WritingW0 stub
MSC49J20, 49K20, 93C20
DefinesOptimal control of partial differential equations
UsesOptimal control, Partial differential equation, Banach space, Convex set, Sobolev space

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.