Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “manifold optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Trajectory design via unsupervised probabilistic learning on optimal manifolds

Abstract This article illustrates the use of unsupervised probabilistic learning techniques for the analysis of planetary reentry trajectories. A three-degree-of-freedom model was employed to generate optimal trajectories that comprise the training datasets. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. We find that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. Using the diffusion coordinates on the graph of training samples, the probabilistic framework subsequently augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path planning algorithm. In this framework, the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time.

42 ENGINEERING↗

Optimization on Manifolds via Graph Gaussian Processes

This paper integrates manifold learning techniques within a Gaussian process upper confidence bound algorithm to optimize an objective function on a manifold. Our approach is motivated by applications where a full representation of the manifold is not available and querying the objective is expensive. We rely on a point cloud of manifold samples to define a graph Gaussian process surrogate model for the objective. Query points are sequentially chosen using the posterior distribution of the surrogate model given all previous queries. We establish regret bounds in terms of the number of queries and the size of the point cloud. Several numerical examples complement the theory and illustrate the performance of our method.

Bayesian optimization↗

Compressing Vision Transformers in Geospatial Transfer Learning with Manifold-Constrained Optimization

Deploying geospatial foundation models on resource-constrained edge devices demands compact architectures that maintain high downstream performance. However, their large parameter counts and the accuracy loss often induced by compression limit practical adoption.In this work, we leverage manifold-constrained optimization framework DLRT to compress large vision transformer–based geospatial foundation models during transfer learning. By enforcing structured low-dimensional parameterizations aligned with downstream objectives, this approach achieves strong compression while preserving task-specific accuracy. We show that the method outperforms of-the-shelf low-rank methods as LoRA. Experiments on diverse geospatial benchmarks confirm substantial parameter reduction with minimal accuracy loss, enabling high-performing, on-device geospatial models.

Snyder, Thomas [Yale University]↗

Continuous Optimization on Constraint Manifolds

This paper demonstrates continuous optimization on the differentiable manifold formed by continuous constraint functions. The first order tensor geodesic differential equation is solved on the manifold in both numerical and closed analytic form for simple nonlinear programs. Advantages and disadvantages with respect to conventional optimization techniques are discussed.

Dean, Edwin B.↗

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

Here we propose a manifold sampling algorithm for minimizing a nonsmooth composition $f= h\circ F$, where we assume $h$ is nonsmooth and may be inexpensively computed in closed form and $F$ is smooth but its Jacobian may not be available. We additionally assume that the composition $h\circ F$ defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of $F$ are combined with particularly sampled information about $h$ to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about $f$.

97 MATHEMATICS AND COMPUTING↗

The CF6 Jet Engine Performance Improvement - Low Pressure Turbine Active Clearance Control

A low pressure turbine (LPT) active clearance control (ACC) cooling system was developed to reduce the fuel consumption of current CF6-50 turbofan engines for wide bodied commercial aircraft. The program performance improvement goal of 0.3% delta sfc was determined to be achievable with an improved impingement cooling system. The technology enables the design of an optimized manifold and piping system which is capable of a performance gain of 0.45% delta sfc.

Beck, B. D.↗

PCAfold 2.0—Novel tools and algorithms for low-dimensional manifold assessment and optimization

We describe an update to our open-source Python package, PCAfold, designed to help researchers generate, analyze and improve low-dimensional data manifolds. In the current version, PCAfold 2.0, we introduce novel tools and algorithms for assessing and optimizing low-dimensional manifolds. This includes a method that generates a “map” of local feature sizes that can help pinpoint researchers to problematic regions on a manifold. We introduce a novel cost function that characterizes the quality of a manifold topology with a single number. We develop two algorithms for feature selection based on principal component analysis (PCA) that use the cost function as an objective function to minimize. We introduce a quantity of interest (QoI)-aware dimensionality reduction strategy where data projections are computed using an artificial neural network and are directly optimized towards representing various projection-independent and projection-dependent QoIs. We also introduce an implementation of partition of unity networks (POUnets) for efficient reconstruction of QoIs from low-dimensional manifolds based on combining neural network classification with localized polynomial regression. Our software can be broadly applicable in all domains of science and engineering that aim to reduce data dimensionality, as well as in the fundamental research on representation learning.

97 MATHEMATICS AND COMPUTING↗

