Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization algorithms”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Drive-pressure optimization in ramp-wave compression experiments through differential evolution

Ramp-wave dynamic-compression experiments are used to examine quasi-isentropic loading paths in materials. The gradual and continuous increase in pressure created by ramp waves make these types of experiments ideal for studying nonequilibrium material behavior, such as solidification kinetics. In ramp-wave compression experiments, the input drive pressure to the experimental setup may be exerted through one of a number of different mechanisms (e.g., magnetic fields, gas-gun-driven impactors, or high-energy lasers) and is generally required for simulating such experiments. Yet, regardless of the specific mechanism, this drive pressure cannot be measured directly (measurements are generally taken at a location near the back of the experimental setup through a transparent window), leading to an inverse problem where one must determine the drive pressure at the front of the experimental setup (i.e., the input) that corresponds to the particle velocity (the output) measured near the back of the experimental setup. Furthermore, we solve this inverse problem using a heuristic optimization algorithm, known as differential evolution, coupled with a multiphysics, hydrodynamics code that simulates the compression of the experimental setup. By running many rounds of forward simulations of the experimental setup, our optimization process iteratively searches for a drive pressure that is optimized to closely reproduce the experimentally measured particle velocity near the back of the experimental setup. While our optimization methodology requires a significant number of hydrodynamics simulations to be conducted, many of these can be performed in parallel, which greatly reduces the time cost of our methodology. One novel aspect of our method for determining the drive pressure is that it does not require physical modeling of the drive mechanism and can thus be broadly applied to many types of ramp-compression experiments, regardless of the drive mechanism.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer

Abstract Realizing the potential of near-term quantum computers to solve industry-relevant constrained-optimization problems is a promising path to quantum advantage. In this work, we consider the extractive summarization constrained-optimization problem and demonstrate the largest-to-date execution of a quantum optimization algorithm that natively preserves constraints on quantum hardware. We report results with the Quantum Alternating Operator Ansatz algorithm with a Hamming-weight-preserving XY mixer (XY-QAOA) on trapped-ion quantum computer. We successfully execute XY-QAOA circuits that restrict the quantum evolution to the in-constraint subspace, using up to 20 qubits and a two-qubit gate depth of up to 159. We demonstrate the necessity of directly encoding the constraints into the quantum circuit by showing the trade-off between the in-constraint probability and the quality of the solution that is implicit if unconstrained quantum optimization methods are used. We show that this trade-off makes choosing good parameters difficult in general. We compare XY-QAOA to the Layer Variational Quantum Eigensolver algorithm, which has a highly expressive constant-depth circuit, and the Quantum Approximate Optimization Algorithm. We discuss the respective trade-offs of the algorithms and implications for their execution on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A simple introduction to the SiMPL method for density-based topology optimization

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as “the simple method”) optimizes a design using only first-order derivative information of the objective function. The bound constraints on the density field are enforced with the help of the (negative) Fermi–Dirac entropy, which is also used to define a non-symmetric distance function called a Bregman divergence on the set of admissible designs. This Bregman divergence leads to a simple update rule that is further simplified with the help of a so-called latent variable. Because the SiMPL method involves discretizing the latent variable, it produces a sequence of pointwise-feasible iterates, even when high-order finite elements are used in the discretization. Numerical experiments demonstrate that the method outperforms other popular first-order optimization algorithms. In conclusion, to outline the general applicability of the technique, we include examples with (self-load) compliance minimization and compliant mechanism optimization problems.

Calculus of Variations and Optimization↗
DOE OSTI2021

Machine-learning accelerated geometry optimization in molecular simulation

Geometry optimization is an important part of both computational materials and surface science because it is the path to finding ground state atomic structures and reaction pathways. These properties are used in the estimation of thermodynamic and kinetic properties of molecular and crystal structures. This process is slow at the quantum level of theory because it involves an iterative calculation of forces using quantum chemical codes such as density functional theory (DFT), which are computationally expensive and which limit the speed of the optimization algorithms. It would be highly advantageous to accelerate this process because then one could do either the same amount of work in less time or more work in the same time. Here, we provide a neural network (NN) ensemble based active learning method to accelerate the local geometry optimization for multiple configurations simultaneously. We illustrate the acceleration on several case studies including bare metal surfaces, surfaces with adsorbates, and nudged elastic band for two reactions. In all cases, the accelerated method requires fewer DFT calculations than the standard method. In addition, we provide an Atomic Simulation Environment (ASE)-optimizer Python package to make the usage of the NN ensemble active learning for geometry optimization easier.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Multimodal parameter spaces of a complex multi-channel neuron model

One of the most common types of models that helps us to understand neuron behavior is based on the Hodgkin–Huxley ion channel formulation (HH model). A major challenge with inferring parameters in HH models is non-uniqueness: many different sets of ion channel parameter values produce similar outputs for the same input stimulus. Such phenomena result in an objective function that exhibits multiple modes (i.e., multiple local minima). This non-uniqueness of local optimality poses challenges for parameter estimation with many algorithmic optimization techniques. HH models additionally have severe non-linearities resulting in further challenges for inferring parameters in an algorithmic fashion. To address these challenges with a tractable method in high-dimensional parameter spaces, we propose using a particular Markov chain Monte Carlo (MCMC) algorithm, which has the advantage of inferring parameters in a Bayesian framework. The Bayesian approach is designed to be suitable for multimodal solutions to inverse problems. We introduce and demonstrate the method using a three-channel HH model. We then focus on the inference of nine parameters in an eight-channel HH model, which we analyze in detail. We explore how the MCMC algorithm can uncover complex relationships between inferred parameters using five injected current levels. The MCMC method provides as a result a nine-dimensional posterior distribution, which we analyze visually with solution maps or landscapes of the possible parameter sets. The visualized solution maps show new complex structures of the multimodal posteriors, and they allow for selection of locally and globally optimal value sets, and they visually expose parameter sensitivities and regions of higher model robustness. We envision these solution maps as enabling experimentalists to improve the design of future experiments, increase scientific productivity and improve on model structure and ideation when the MCMC algorithm is applied to experimental data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fast Gaussian Process Prediction with MuyGPs

This code provides fast Gaussian process prediction algorithms based on the MuyGPs scalable hyperparameter optimization algorithm. This code is the companion to a research paper preprint soon to be made publicly available.

Priest, BenjaminW↗
DOE OSTI2022

INITIAL EXPLORATION OF A NOVEL TRANSIENT ARREST SYSTEM INVOLVING FUEL HEATING

A preliminary analysis on a novel accident response system to diminish the severity of supercritical transients was conducted. The novel accident response system, called the instant shock arrest system, involves using electricity to heat the nuclear fuel at the onset of a large accidental reactivity insertion. This system is specifically designed for reactors with metallic fuel, such that the fuel is capable of conducting electricity, and being resistively heated. A reactor dynamics model of the advanced test reactor was created using the point kinetics equations and a linear reactivity feedback model to simulate how the system would effect the maximum fuel temperatures experienced during the transient. Transients with the instant shock arrest system were compare to those without it. It was found that the instant shock arrest system initially heated the fuel more than the unaffected transient but the negative reactivity inserted from such heating was enough to lower the maximum fuel temperature experienced during the transient. After simulating six different accident scenarios with reactivity insertions ranging from 0.5 \$ to 1.3 \$, it was found that the an optimal system response could reduce peak fuel temperatures during the transient by 3.5\% to 5\%. Furthermore, discussion was given on how the optimal system response could be obtained using relatively simple numerical optimization algorithms due to the smoothness of the optimization problem.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Performance and Cost Potential for Direct-Fired Supercritical CO2 Natural Gas Power Plants

Direct-fired supercritical CO2 (sCO2) power cycles are being explored as an attractive alternative to natural gas combined cycle (NGCC) plants with carbon capture and storage (CCS). Therefore, understanding their performance and cost potential is important for the commercialization of the technology. This study presents the techno-economic optimization results of natural gas-fired, utility-scale power plants based on the direct sCO2 power cycle, which are lacking in public literature. To identify the optimum plant configuration, the study considered multiple cases with varying levels of thermal integration with the plant air separation unit (ASU). Several design variables for each power cycle configuration were identified and optimized to minimize the levelized cost of electricity (LCOE) for each case. The optimization design variables include the sCO2 cooler outlet temperatures, recuperator approach temperatures, and pressure drops. High fidelity models for recuperators, coolers, and turbines were developed and used to capture the impact of design variables on plant efficiency and capital costs. The optimization was conducted using a combination of manual sensitivity analyses and automated derivative-free optimization algorithms available under NETL’s Framework for Optimization and Quantification of Uncertainty and Sensitivity platform. The optimized direct sCO2 power plants offered similar or slightly higher plant efficiencies than the reference NGCC plants based on the F-class gas turbine with CCS. The LCOE of the optimized direct sCO2 plants is 13 to 17% higher than the reference NGCC plants with CCS due to high capital costs associated with the ASU and sCO2 power block, though there is significant room for improvement due to the high uncertainty in component capital costs for these new plants. Recuperators make up over 50% of the sCO2 power block costs. Consequently, any research and development efforts to reduce the recuperator capital costs will benefit the technology’s commercialization. The study also presents preliminary results showing the impact of co-firing landfill gas and natural gas on plant efficiency, LCOE, and CO2 emissions.

Pidaparti, Sandeep↗
DOE OSTI2023

Performance and Cost Potential for Direct-Fired Supercritical CO2 Natural Gas Power Plants

