Machine learning models for PDE constrained optimization

Technical Report · Mon Sep 01 04:00:00 EDT 2025

DOI:https://doi.org/10.2172/2589582· OSTI ID:2589582

Chen, Brian ^[1]

---

1. Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)

Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.

• Research Organization: Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
• Sponsoring Organization: USDOE National Nuclear Security Administration (NNSA)
• DOE Contract Number: NA0003525
• OSTI ID: 2589582
• Report Number(s): SAND--2025-11868R; 1789929
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING