betaFeedback

WorksMathematics

Optimizing bounds for energy-constrained optimal cooling problems in two dimensions

Abstract

We study optimal control problems for incompressible fluids in two-dimensional domains with a cold boundary and internal heat sources and sinks. Given a kinetic energy budget, measured by the square of a nondimensional Péclet number Pe\mathrm{Pe}, the goal is to maximize a cooling efficiency inversely proportional to the mean square gradient of the fluid's temperature. Using Lagrange duality, we formulate a well-posed dual problem whose solution yields an upper bound on the maximum cooling efficiency E(Pe)\mathcal{E}(\mathrm{Pe}). We then numerically approximate the dual problem using a convergent hierarchy of semidefinite programs obtained via discretization. We illustrate this computational approach on optimal cooling problems in a square and in an annulus, explaining also how problem symmetries can be exploited to reduce computational complexity. Finally, we construct admissible points for the dual problem to obtain new analytical upper bounds on the optimal cooling efficiency E(Pe)\mathcal{E}(\mathrm{Pe}). Specifically, we prove that E(Pe)≲Pe2\mathcal{E}(\mathrm{Pe}) \lesssim \mathrm{Pe}^{2} for arbitrary domains and heat distributions, and that E(Pe)≲Pe2/ln⁡2Pe\mathcal{E}(\mathrm{Pe}) \lesssim \mathrm{Pe}^{2}/ \ln^2\mathrm{Pe} for cooling flows in disks and annuli with heat source/sink distributions with a uniformly positive azimuthal average. These results generalize and improve known efficiency bounds for energy-constrained cooling flows in a disk.

Introduction

Optimal cooling problems, in which the flow of a fluid must be controlled to efficiently cool domains with internal heat sources, are fundamental in fluid mechanics. They are central to the design of heat exchangers and also provide a paradigm for studying transport processes. Locally optimal flows can usually be computed with algorithms for PDE-constrained optimization (see, e.g., [1, 2, 28, 44, 53]), and provide lower bounds on the optimal cooling efficiency. Upper bounds, in contrast, are substantially more difficult to compute because they are statements about the efficiency of all possible flows. Remarkably, the difficulty persists even in a highly simplified setting where the admissible fluid flows are steady, heat is a passive scalar with no effect on the fluid’s motion, and the only constraints on the flow are incompressibility and a bound on some norm of the fluid’s velocity. In this work, we focus on two-dimensional incompressible flows with prescribed L2L^{2} norm, which physically correspond to flows with a prescribed kinetic energy.

Problem description

Consider an incompressible fluid flowing inside a bounded, possibly multiply connected domain Ω⊂R2\Omega\subset\mathbb{R}^{2} with Lipschitz boundary ∂Ω\partial\Omega. The flow is described by a time-independent and weakly divergence-free velocity field u∈L2(Ω;R2)\mathbf{u} \in L^{2}(\Omega;\mathbb{R}^{2}) satisfying the no-penetration condition u⋅n^=0\mathbf{u}\cdot\hat{\mathbf{n}}=0 on ∂Ω\partial\Omega, where n^\hat{\mathbf{n}} is the outward-pointing unit vector normal to the boundary and u⋅n^\mathbf{u}\cdot\hat{\mathbf{n}} is the normal trace of u\mathbf{u}. The domain is subject to a nonzero distribution f∈H−1(Ω)f \in H^{-1}(\Omega) of heat sources and sinks, while its

E-mail address: [email protected], [email protected].

Date: October 26, 2026.

GF was supported by the DFG-ANR project MONET (grant number 568735456). PB was supported by the DFG project Renormalized Solutions for the Optimal Control of Evolution Equations (grant number 551486487). boundary is held at a constant temperature of zero. The temperature TT of the fluid then solves the steady advection-diffusion equation