Direct-fired supercritical CO2 (sCO2) power cycles are being explored as an attractive alternative to natural gas combined cycle (NGCC) plants with carbon capture and storage (CCS). Therefore, understanding their performance and cost potential is important for the commercialization of the technology. This study presents the techno-economic optimization results of natural gas-fired, utility-scale power plants based on the direct sCO2 power cycle, which are lacking in public literature. To identify the optimum plant configuration, the study considered multiple cases with varying levels of thermal integration with the plant air separation unit (ASU). Several design variables for each power cycle configuration were identified and optimized to minimize the levelized cost of electricity (LCOE) for each case. The optimization design variables include the sCO2 cooler outlet temperatures, recuperator approach temperatures, and pressure drops. High fidelity models for recuperators, coolers, and turbines were developed and used to capture the impact of design variables on plant efficiency and capital costs. The optimization was conducted using a combination of manual sensitivity analyses and automated derivative-free optimization algorithms available under NETL’s Framework for Optimization and Quantification of Uncertainty and Sensitivity platform. The optimized direct sCO2 power plants offered similar or slightly higher plant efficiencies than the reference NGCC plants based on the F-class gas turbine with CCS. The LCOE of the optimized direct sCO2 plants is 13 to 17% higher than the reference NGCC plants with CCS due to high capital costs associated with the ASU and sCO2 power block, though there is significant room for improvement due to the high uncertainty in component capital costs for these new plants. Recuperators make up over 50% of the sCO2 power block costs. Consequently, any research and development efforts to reduce the recuperator capital costs will benefit the technology’s commercialization. The study also presents preliminary results showing the impact of co-firing landfill gas and natural gas on plant efficiency, LCOE, and CO2 emissions.

Pidaparti, Sandeep↗
DOE OSTI2022

Initial exploration of a novel transient arrest system involving fuel heating

A preliminary analysis on a novel accident response system to diminish the severity of super- critical transients was conducted. The novel accident response system, called the instant shock arrest system, involves using electricity to heat the nuclear fuel at the onset of a large accidental reactivity insertion. This system is specifically designed for reactors with metallic fuel, such that the fuel is capable of conducting electricity, and being resistively heated. A reactor dynamics model of the advanced test reactor was created using the point kinetics equations and a linear reactivity feedback model to simulate how the system would effect the maximum fuel temperatures experienced during the transient. Transients with the instant shock arrest system were compared to those without it. It was found that the instant shock arrest system initially heated the fuel more than the unaffected transient but the negative reactivity inserted from such heating was enough to lower the maximum fuel temperature experienced during the transient. After simulating six different accident scenarios with reactivity insertions ranging from 0.5 to 1.3 dollar, it was found that an optimal system response could reduce peak fuel temperatures during the transient by 3.5% to 5%. Furthermore, discussion was given on how the optimal system response could be obtained using relatively simple numerical optimization algorithms due to the smoothness of the optimization problem. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

INITIAL EXPLORATION OF A NOVEL TRANSIENT ARREST SYSTEM INVOLVING FUEL HEATING (Presentation)

A preliminary analysis on a novel accident response system to diminish the severity of supercritical transients was conducted. The novel accident response system, called the instant shock arrest system, involves using electricity to heat the nuclear fuel at the onset of a large accidental reactivity insertion. This system is specifically designed for reactors with metallic fuel, such that the fuel is capable of conducting electricity, and being resistively heated. A reactor dynamics model of the advanced test reactor was created using the point kinetics equations and a linear reactivity feedback model to simulate how the system would effect the maximum fuel temperatures experienced during the transient. Transients with the instant shock arrest system were compare to those without it. It was found that the instant shock arrest system initially heated the fuel more than the unaffected transient but the negative reactivity inserted from such heating was enough to lower the maximum fuel temperature experienced during the transient. After simulating six different accident scenarios with reactivity insertions ranging from 0.5 \$ to 1.3 \$, it was found that the an optimal system response could reduce peak fuel temperatures during the transient by 3.5% to 5%. Furthermore, discussion was given on how the optimal system response could be obtained using relatively simple numerical optimization algorithms due to the smoothness of the optimization problem.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems

We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.

3-SAT↗
DOE OSTI2022

An overview of the operation architectures and energy management system for multiple microgrid clusters

The emerging novel energy infrastructures, such as energy communities, smart building-based microgrids, electric vehicles enabled mobile energy storage units raise the requirements for a more interconnective and interoperable energy system. It leads to a transition from simple and isolated microgrids to relatively large-scale and complex interconnected microgrid systems named multi-microgrid clusters. In order to efficiently, optimally, and flexibly control multi-microgrid clusters, cross-disciplinary technologies such as power electronics, control theory, optimization algorithms, information and communication technologies, cyber-physical, and big-data analysis are needed. This paper introduces an overview of the relevant aspects for multi-microgrids, including the outstanding features, architectures, typical applications, existing control mechanisms, as well as the challenges.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Online multi-objective particle accelerator optimization of the AWAKE electron beam line for simultaneous emittance and orbit control

Multi-objective optimization is important for particle accelerators where various competing objectives must be satisfied routinely such as, for example, transverse emittance vs bunch length. We develop and demonstrate an online multi-time scale multi-objective optimization algorithm that performs real time feedback on particle accelerators. We demonstrate the ability to simultaneously minimize the emittance and maintain a reference trajectory of a beam in the electron beamline in CERN’s Advanced Proton Driven Plasma Wakefield Acceleration Experiment.

43 PARTICLE ACCELERATORS↗