Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimality”

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 1,171 records · Page 65

Optimization of nonlinear turbulence in stellarators

We present new stellarator equilibria that have been optimized for reduced turbulent transport using nonlinear gyrokinetic simulations within the optimization loop. The optimization routine involves coupling the pseudo-spectral GPU-native gyrokinetic code GX with the stellarator equilibrium and optimization code DESC . Since using GX allows for fast nonlinear simulations, we directly optimize for reduced nonlinear heat fluxes. To handle the noisy heat flux traces returned by these simulations, we employ the simultaneous perturbation stochastic approximation (SPSA) method that only uses two objective function evaluations for a simple estimate of the gradient. We show several examples that optimize for both reduced heat fluxes and good quasi-symmetry as a proxy for low neoclassical transport. Finally, we run full transport simulations using the T3D stellarator transport code to evaluate the changes in the macroscopic profiles.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Coil optimization for quasi-helically symmetric stellarator configurations

Filament-based coil optimizations are performed for several quasi-helical stellarator configurations, beginning with the one from Landreman & Paul ( Phys. Rev. Lett. , vol. 128, 2022, 035001), demonstrating that precise quasi-helical symmetry can be achieved with realistic coils. Several constraints are placed on the shape and spacing of the coils, such as low curvature and sufficient plasma–coil distance for neutron shielding. The coils resulting from this optimization have a maximum curvature 0.8 times that of the coils of the Helically Symmetric eXperiment (HSX) and a mean squared curvature 0.4 times that of the HSX coils when scaled to the same plasma minor radius. When scaled up to reactor size and magnetic field strength, no fast particle losses were found in the free-boundary configuration when simulating 5000 alpha particles launched at $3.5\,\mathrm {MeV}$ on the flux surface with a normalized toroidal flux of $s=0.5$ . An analysis of the tolerance of the coils to manufacturing errors is performed using a Gaussian process model, and the coils are found to maintain low particle losses for smooth, large-scale errors up to amplitudes of approximately $0.15\,\mathrm {m}$ . Another coil optimization is performed for the Landreman–Paul configuration with the additional constraint that the coils are purely planar. Visual inspection of the Poincaré plot of the resulting magnetic field-lines reveal that the planar modular coils alone do a poor job of reproducing the target equilibrium. Additional non-planar coil optimizations are performed for the quasi-helical configuration with $5\,\%$ volume-averaged plasma beta from Landreman et al. ( Phys. Plasma , vol. 29, issue 8, 2022, 082501), and a similar configuration also optimized to satisfy the Mercier criterion. The finite beta configurations had larger fast-particle losses, with the free-boundary Mercier-optimized configuration performing the worst, losing approximately $5.5\,\%$ of alpha particles launched at $s=0.5$ .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Classical Optimal Control for Energy Minimization Based On Diffeomorphic Modulation under Observable-Response-Preserving Homotopy

In this work, we introduce the so-called “Classical Optimal Control Optimization” (COCO) method for global energy minimization based on the implementation of the diffeomorphic modulation under observable-response-preserving homotopy (DMORPH) gradient algorithm. A probe particle with time-dependent mass $m(t;β)$ and dipole $μ(r,t;β)$ is evolved classically on the potential energy surface $V(r)$ coupled to an electric field $E(t;β)$, as described by the time-dependent density of states represented on a grid, or otherwise as a linear combination of Gaussians generated by the k-means clustering algorithm. Control parameters $β$ defining $m(t;β), μ(r,t;β),$ and $E(t;β)$ are optimized by following the gradients of the energy with respect to $β,$ adapting them to steer the particle toward the global minimum energy configuration. We find that the resulting COCO algorithm is capable of resolving near-degenerate states separated by large energy barriers and successfully locates the global minima of golf potentials on flat and rugged surfaces, previously explored for testing quantum annealing methodologies and the quantum optimal control optimization (QuOCO) method. Preliminary results show successful energy minimization of multidimensional Lennard-Jones clusters. Beyond the analysis of energy minimization in the specific model systems investigated, we anticipate COCO should be valuable for solving minimization problems in general, including optimization of parameters in applications to machine learning and molecular structure determination.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast Bayesian optimization of Needle-in-a-Haystack problems using zooming memory-based initialization (ZoMBI)

Abstract Needle-in-a-Haystack problems exist across a wide range of applications including rare disease prediction, ecological resource management, fraud detection, and material property optimization. A Needle-in-a-Haystack problem arises when there is an extreme imbalance of optimum conditions relative to the size of the dataset. However, current state-of-the-art optimization algorithms are not designed with the capabilities to find solutions to these challenging multidimensional Needle-in-a-Haystack problems, resulting in slow convergence or pigeonholing into a local minimum. In this paper, we present a Zooming Memory-Based Initialization algorithm, entitled ZoMBI, that builds on conventional Bayesian optimization principles to quickly and efficiently optimize Needle-in-a-Haystack problems in both less time and fewer experiments. The ZoMBI algorithm demonstrates compute time speed-ups of 400× compared to traditional Bayesian optimization as well as efficiently discovering optima in under 100 experiments that are up to 3× more highly optimized than those discovered by similar methods.

36 MATERIALS SCIENCE↗

Closed-loop optimization of fast-charging protocols for batteries with machine learning

Simultaneously optimizing many design parameters in time-consuming experiments causes bottlenecks in a broad range of scientific and engineering disciplines. One such example is process and control optimization for lithium-ion batteries during materials selection, cell manufacturing and operation. A typical objective is to maximize battery lifetime; however, conducting even a single experiment to evaluate lifetime can take months to years. Furthermore, both large parameter spaces and high sampling variability necessitate a large number of experiments. As such, the key challenge is to reduce both the number and the duration of the experiments required. Here we develop and demonstrate a machine learning methodology to efficiently optimize a parameter space specifying the current and voltage profiles of six-step, ten-minute fast-charging protocols for maximizing battery cycle life, which can alleviate range anxiety for electric-vehicle users. We combine two key elements to reduce the optimization cost: an early-prediction model, which reduces the time per experiment by predicting the final cycle life using data from the first few cycles, and a Bayesian optimization algorithm, which reduces the number of experiments by balancing exploration and exploitation to efficiently probe the parameter space of charging protocols. Using this methodology, we rapidly identify high-cycle-life charging protocols among 224 candidates in 16 days (compared with over 500 days using exhaustive search without early prediction), and subsequently validate the accuracy and efficiency of our optimization approach. Our closed-loop methodology automatically incorporates feedback from past experiments to inform future decisions and can be generalized to other applications in battery design and, more broadly, other scientific domains that involve time-intensive experiments and multi-dimensional design spaces.

25 ENERGY STORAGE↗

GAHLS: an optimized graph analytics based high level synthesis framework

The urgent need for low latency, high-compute and low power on-board intelligence in autonomous systems, cyber-physical systems, robotics, edge computing, evolvable computing, and complex data science calls for determining the optimal amount and type of specialized hardware together with reconfigurability capabilities. With these goals in mind, we propose a novel comprehensive graph analytics based high level synthesis (GAHLS) framework that efficiently analyzes complex high level programs through a combined compiler-based approach and graph theoretic optimization and synthesizes them into message passing domain-specific accelerators. This GAHLS framework first constructs a compiler-assisted dependency graph (CaDG) from low level virtual machine (LLVM) intermediate representation (IR) of high level programs and converts it into a hardware friendly description representation. Next, the GAHLS framework performs a memory design space exploration while account for the identified computational properties from the CaDG and optimizing the system performance for higher bandwidth. The GAHLS framework also performs a robust optimization to identify the CaDG subgraphs with similar computational structures and aggregate them into intelligent processing clusters in order to optimize the usage of underlying hardware resources. Finally, the GAHLS framework synthesizes this compressed specialized CaDG into processing elements while optimizing the system performance and area metrics. Evaluations of the GAHLS framework on several real-life applications (e.g., deep learning, brain machine interfaces) demonstrate that it provides 14.27× performance improvements compared to state-of-the-art approaches such as LegUp 6.2.

97 MATHEMATICS AND COMPUTING↗

Market optimization and technoeconomic analysis of hydrogen-electricity coproduction systems

Decarbonization efforts across North America, Europe, and beyond rely on variable renewable energy sources such as wind and solar, as well as alternative fuels, such as hydrogen, to support the sustainable energy transition. These advancements have prompted a need for more flexibility in the electric grid to complement non-dispatchable energy sources and increased demand from electrification. Integrated energy systems are well suited to provide this flexibility, but conventional technoeconomic modeling paradigms neglect the time-varying dynamic nature of the grid and thus undervalue resource flexibility. In this work, we develop a computational optimization framework for dynamic market-based technoeconomic comparison of integrated energy systems that coproduce low-carbon electricity and hydrogen (e.g., solid oxide fuel cells, solid oxide electrolysis) against technologies that only produce electricity (e.g., natural gas combined cycle with carbon capture) or only produce hydrogen. Our framework starts with rigorous physics-based process models, built in the open-source Institute for the Design of Advanced Energy Systems (IDAES) modeling and optimization platform, for six energy process concepts. Using these rigorous models and a workflow to optimally design each technology, the framework is shown to be capable of evaluating new and emerging technologies in varying energy markets under a plethora of future scenarios (i.e., renewables penetration, carbon tax, etc.). Ultimately, our framework finds that solid oxide fuel cell-based coproduction systems achieve positive profits for 85% of the analyzed market scenarios. From these market optimization results, we use multivariate linear regression (R 2 values up to 0.99) to determine which electricity price statistics are most significant to predict the optimized annual profit of each system. The proposed framework provides a powerful tool for directly comparing flexible, multi-product energy process concepts to help discern optimal technology and integration options.

08 HYDROGEN↗

Optimization and calibration of atomic force microscopy sensitivity in terms of tip-sample interactions in high-order dynamic atomic force microscopy

The mechanism of dynamic force modes has been successfully applied to many atomic force microscopy (AFM) applications, such as tapping mode and phase imaging. The high-order flexural vibration modes are recent advancement of AFM dynamic force modes. AFM optical lever detection sensitivity plays a major role in dynamic force modes because it determines the accuracy in mapping surface morphology, distinguishing various tip-surface interactions, and measuring the strength of the tip-surface interactions. In this work, we have analyzed optimization and calibration of the optical lever detection sensitivity for an AFM cantilever-tip ensemble vibrating in high-order flexural modes and simultaneously experiencing a wide range and variety of tip-sample interactions. It is found that the optimal detection sensitivity depends on the vibration mode, the ratio of the force constant of tip-sample interactions to the cantilever stiffness, as well as the incident laser spot size and its location on the cantilever. It is also found that the optimal detection sensitivity is less dependent on the strength of tip-sample interactions for high-order flexural modes relative to the fundamental mode, i.e., tapping mode. When the force constant of tip-sample interactions significantly exceeds the cantilever stiffness, the optimal detection sensitivity occurs only when the laser spot locates at a certain distance from the cantilever-tip end. Thus, in addition to the 'globally optimized detection sensitivity', the 'tip optimized detection sensitivity' is also determined. Finally, we have proposed a calibration method to determine the actual AFM detection sensitivity in high-order flexural vibration modes against the static end-load sensitivity that is obtained traditionally by measuring a force-distance curve on a hard substrate in the contact mode.

36 MATERIALS SCIENCE↗

Optimized coordinates in vibrational coupled cluster calculations

The use of variationally optimized coordinates, which minimize the vibrational self-consistent field (VSCF) ground state energy with respect to orthogonal transformations of the coordinates, has recently been shown to improve the convergence of vibrational configuration interaction (VCI) towards the exact full VCI [K. Yagi, M. Keçeli, and S. Hirata, J. Chem. Phys. 137, 204118 (2012)]. The present paper proposes an incorporation of optimized coordinates into the vibrational coupled cluster (VCC), which has in the past been shown to outperform VCI in approximate calculations where similar restricted state spaces are employed in VCI and VCC. An embarrassingly parallel algorithm for variational optimization of coordinates for VSCF is implemented and the resulting coordinates and potentials are introduced into a VCC program. The performance of VCC in optimized coordinates (denoted oc-VCC) is examined through pilot applications to water, formaldehyde, and a series of water clusters (dimer, trimer, and hexamer) by comparing the calculated vibrational energy levels with those of the conventional VCC in normal coordinates and VCI in optimized coordinates. For water clusters, in particular, oc-VCC is found to gain orders of magnitude improvement in the accuracy, exemplifying that the combination of optimized coordinates localized to each monomer with the size-extensive VCC wave function provides a supreme description of systems consisting of weakly interacting sub-systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Minimum time optimal synthesis for two level quantum systems

For the time optimal problem of an invariant system on SU(2), with two independent controls and a bound on the norm of the control, the extremals of the Pontryagin maximum principle are explicit functions of time. We use this fact here to perform the optimal synthesis for these systems, i.e., to find all time optimal trajectories. Although the Lie group SU(2) is three dimensional, time optimal trajectories can be described in the unit disk of the complex plane. We find that a circular trajectory separates optimal trajectories that reach the boundary of the unit disk from the others. Inside this separatrix circle, another trajectory (the critical trajectory) plays an important role in that all optimal trajectories end at an intersection with this curve. The results allow us to find the minimum time needed to achieve a given evolution of a two level quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Proposed design and optimization of a higher harmonic cavity for ALS-U