{−ΔT+u⋅∇T=fin Ω,T=0on ∂Ω.(1)\begin{cases} -\Delta T + \mathbf{u} \cdot\nabla T = f & \text{in } \Omega,\\ T = 0 & \text{on } \partial\Omega. \tag*{(1)} \end{cases}

We wish to understand how well the domain can be cooled by flows with bounded kinetic energy, measured by the square of a nondimensional parameter Pe called the Péclet number. We consider a flow efficient at cooling if the temperature is nearly constant on Ω\Omega, so ∫Ω∣∇T∣2 dx\int_{\Omega} |\nabla T|^2 \, \mathrm{d}x is small. Optimal flows then solve

J(Pe):=inf⁡u∈L2(Ω;R2)div⁡u=0 in Ωu⋅n^=0 on ∂Ω∥u∥L2≤Pe∫Ω∣∇T∣2 dx\mathcal{J}(\mathrm{Pe}) := \inf_{\substack{\mathbf{u}\in L^2(\Omega;\mathbb{R}^2)\\ \operatorname{div}\mathbf{u}=0\ \text{in }\Omega\\ \mathbf{u}\cdot\hat{\mathbf{n}}=0\ \text{on }\partial\Omega\\ \lVert\mathbf{u}\rVert_{L^2}\le\mathrm{Pe}}} \int_{\Omega} |\nabla T|^2 \, \mathrm{d}x

This is a nonconvex optimal control problem for the advection-diffusion equation (1.1), where the nonconvexity is due entirely to the bilinear term u⋅∇T\mathbf{u}\cdot\nabla T in this equation. We associate to the optimal control cost J(Pe)\mathcal{J}(\mathrm{Pe}) the optimal cooling efficiency

E(Pe):=∥f∥H−12J(Pe),(2)\mathcal{E}(\mathrm{Pe}) := \frac{\lVert f\rVert_{H^{-1}}^2}{\mathcal{J}(\mathrm{Pe})}, \tag*{(2)}

where the factor ∥f∥H−12\lVert f\rVert_{H^{-1}}^2 is included to have E(0)=1\mathcal{E}(0)=1. In other words, we measure the optimal cooling efficiency relative to the no-flow state.

The definitions immediately imply that E(Pe)≥1\mathcal{E}(\mathrm{Pe})\ge1. Better lower bounds can be found by constructing particular flows, including locally optimal ones computed with PDE-constrained optimization algorithms. Our aim is to obtain complementary upper bounds by deriving positive lower bounds on J(Pe)\mathcal{J}(\mathrm{Pe}).

Known bounds

When Ω\Omega is a disk and the heating is uniform (f=1f=1), numerical optimization produces convection rolls achieving ∫Ω∣∇T∣2 dx∼Pe−1\int_{\Omega}|\nabla T|^2\,\mathrm{d}x\sim\mathrm{Pe}^{-1} [41].1 Inspired by these computations, analytical constructions for a broad class of sufficiently smooth heating distributions ff provide the lower bound E(Pe)≳Pe\mathcal{E}(\mathrm{Pe})\gtrsim\mathrm{Pe} at sufficiently large Péclet numbers, with a prefactor depending only on the heating distribution [56 Proposition 5.1]. This estimate is in fact true for a time-dependent generalization of our optimal cooling problem, which we do not consider for simplicity.

Lower bounds on optimal cooling efficiencies have also been derived for variations of problem (OCP), such as optimal cooling in a disk under the ‘enstrophy’ constraint ∥∇u∥L2≤Pe\lVert\nabla\mathbf{u}\rVert_{L^2}\le\mathrm{Pe} [56]; optimal cooling of uniformly heated flows between an insulated boundary and an isothermal boundary, with constraints on the LpL^p and W1,pW^{1,p} norms of u\mathbf{u} [31]; optimal cooling in insulated domains with balanced heat sources and sinks [49, 51]; and optimal cooling between differentially heated plates [19, 28, 35, 57]. In all cases, lower bounds on the cooling efficiency are derived from particular flows that resemble those obtained with numerical optimization [41, 44, 53].

Finding matching upper bounds on E(Pe)\mathcal{E}(\mathrm{Pe}) has proven difficult. The problem has received attention within a broader study of heat transport and mixing of passive scalars (see, e.g., [9, 17, 18, 19, 28, 35, 44, 49, 51, 53, 54, 55, 57]) and upper bounds on cooling efficiencies have been derived for many of the settings described above [35, 49, 51, 56]. However, they often exceed the corresponding lower bounds. In particular, the upper bound E(Pe)≲Pe2\mathcal{E}(\mathrm{Pe})\lesssim\mathrm{Pe}^2 for the energy-constrained problem (OCP) in a disk [56 Proposition 2.6] does not match the lower bound E(Pe)≳Pe\mathcal{E}(\mathrm{Pe})\gtrsim\mathrm{Pe}. It is then natural to wonder if the proofs of these upper bounds can be improved and, in particular, whether numerical computations can be used to guide such improvements.

Contributions

We combine Lagrange duality with semidefinite programming to optimize lower bounds on the optimal control cost J(Pe)\mathcal{J}(\mathrm{Pe}), which translate into upper bounds on the cooling efficiency E(Pe)\mathcal{E}(\mathrm{Pe}) via (2). Our key insight is to recognize that existing proofs of lower bounds for J(Pe)\mathcal{J}(\mathrm{Pe}) implicitly construct feasible points for the Lagrange dual of problem (OCP), which is an infinite-dimensional semidefinite program (SDP). We explicitly derive this dual problem, prove its well-posedness (Proposition 2.2), and show that it can be approximated with arbitrary accuracy by finite-dimensional SDPs (Theorem 3.1). These are computationally tractable for fixed Pe\mathrm{Pe}, so the best bound provable via Lagrange duality can be computed numerically.

We also use the dual of (OCP) to derive new analytical upper bounds on E(Pe)\mathcal{E}(\mathrm{Pe}). First, we give an elementary proof that

E(Pe)≤1+CPe2∀Pe≥0,(3)\mathcal{E}(\mathrm{Pe}) \le1 + C\mathrm{Pe}^{2} \qquad\forall\mathrm{Pe} \ge0, \tag*{(3)}

where C>0C > 0 depends only on the fluid’s domain Ω\Omega (Theorem 2.4). This result applies to arbitrary heat distributions ff and domains Ω\Omega, generalizing a similar bound proved in [56] when Ω\Omega is a disk. We then fix Ω\Omega to be a disk or an annulus and prove that

E(Pe)≤CPe2ln⁡2Pe∀Pe>1(4)\mathcal{E}(\mathrm{Pe}) \le C \frac{\mathrm{Pe}^{2}}{\ln^{2}\mathrm{Pe}} \qquad\forall\mathrm{Pe} > 1 \tag*{(4)}

if f∈L1(Ω)∩H−1(Ω)f \in L^{1}(\Omega) \cap H^{-1}(\Omega) has a uniformly positive average on any circle around the domain’s center, where the constant CC depends on the domain and on ff (Theorems 5.1 and 5.2). This logarithmically improved bound holds in particular for uniform heating (f=1f = 1). Its proof is strongly inspired by the numerical results produced by our semidefinite programming computations for a uniformly heated annulus.

Relation to prior work

Lagrange duality is a classical approach for computing bounds on optimization problems. While it is often left implicit, it underpins most existing bounds on the cooling efficiency or other heat transport properties of incompressible flows. In particular, duality arguments similar to ours have been applied to optimal cooling problems in insulated domains with balanced heating and cooling [51]. What distinguishes our work is that we explicitly formulate the Lagrange dual of problem (OCP) in a form suitable for a numerical implementation based on SDPs.

The connection between optimal cooling problems and SDPs is not surprising: discretizations of problem (OCP) are nonconvex quadratic programs, and the Lagrange dual of a quadratic program is an SDP [45, 50]. This fact has been exploited to compute performance bounds for quadratic-program discretizations of optimal design problems in structural mechanics and photonics [3, 4, 14, 22, 58]. Our approach is similar, but we dualize before discretizing. Exchanging these operations has a twofold advantage: we can prove that SDP solutions converge to the best bound provable with Lagrange duality, and we can derive rigorous bounds analytically.

Finally, our approach resembles SDP implementations of the background method, a variational method for bounding the time-averaged dissipation of incompressible flows (see [13, 16, 17] or the review [21] and the references therein). This is because the variational problem at the heart of the background method is the Lagrange dual of a quadratic program relaxation of the optimization problem for the time-averaged dissipation over flows satisfying the incompressible Navier–Stokes equations [32, 33].

Outline

The plan of the paper is as follows. In Section 2, we derive and analyze the Lagrange dual of problem (OCP). In particular, we construct an admissible point for the dual problem to obtain an analytical lower bound on J(Pe)\mathcal{J}(\mathrm{Pe}), which, combined with (2), leads to the efficiency bound in (3). In Section 3, we introduce SDP discretizations of the Lagrange dual problem and prove that they converge with increasing resolution for all discretization schemes with strong approximation properties in the Sobolev space H1(Ω)H^{1}(\Omega). This convergence is not unexpected, but the proof requires specialized arguments due to the non-standard, ‘infinite-dimensional SDP’ structure of the Lagrange dual problem. We demonstrate our numerical strategy in Section 4 on energy-constrained cooling problems in a square and in an annulus, outlining also how problem symmetries can be exploited to reduce computational complexity. In Section 5, inspired by our computations, we refine the analysis of optimal cooling in disks and annuli, proving the efficiency bound in (1.4). Section 6 offers final remarks and perspectives for future work.

The Lagrange dual problem

In this section, we formulate and study the Lagrange dual of the optimal cooling problem (OCP). To obtain this dual problem in a convenient form for both analysis and computations, in Section 2.1 we reformulate (OCP) in terms of a scalar streamfunction. We derive the dual of the reformulated problem in Section 2.2, study its optimizers in Section 2.3, and use it to deduce the efficiency bound (1.3) in Section 2.4.

Streamfunction formulation

Let Γ0\Gamma_0 denote the exterior boundary of the domain Ω\Omega and, if this is multiply connected, let Γ1,…,Γp\Gamma_1,\ldots,\Gamma_p denote all other connected components of the boundary (see Figure 1 for an illustration). Let H\mathcal{H} be the subspace of H1(Ω)H^1(\Omega) containing functions that are constant on each piece of the boundary, i.e.,

Illustration of a multiply connected domain

Figure 1. Illustration of a multiply connected domain Ω\Omega (shaded gray region) with exterior boundary Γ0\Gamma_0 (thick gray line) and interior boundaries Γ1\Gamma_1 (thick green line) and Γ2\Gamma_2 (thick red line).

H:={ψ∈H1(Ω):∃c0,…,cp∈R s.t. ψ∣Γi=ci, 0≤i≤p}.\mathcal{H}:=\left\{\psi\in H^1(\Omega):\exists c_0,\ldots,c_p\in\mathbb{R}\ \text{s.t.}\ \psi|_{\Gamma_i}=c_i,\ 0\le i\le p\right\}.

Every weakly divergence-free vector field u∈L2(Ω;R2)\mathbf{u}\in L^2(\Omega;\mathbb{R}^2) satisfying the no-penetration boundary condition u⋅n^=0\mathbf{u}\cdot\hat{\mathbf{n}}=0 can be expressed as

u=Pe⁡∇⊥ψ=Pe⁡(∂yψ,−∂xψ)(5)\mathbf{u}=\operatorname{Pe}\nabla^\perp\psi=\operatorname{Pe}(\partial_y\psi,-\partial_x\psi) \tag*{(5)}

for a streamfunction ψ∈H\psi\in\mathcal{H} determined up to an additive constant (see, e.g., [23 §3.1]). We fix this constant such that ψ∣Γ0=0\psi|_{\Gamma_0}=0, so H=H01(Ω)\mathcal{H}=H^1_0(\Omega) if Ω\Omega is simply connected. The factor of Pe⁡\operatorname{Pe} in (5) is included for convenience.

With this re-parametrization, the optimal cooling problem (OCP) becomes

J(Pe⁡)=inf⁡ψ∈H∥∇ψ∥L2≤1∫Ω∣∇T∣2 dx(6)\mathcal{J}(\operatorname{Pe})=\inf_{\substack{\psi\in\mathcal{H}\\ \|\nabla\psi\|_{L^2}\le1}}\int_{\Omega}|\nabla T|^2\,\mathrm{d}x \tag*{(6)}

where TT is the unique weak solution of the advection-diffusion equation (1.1) with velocity field u=Pe⁡∇⊥ψ\mathbf{u}=\operatorname{Pe}\nabla^\perp\psi. Specifically, TT is the unique function in H01(Ω)H^1_0(\Omega) satisfying

∫Ω∇ξ⋅∇T+Pe⁡ ξ∇⊥ψ⋅∇T−fξ dx=0∀ξ∈H01(Ω).(7)\int_{\Omega}\nabla\xi\cdot\nabla T+\operatorname{Pe}\,\xi\nabla^\perp\psi\cdot\nabla T-f\xi\,\mathrm{d}x=0\qquad\forall\xi\in H^1_0(\Omega). \tag*{(7)}

The existence and uniqueness of such a weak solution follow from standard arguments based on the Lax–Milgram theorem; the only difficulty is to show that the integral of ξ∇⊥ψ⋅∇T\xi\nabla^\perp\psi\cdot\nabla T is well defined despite the low regularity of the factors, but this is true because ∇⊥ψ⋅∇T=∂yψ∂xT−∂xψ∂yT\nabla^\perp\psi\cdot\nabla T=\partial_y\psi\partial_xT-\partial_x\psi\partial_yT is a Jacobian determinant. In particular, as discussed in [56 Remark 2.2] and [51 §3.1], analysis in [12] implies that

∣∫Ωξ∇⊥ψ⋅∇T dx∣≤c(Ω)∥∇ξ∥L2∥∇ψ∥L2∥∇T∥L2(8)\left|\int_{\Omega}\xi\nabla^\perp\psi\cdot\nabla T\,\mathrm{d}x\right|\le c(\Omega)\|\nabla\xi\|_{L^2}\|\nabla\psi\|_{L^2}\|\nabla T\|_{L^2} \tag*{(8)}

for a positive constant c(Ω)c(\Omega) depending only on the domain Ω\Omega. This estimate will play a key role also in our numerical analysis of § 3.3.

The dual problem

We now dualize the minimization problem in (6) to obtain a convex maximization problem whose optimal value, denoted by L(Pe)\mathcal{L}(\mathrm{Pe}), is a lower bound on J(Pe)\mathcal{J}(\mathrm{Pe}). To ease the notation, we associate to every pair (a,ξ)∈R×H01(Ω)(a,\xi) \in\mathbb{R} \times H_0^1(\Omega) a homogeneous quadratic form Q(a,ξ):H×H01(Ω)→RQ(a,\xi): \mathcal{H} \times H_0^1(\Omega) \to\mathbb{R} defined as

Q(a,ξ)[ψ,θ]:=∫Ωa∣∇ψ∣2+∣∇θ∣2−Pe ξ∇⊥ψ⋅∇θ dx.(9)Q(a,\xi)[\psi,\theta] := \int_{\Omega} a|\nabla\psi|^2 + |\nabla\theta|^2 - \mathrm{Pe}\,\xi\nabla^\perp\psi\cdot\nabla\theta\,\mathrm{d}x. \tag*{(9)}

Note that the map (a,ξ)↦Q(a,ξ)(a,\xi) \mapsto Q(a,\xi) is affine and that the integral is well defined thanks to estimate (8). We write Q(a,ξ)⪰0Q(a,\xi) \succeq0 to indicate that Q(a,ξ)Q(a,\xi) is positive semidefinite, meaning that Q(a,ξ)[ψ,θ]≥0Q(a,\xi)[\psi,\theta] \ge0 for all ψ∈H\psi\in\mathcal{H} and θ∈H01(Ω)\theta\in H_0^1(\Omega).

Proposition 2.1. For every Pe≥0\mathrm{Pe} \ge0, the optimal value J(Pe)\mathcal{J}(\mathrm{Pe}) of problem (OCP) satisfies J(Pe)≥L(Pe)≥0\mathcal{J}(\mathrm{Pe}) \ge\mathcal{L}(\mathrm{Pe}) \ge0, where

References

  1. [1]S. Alben. Optimal convection cooling flows in general 2D geometries. J. Fluid Mech., 814: 484–509, 2017.DOI
  2. [2]S. Alben. Improved convection cooling in steady channel flows. Phys. Rev. Fluids, 2(10): 104501, 2017.arxiv.org/abs/1705.04215
  3. [3]G. Angeris, J. Vučković, and S. P. Boyd. Computational bounds for photonic design. ACS Photonics, 6(5):1232–1239, 2019.DOI
  4. [4]G. Angeris, J. Vučković, and S. P. Boyd. Heuristic methods and performance bounds for photonic design. Opt. Express, 29(2):2827–2854, 2021.DOI
  5. [5]S. Bellavia, J. Gondzio, and M. Porcelli. A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion. J. Sci. Comput., 89(2):46, 2021.DOI
  6. [6]H. Brezis. Functional analysis, Sobolev spaces and partial differential equations. Universitext. Springer, New York, 2011.DOI
  7. [7]S. Burer and C. Choi. Computational enhancements in low-rank semidefinite programming. Optim. Methods Softw., 21(3):493–512, 2006.DOI
  8. [8]S. Burer and R. D. C. Monteiro. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program., 95(2):329–357, 2003.DOI
  9. [9]S. Chanillo and A. Malchiodi. Sharp bounds on the Nusselt number in Rayleigh–Bénard convection and a bilinear estimate by Coifman–Meyer. Invent. Math., 240(2):633–660, 2025.
  10. [10]A. Chernyavsky, J. J. Bramburger, G. Fantuzzi, and D. Goluskin. Convex relaxations of integral variational problems: pointwise dual relaxation and sum-of-squares optimization. SIAM J. Optim., 33(2):481–512, 2023.DOI
  11. [11]S. I. Chernyshenko, P. J. Goulart, D. Huang, and A. Papachristodoulou. Polynomial sum of squares in fluid dynamics: a review with a look ahead. Philos. Trans. Roy. Soc. A, 372 (2020):20130350, 2014.DOI
  12. [12]R. Coifman, P.-L. Lions, Y. Meyer, and S. Semmes. Compacité par compensation et espaces de Hardy. In Séminaire sur les Équations aux Dérivées Partielles, 1989–1990. École Polytech., Palaiseau, 1990. Exp. No. XIV.
  13. [13]P. Constantin and C. R. Doering. Variational bounds on energy dissipation in incompressible flows. II. Channel flow. Phys. Rev. E, 51(4):3192–3198, 1995.pubmed.ncbi.nlm.nih.gov/9961698
  14. [14]A. Dalklint, R. E. Christiansen, and O. Sigmund. On the potential use of performance bounds based on semidefinite programs for topology optimization. Struct. Multidiscip. Optim., 68(7):144, 2025.DOI
  15. [15]Z. Ding and E. Marensi. Upper bound on angular momentum transport in Taylor–Couette flow. Phys. Rev. E, 100(6):063109, 2019.DOI
  16. [16]C. R. Doering and P. Constantin. Variational bounds on energy dissipation in incompressible flows: shear flow. Phys. Rev. E, 49(5):4087–4099, 1994.pubmed.ncbi.nlm.nih.gov/9961698
  17. [17]C. R. Doering and P. Constantin. Variational bounds on energy dissipation in incompressible flows. III. Convection. Phys. Rev. E, 53(6):5957–5981, 1996.pubmed.ncbi.nlm.nih.gov/9964954
  18. [18]C. R. Doering and J.-L. Thiffeault. Multiscale mixing efficiencies for steady sources. Phys. Rev. E, 74(2):025301, 2006.pubmed.ncbi.nlm.nih.gov/17025494
  19. [19]C. R. Doering and I. Tobasco. On the optimal design of wall-to-wall heat transport. Comm. Pure Appl. Math., 72(11):2385–2448, 2019.DOI
  20. [20]G. Fantuzzi, A. Pershin, and A. Wynn. Bounds on heat transfer for Bénard–Marangoni convection at infinite Prandtl number. J. Fluid Mech., 837:562–596, 2018.DOI
  21. [21]G. Fantuzzi, A. Arslan, and A. Wynn. The background method: theory and computations. Philos. Trans. Roy. Soc. A, 380(2225):20210038, 2022.DOI
  22. [22]S. Gertler, Z. Kuang, C. Christie, H. Li, and O. D. Miller. Many photonic design problems are sparse QCQPs. Sci. Adv., 11(1):eadl3237, 2025.DOI
  23. [23]V. Girault and P.-A. Raviart. Finite element approximation of the Navier–Stokes equations, volume 749 of Lecture Notes in Mathematics. Springer-Verlag, Berlin–New York, 1979.DOI
  24. [24]D. Goluskin and G. Fantuzzi. Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming. Nonlinearity, 32(5):1705–1730, 2019.DOI
  25. [25]P. J. Goulart and Y. Chen. Clarabel: an interior-point solver for conic programs with quadratic objectives. Math. Program. Comput., 2026.arxiv.org/abs/2405.12762
  26. [26]P. J. Goulart and S. I. Chernyshenko. Global stability analysis of fluid flows using sum-of-squares. Phys. D, 241(6):692–704, 2012.DOI
  27. [27]S. Habibi, M. Kočvara, and M. Stingl. Loraine – an interior-point solver for low-rank semidefinite programming. Optim. Methods Softw., 39(6):1185–1215, 2024.DOI
  28. [28]P. Hassanzadeh, G. P. Chini, and C. R. Doering. Wall to wall optimal transport. J. Fluid Mech., 751:627–662, 2014.
  29. [29]D. Henrion and A. Rudi. Solving moment and polynomial optimization problems on Sobolev spaces. SIAM J. Optim., 35(2):989–1003, 2025.arxiv.org/abs/2401.07734
  30. [30]D. Henrion, M. Infusino, S. Kuhlmann, and V. Vinnikov. Infinite-dimensional moment-SOS hierarchy for nonlinear partial differential equations. arXiv:2305.18768 [math.OC], 2023.arxiv.org/abs/2305.18768
  31. [31]G. Iyer and T.-S. Van. Bounds on the heat transfer rate via passive advection. SIAM J. Math. Anal., 54(2):1927–1965, 2022.DOI
  32. [32]R. R. Kerswell. Unification of variational principles for turbulent shear flows: the background method of Doering–Constantin and the mean-fluctuation formulation of Howard–Busse. Phys. D, 121(1–2):175–192, 1998.DOI
  33. [33]R. R. Kerswell. Variational principle for the Navier–Stokes equations. Phys. Rev. E, 59(5):5482–5494, 1999.pubmed.ncbi.nlm.nih.gov/11969527
  34. [34]M. Korda, D. Henrion, and J. B. Lasserre. Moments and convex optimization for analysis and control of nonlinear PDEs. In Numerical control. Part A, volume 23 of Handb. Numer. Anal., pages 339–366. North-Holland, Amsterdam, 2022.DOI
  35. [35]A. Kumar. Three dimensional branching pipe flows for optimal scalar transport between walls. Nonlinearity, 37(11):115011, 2024.arxiv.org/abs/2205.03367
  36. [36]J. B. Lasserre. Numerical methods and their applications, volume 1 of Imperial College Press Optimization Series. Imperial College Press, London, 2010.
  37. [37]J. B. Lasserre. The moment-SOS hierarchy: applications and related topics. Acta Numer., 33:841–908, 2024.DOI
  38. [38]M. Laurent. Sums of squares, moment matrices and optimization over polynomials. In Emerging applications of algebraic geometry, volume 149 of IMA Vol. Math. Appl., pages 157–270. Springer, New York, 2009.
  39. [39]B. Legat, C. Coey, R. Deits, J. Huchette, and A. Perry. Sum-of-squares optimization in Julia. In The First Annual JuMP-dev Workshop, 2017.DOI
  40. [40]M. Lubin, O. Dowson, J. D. Garcia, J. Huchette, B. Legat, and J. P. Vielma. JuMP 1.0: recent improvements to a modeling language for mathematical optimization. Math. Program. Comput., 15(3):581–589, 2023.arxiv.org/abs/2206.03866
  41. [41]F. Marcotte, C. R. Doering, J.-L. Thiffeault, and W. R. Young. Optimal heat transfer and optimal exit times. SIAM J. Appl. Math., 78(1):591–608, 2018.DOI
  42. [42]R. D. C. Monteiro, A. S. Sajaiang, and D. Cifuentes. A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach. Math. Program., 2026.arxiv.org/abs/2401.12490
  43. [43]MOSEK ApS. The MOSEK Optimizer API for Julia. Version 11.1.7, 2026.
  44. [44]S. Motoki, G. Kawahara, and M. Shimizu. Maximal heat transfer between two parallel plates. J. Fluid Mech., 851:R4, 2018.DOI
  45. [45]Y. Nesterov, H. Wolkowicz, and Y. Ye. Semidefinite programming relaxations of nonconvex quadratic optimization. In Handbook of semidefinite programming, volume 27 of Internat. Ser. Oper. Res. Management Sci., pages 361–419. Kluwer Acad. Publ., Boston, MA, 2000.DOI
  46. [46]P. A. Parrilo. Polynomial optimization, sums of squares, and applications. In Semidefinite optimization and convex algebraic geometry, volume 13 of MOS-SIAM Ser. Optim., pages 47–157. SIAM, Philadelphia, PA, 2013.
  47. [47]S. C. Plasting and R. R. Kerswell. Improved upper bound on the energy dissipation rate in plane Couette flow: the full solution to Busse’s problem and the Constantin–Doering–Hopf problem with one-dimensional background field. J. Fluid Mech., 477:363–379, 2003.DOI
  48. [48]F. Rajkotia-Zaheer and D. Goluskin. Bounds on dissipation in three-dimensional planar shear flows: reduction to two-dimensional problems. J. Fluid Mech., 1026:A8, 2026.DOI
  49. [49]T. A. Shaw, J.-L. Thiffeault, and C. R. Doering. Stirring up trouble: multi-scale mixing measures for steady scalar sources. Phys. D, 231(2):143–164, 2007.DOI
  50. [50]N. Z. Shor. Quadratic optimization problems. Izv. Akad. Nauk SSSR Tekhn. Kibernet., (1):128–139, 1987.
  51. [51]B. Song, G. Fantuzzi, and I. Tobasco. Bounds on heat transfer by incompressible flows between balanced sources and sinks. Phys. D, 444:133591, 2023.DOI
  52. [52]M. Souto, J. D. Garcia, and A. Veiga. Exploiting low-rank structure in semidefinite programming by approximate operator splitting. Optimization, 71(1):117–144, 2022.
  53. [53]A. N. Souza, I. Tobasco, and C. R. Doering. Wall-to-wall optimal transport in two dimensions. J. Fluid Mech., 889:A34, 2020.DOI
  54. [54]J.-L. Thiffeault. Using multiscale norms to quantify mixing and transport. Nonlinearity, 25(2):R1–R44, 2012.DOI
  55. [55]J.-L. Thiffeault, C. R. Doering, and J. D. Gibbon. A bound on mixing efficiency for the advection-diffusion equation. J. Fluid Mech., 521:105–114, 2004.DOI
  56. [56]I. Tobasco. Optimal cooling of an internally heated disc. Philos. Trans. Roy. Soc. A, 380(2225):20210400, 2022.DOI
  57. [57]I. Tobasco and C. R. Doering. Optimal wall-to-wall transport by incompressible flows. Phys. Rev. Lett., 118(26):264502, 2017.DOI
  58. [58]M. Tyburec, J. Zeman, J. Novák, M. Lepš, T. Plachý, and R. Poul. Designing modular 3D printed reinforcement of wound composite hollow beams with semidefinite programming. Mater. Des., 183:108131, 2019.DOI
  59. [59]G. Valmorbida, M. Ahmadi, and A. Papachristodoulou. Stability analysis for a class of partial differential equations via semidefinite programming. IEEE Trans. Automat. Control, 61(6):1649–1654, 2016.DOI
  60. [60]T. Weisser, B. Legat, C. Coey, L. Kapelevich, and J. P. Vielma. Polynomial and moment optimization in Julia and JuMP. In JuliaCon, 2019.
  61. [61]B. Wen, G. P. Chini, N. Dianati, and C. R. Doering. Computational approaches to aspect-ratio-dependent upper bounds and heat flux in porous medium convection. Phys. Lett. A, 377(41):2931–2938, 2013.DOI
  62. [62]B. Wen, G. P. Chini, R. R. Kerswell, and C. R. Doering. Time-stepping approach for solving upper-bound problems: application to two-dimensional Rayleigh–Bénard convection. Phys. Rev. E, 92(4):043012, 2015.DOI
  63. [63]B. Wen, Z. Ding, G. P. Chini, and R. R. Kerswell. Heat transport in Rayleigh–Bénard convection with linear marginality. Philos. Trans. Roy. Soc. A, 380(2225):20210039, 2022.DOI

Paper details

vlnc:W_acrm4xtt
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI

View statement
Looking for related papers…
Contents