CMLM (Co-Optimized Machine-Learned Manifolds) [SWR-23-41]

Co-optimized Machine-Learned Manifolds (CMLM) is a data-driven approach for developing reduced-order manifold models for high-dimensional chemically reacting systems. It involves a specially designed neural network, the training of which simultaneously optimizes linear combinations of species that define the manifold, nonlinear mapping to outputs of interest such as reaction rates, and (optionally) subfilter closure for large eddy simulation. This software package provides an implementation of the CMLM approach in Python using the PyTorch machine learning library. A few example cases are included, showing how the tool can be applied to different types of data from 0D and 1D reacting simulations performed using Cantera. The neural networks can be saved in a format that is readable by the Pele suite of combustion solvers for use in reacting computational fluid dynamics simulations. This software repository contains several python scripts to perform various tasks associated with the Co-optimized Machine Learned Manifolds (CMLM) model, which is described in Perry, Henry de Frahan, and Yellapantula, CNF, 2022 (https://doi.org/10.1016/j.combustflame.2022.112286). This includes not only the code that defines the CMLM model, but also scripts to generate suitable training data, scripts to pre-process the data, scripts to train the CMLM model, and scripts to plot the output, as well as various other helper files. The scripts depend on several commonly used python libraries for data analysis and chemical reaction computations. The trained models that result from this tool are designed to work with the an interface being implemented in the Pele suite of reacting flow solvers (https://github.com/AMReX-Combustion).

Perry, Bruce↗

Extended Finite Element Based Approach in Additive Manufacturing Modeling for Optimizing Highly Complex Manifold in Protonic Ceramic Electrochemical Cells

The objective of this project is to develop a novel numerical approach based on the extended finite element method (XFEM) for modeling moving boundaries of material deposited in additive manufacturing (AM) process with improved accuracy and reduced computational cost. One of the major challenges in simulating AM processes is that the boundaries of the computational domain need to change as material is deposited. Previous approaches have achieved this by activating new finite elements, but this requires a high level of mesh refinement to capture small movement of the boundary. XFEM allows the solution boundary to move independently of the mesh, permitting smooth representation of the evolution of the boundary as material is deposited. As a result, this new method will significantly improve the simulation accuracy while reducing the computational cost compared with existing approaches. Furthermore, this project will bring significant improvements for the design and AM process optimization in an iterative fashion among numerical simuation, parameter optimization, and experimental validation. Specifically, this project will support the protonic ceramic electrochemical cells (PCEC) stack development at INL by providing insights into the density, residual stress, thermal and mechanical properties of the PCEC manifold and interconnect, which is critical in enhancing the system lifetime and reducing the overall cost. Upon the success of proposed development and validation of the proposed approach, simulation will be applied to determine an optimal set of AM process parameters for the PCEC manifold production. This project will consolidate Idaho National Laboratory (INL)’s simulation capabilities provided by the MOOSE framework and the Valhalla AM simulation application, with encouraging expansion to emerging PCEC applications and AM technologies at INL and beyond.

97 MATHEMATICS AND COMPUTING↗

Using Co-Optimized Machine Learned Manifolds for Modeling Chemically Reacting Flows

Chemically reacting flows play a key role in a wide range of engineered systems, from chemical and polymer processing to combustion-based energy conversion technologies. Simulations of these flows involve solving a coupled set of partial differential equations for mass, momentum, energy, and all relevant chemical species in the system. Chemical reaction pathways may be extremely complex and involve hundreds or more intermediate species, with reactions that occur over timescales varying by several orders of magnitude - presenting a significant numerical stiffness challenge. The combination of these factors makes simulation of chemically reacting flows vastly more expensive than nonreactive simulations, and often makes direct solution of the governing equations intractable. It is necessary to apply lower-fidelity models in place of the detailed governing equations in order to reduce computational cost to enable reacting flow simulation tools to be used in the engineering design process. Many of the models employed for this purpose are based on reducing the dimension of the thermochemical state, motivated by the observation that the observed thermochemical states in a system lie on a low-dimensional manifold in thermochemical state space. This behavior occurs due to the fast equilibration of certain reactive and transport processes, and physics-based manifold models rely on idealized assumptions about the balance of timescales and the way in which chemistry and transport are coupled. In this work, we apply a novel method for data-driven manifold-based modeling that can leverage data from high-fidelity reacting flow simulations to improve model accuracy in cases where the physics-based modeling assumptions break down. The approach is designed to be broadly applicable across chemically reacting flow systems but is applied here to turbulent combustion modeling.

machine learning↗

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗

Learning Provably Stable Local Volt/Var Controllers for Efficient Network Operation

Here this paper develops a data-driven framework to synthesize local Volt/Var control strategies for distributed energy resources (DERs) in power distribution grids (DGs). Aiming to improve DG operational efficiency, as quantified by a generic optimal reactive power flow (ORPF) problem, we propose a two-stage approach. The first stage involves learning the manifold of optimal operating points determined by an ORPF instance. To synthesize local Volt/Var controllers, the learning task is partitioned into learning local surrogates (one per DER) of the optimal manifold with voltage input and reactive power output. Since these surrogates characterize efficient DG operating points, in the second stage, we develop local control schemes that steer the DG to these operating points. We identify the conditions on the surrogates and control parameters to ensure that the locally acting controllers collectively converge, in a global asymptotic sense, to a DG operating point agreeing with the local surrogates. We use neural networks to model the surrogates and enforce the identified conditions in the training phase. AC power flow simulations on the IEEE 37-bus network empirically bolster the theoretical stability guarantees obtained under linearized power flow assumptions. The tests further highlight the optimality improvement compared to prevalent benchmark methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Co-optimized machine-learned manifold models for large eddy simulation of turbulent combustion

Many modeling approaches in large eddy simulation (LES) of turbulent combustion employ a projection of the thermochemical state onto a low-dimensional manifold within state space to reduce the number of transported variables and hence computational cost. Flamelet-generated manifolds (FGM) is an example of a well-established, physics-based approach, but increasingly, principal component analysis (PCA) is being used as a data-driven method for generating manifold models. For both approaches, the nonlinear relationship between the location on the predefined manifold and the outputs of interest, such as reaction rates, can be tabulated or encoded in a neural network. This work proposes a new approach for manifold modeling that extends these existing approaches. A modified neural network structure simultaneously encodes the definition of the manifold variables, the nonlinear mapping, and the subfilter closure for LES. This allows all three of these aspects of the model to be co-optimized, generating a model from any source of combustion thermochemical state data. The manifold parameterizing variables are constrained to be linear combinations of species, as in FGM and PCA-based models, to aid in interpretability and implementation. For LES, subfilter variances of the manifold variables are also included as inputs. Two types of a priori analysis are performed to evaluate the new approach. In the first, the model is trained on data from one-dimensional premixed flames. In this case, the approach recovers the behavior of flamelet-based manifold approaches, and in fact slightly improves performance by identifying an optimized progress variable. The approach is also applied to data from direct numerical simulations of spherical ignition kernels in isotropic turbulence. For any specified manifold dimensionality, the new approach provides substantially lower prediction errors than a PCA-based model developed from the same data set. Additionally, the LES formulation of the new approach can provide accurate predictions for filtered reaction rates across a variety of filter widths.

97 MATHEMATICS AND COMPUTING↗

Power Flow Geometry and Approximation

Here, the power flow equations are important in numerous power systems problems of practical interest which consider alternating current power flow (ACPF) physics. Perhaps the most well studied being the alternating current optimal power flow problem (ACOPF), seeking to optimize the operation of an electric power system. Due to their non-linearity, problems which include the power flow equations are typically challenging, particularly in optimization. Interestingly, the set of solutions to the power flow equations forms a smooth manifold. As a result, differential geometry can be used to describe and analyze this set of equations. This approach has proven effective in several engineering applications (e.g., solving ACOPF and analyzing the solution space boundary). Central to the success of this approach is an understanding of the power flow manifold's geometry. In this work, we develop the geometric and topological properties of this manifold using concepts from differential geometry. After demonstrating the convenience of this manifold's representation as a function's graph, computational methods are emphasized: we develop retractions, error bounds for linear approximation, and formulas for evaluating the Riemannian metric (including associated objects such as geodesics and the curvature tensor). Scalar curvature and the second fundamental form play a new role in quantifying the quality of linear approximations, like the popular direct current approximation. All functions are implemented in Julia and available in an online repository. Proofs are included for completeness.

24 POWER TRANSMISSION AND DISTRIBUTION↗