Higher harmonic cavities (HHCs), also known as Landau cavities, have been proposed to increase the beam lifetime and Landau damping by lengthening the bunch and increasing the synchrotron tune spread. Here, we present an optimized 1.5 GHz normal conducting HHC design for the Advanced Light Source Upgrade project at Lawrence Berkeley National Lab with a superconducting-like geometry for lower R/Q. The optimization goal is to reach the required shunt impedance while maintaining a relatively high Q value of the cavities. A multi-objective genetic algorithm (MOGA)-based optimization process is applied to optimize the radio frequency (RF) design. This study serves as an example of how a genetic algorithm can be used to optimize RF cavities. Detailed exploration and characterization of the MOGA-based RF cavity optimization have been demonstrated from the aspects of minimizing the coupled bunch instabilities and analyzing the higher-order modes and the corresponding impedance of the HHC.

Feng, H. (ORCID:0000000319392692)↗

Computational optimal transport for molecular spectra: The semi-discrete case

Comparing a discrete molecular spectrum to a continuous molecular spectrum in a quantitative manner is a challenging problem, for example, when attempting to fit a theoretical stick spectrum to a continuous spectrum. In this paper, the use of computational optimal transport is investigated for such a problem. In the optimal transport literature, the comparison of a discrete and a continuous spectrum is referred to as semi-discrete optimal transport and is a situation where a metric such as least-squares may be difficult to define except under special conditions. The merits of an optimal transport approach for this problem are investigated using the transport distance defined for the semi-discrete case. A tutorial on semi-discrete optimal transport for molecular spectra is included in this paper, and several well-chosen synthetic spectra are investigated to demonstrate the utility of computational optimal transport for the semi-discrete case. Among several types of investigations, we include calculations showing how the frequency resolution of the continuous spectrum affects the transport distance between a discrete and a continuous spectrum. We also use the transport distance to measure the distance between a continuous experimental electronic absorption spectrum of SO 2 and a theoretical stick spectrum for the same system. The comparison of the theoretical and experimental SO 2 spectra also allows us to suggest a theoretical value for the band origin that is closer to the observed band origin than previous theoretical values.

74 ATOMIC AND MOLECULAR PHYSICS↗

Optimization of transformer ratio and beam loading in a plasma wakefield accelerator with a structure-exploiting algorithm

Plasma-based acceleration has emerged as a promising candidate as an accelerator technology for a future linear collider or a next-generation light source. We consider the plasma wakefield accelerator (PWFA) concept where a plasma wave wake is excited by a particle beam and a trailing beam surfs on the wake. For a linear collider, the energy transfer efficiency from the drive beam to the wake and from the wake to the trailing beam must be large, while the emittance and energy spread of the trailing bunch must be preserved. One way to simultaneously achieve this when accelerating electrons is to use longitudinally shaped bunches and nonlinear wakes. In the linear regime, there is an analytical formalism to obtain the optimal shapes. In the nonlinear regime, however, the optimal shape of the driver to maximize the energy transfer efficiency cannot be precisely obtained because currently no theory describes the wake structure and excitation process for all degrees of nonlinearity. In addition, the ion channel radius is not well defined at the front of the wake where the plasma electrons are not fully blown out by the drive beam. We present results using a novel optimization method to effectively determine a current profile for the drive and trailing beam in PWFA that provides low energy spread, low emittance, and high acceleration efficiency. We parameterize the longitudinal beam current profile as a piecewise-linear function and define optimization objectives. For the trailing beam, the algorithm converges quickly to a nearly inverse trapezoidal trailing beam current profile similar to that predicted by the ultrarelativistic limit of the nonlinear wakefield theory. For the drive beam, the beam profile found by the optimization in the nonlinear regime that maximizes the transformer ratio also resembles that predicted by linear theory. Furthermore, the current profiles found from the optimization method provide higher transformer ratios compared with the linear ramp predicted by the relativistic limit of the nonlinear theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Near-optimal protocols in complex nonequilibrium transformations

Significance Classical thermodynamics was developed to help design the best protocols for operating heat engines that remain close to equilibrium at all times. Modern experimental techniques for manipulating microscopic and mesoscopic systems routinely access far-from-equilibrium states, demanding new theoretical tools to describe the optimal protocols in this more complicated regime. Prior studies have sought, in simple models, the protocol that minimizes dissipation. We use computational tools to investigate the diversity of low-dissipation protocols. We show that optimal protocols can be accompanied by a vast set of near-optimal protocols, which still offer the substantive benefits of the optimal protocol. Although solving for the optimal protocol is typically difficult, computationally identifying a near-optimal protocol can be comparatively easy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗

ReMU: regional minimal updating for model-based derivative-free optimization

Derivative-free optimization (DFO) problems are optimization problems where derivative information is unavailable or extremely difficult to obtain. Model-based DFO solvers have been applied extensively in scientific computing. Powell's NEWUOA (2004) [Powell, The NEWUOA software for unconstrained optimization without derivatives, in Large-Scale Nonlinear Optimization, Nonconvex Optimization and its Applications Vol. 83, G. Di Pillo and M. Roma, eds., Springer, 2006, pp. 255–297] and Wild's POUNDerS (2014) [Wild, Solving derivative-free nonlinear least squares problems with POUNDERS, in Advances and Trends in Optimization with Engineering Applications, T. Terlaky, M.F. Anjos, and S. Ahmed, eds., SIAM, 2017, pp. 529–540] explore the numerical power of the minimal norm Hessian (MNH) model for DFO and contributed to the open discussion on building better models with fewer data to achieve faster numerical convergence. Another decade later, we propose the regional minimal updating (ReMU) models, and extend the previous models into a broader class, including the H 2 norm models [Xie and Yuan, Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms, IMA J. Numer. Anal. 46 (2025), pp. 21–50]. This paper shows motivation behind ReMU models, computational details, theoretical and numerical results on particular extreme points and the barycentre of ReMU's weight coefficient region, and the associated KKT matrix error and distance. Novel metrics, such as the truncated Newton step error, are proposed to numerically understand the new models' properties. A new algorithmic strategy, based on iteratively adjusting the ReMU model type, is also proposed, and shows numerical advantages by combining and switching between the barycentric model and the classic least Frobenius norm model in an online fashion.

derivative-free trust-region methods↗

Development of near-optimal advanced control sequences for chiller plants with water-side economizers in U.S. Climates (ASHRAE RP-1661)

Various advanced control sequences for chiller plants with water-side economizers (WSE) have been proposed in literature, but the evaluation and optimization of those controls is limited. It is possible to maximize energy savings by selecting different sequences and related parameters based on the plant configuration, load, and climate. This paper addresses this gap by developing near-optimal advanced control sequences for chiller plants with WSEs. First, advanced control sequences for chiller plants with WSEs are categorized into condenser water, chilled water, and hybrid controls and representative sequences from each category are identified. Next, 504 different scenarios are optimized. These scenarios represent all possible combinations of two plant configurations, a constant or variable load profile, three advanced control sequences, and seven optimization parameter combinations in six climate zones. The results show the recommended near-optimal sequences can reduce energy consumption by up to 15% relative to the baseline depending on the configuration, load profile, and climate. Specifically, the CW-CHW sequence is recommended for the majority of systems because it is often the most energy efficient and/or reduces the runtime of chillers. The methodology in this paper provides practical guidance for achieving energy savings through near-optimal control of chiller plants with WSEs.

42 ENGINEERING↗

Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems

We develop a framework for goal-oriented optimal design of experiments (GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This framework differs from classical Bayesian optimal design of experiments (ODE) in the following sense: we seek experimental designs that minimize the posterior uncertainty in the experiment end-goal, e.g. a quantity of interest (QoI), rather than the estimated parameter itself. This is suitable for scenarios in which the solution of an inverse problem is an intermediate step and the estimated parameter is then used to compute a QoI. In such problems, a GOODE approach has two benefits: the designs can avoid wastage of experimental resources by a targeted collection of data, and the resulting design criteria are computationally easier to evaluate due to the often low-dimensionality of the QoIs. We present two modified design criteria, A-GOODE and D-GOODE, which are natural analogues of classical Bayesian A- and D-optimal criteria. We analyze the connections to other ODE criteria, and provide interpretations for the GOODE criteria by using tools from information theory. Then, we develop an efficient gradient-based optimization framework for solving the GOODE optimization problems. Additionally, we present comprehensive numerical experiments testing the various aspects of the presented approach. The driving application is the optimal placement of sensors to identify the source of contaminants in a diffusion and transport problem. As a result, we enforce sparsity of the sensor placements using an L1-norm penalty approach, and propose a practical strategy for specifying the associated penalty parameter.

97 MATHEMATICS AND COMPUTING↗