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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Optimal band selection for target detection with a LWIR multispectral imager

Multispectral imaging can offer many benefits in cost, complexity, resolution, size, weight, and power, relative to hyperspectral imaging. When designing a multispectral system, spectral bandpasses can be selected using optimization algorithms configured to maximally separate target detection scores between target and background regions. A hyperspectral image (HSI) can serve as the source of data from which band groupings can be tested for optimality. The output of an adaptive cosine estimator target detection algorithm is used in an objective function. Three optimization algorithms are compared: particle swarm, dual annealing, and differential evolution. A global optimum is also found using a brute force approach on the Livermore Computing Syrah supercomputer. Three materials are investigated: calcite, gypsum, and limestone. This is done for 3-, 4-, and 5-band systems. The data originate from a longwave infrared HSI of a material display board. The optimization algorithms were run 30 times for every scenario. Performance statistics (maximum, minimum, mean, standard deviation, and median) based on the separation values are given. Additional characterization was performed using receiver operator characteristic (ROC) curves and the area under the ROC curve. While good performance was obtained for the three optimization algorithms, the dual annealing algorithm produced the highest and most consistent detection separation scores on average.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

A modular GUI-based program for genetic algorithm-based feedback-assisted wavefront shaping

Abstract We have developed a modular graphical user interface (GUI)-based program for use in genetic algorithm-based feedback-assisted wavefront shaping. The program uses a class-based structure to separate out the universal modules (e.g. GUI, multithreading, optimization algorithms) and hardware-specific modules (e.g. code for different SLMs and cameras). This modular design makes the program easily adaptable to a wide range of lab equipment, while providing easy access to a GUI, multithreading, and three optimization algorithms (phase-stepping, simple genetic, and microgenetic).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗
DOE OSTI2025

Extreme Longitudinal Compression of Optimized Beams for MEV Ultrafast Electron Diffraction (Final Technical Report)

We worked out the design of a high repetition rate MeV energy ultrafast electron diffraction instrument based on the existing Cornell photoinjector, which can readily be applied to the presented findings. This example is a blueprint of other similarly arranged UED setups. Using particle tracking simulations in conjunction with multiobjective genetic algorithm optimization, we explored the smallest bunch lengths, emittance, and probe spot sizes achievable. As two limits, we defined stroboscopic conditions (with single electrons per pulse) and operation with 10 5 electrons per bunch which may be suitable for single-shot diffraction images. In the stroboscopic case, the flexibility provided by the many cavity bunching and acceleration allows for longitudinal phase space linearization without a higher harmonic field, providing sub-fs bunch lengths at the sample. Given low emittance photoemission conditions, these small bunch lengths can be maintained with probe transverse sizes at the single micron (1 μm) scale and below. In the case of 10 5 electrons per pulse, we simulated state-of-the-art 5D brightness conditions: rms bunch lengths of 10 fs with 3-nm normalized emittances, while permitting repetition rates as high as 1.3 GHz. We showed that in conjunction with collimating apertures, a novel focusing scheme achieves very high-quality emittance compensation for the central core of the beam composing 40% of particles, for a resulting beam size of 5 μm (rms). Finally, to aid in the design of new SRF-based ultrafast electron diffraction machines, we simulated the trade-off between the number of cavities used and achievable bunch length and emittance. In the longitudinal dimension, we made use of the fact that MeV UED requires much lower energy than the 15-MeV maxi mum energy of Cornell’s CBETA injector, and we may therefore use several of the SRF cavities for bunch length compression. In practice, we used a genetic optimization algorithm to choose the phases and amplitudes of the cavities appropriately for optimal bunching. In the zero space charge case, we found that bunching and acceleration are distributed across the six cavities in a way that produces a linearizing effect. And we showed that the ultimate bunch length can be limited by time-of-flight differences arising from transverse size and transverse momentum spread. The space charge code developed and used for this development is now permanent part of the Bmad accelerator simulation code and has already contributed to other developments, e.g., for the EIC electron cooler design.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Leveraging prior mean models for faster Bayesian optimization of particle accelerators

Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.

43 PARTICLE ACCELERATORS↗
DOE OSTI2020

Assessing Historical Variability of South Asian Monsoon Lows and Depressions With an Optimized Tracking Algorithm

Abstract Cyclonic low‐pressure systems (LPS) produce abundant rainfall in South Asia, where they are traditionally categorized as monsoon lows, monsoon depressions, and more intense cyclonic storms. The India Meteorological Department (IMD) has tracked monsoon depressions for over a century, finding a large decline in their number in recent decades, but their methods have changed over time and do not include monsoon lows. This study presents a fast, objective algorithm for identifying monsoon LPS and uses it to assess interannual variability and trends in reanalyses. Variables and thresholds used in the algorithm are selected to best match a subjectively analyzed LPS data set while minimizing disagreement between four reanalyses in a training period. The stream function of 850 hPa horizontal wind is found to be optimal in this sense; it is less noisy than vorticity and represents the complete nondivergent wind, even when flow is not geostrophic. Using this algorithm, LPS statistics are computed for five reanalyses, and none show a detectable trend in monsoon depression counts since 1979. Both the Japanese 55‐year Reanalysis (JRA‐55) and the IMD data set show a step‐like reduction in depression counts when they began using geostationary satellite data, in 1979 and 1982, respectively; the 1958–2018 linear trend in JRA‐55, however, is smaller than in the IMD data set, and its error bar includes 0. There are more LPS in seasons with above‐average monsoon rainfall and in La Niña years, but few other large‐scale modes of interannual variability are found to modulate LPS counts, lifetimes, or track length consistently across reanalyses.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Xopt and Badger: a machine learning ecosystem for real-time accelerator control and optimization

Machine learning (ML)-based black-box optimization algorithms have demonstrated significant improvements in accelerator optimization speed, often by orders of magnitude. However, deploying these algorithms in real-time facility control remains challenging due to the specialized expertise and infrastructure required. To bridge this gap, we introduce the Xopt ecosystem, a versatile suite of tools designed to make advanced ML-based optimization accessible to the broader accelerator community. This ecosystem includes Xopt, a modular Python framework that facilitates the integration of ML-based optimization algorithms with arbitrary control problems, and Badger, a graphical user interface built on top of Xopt, which enables seamless deployment of ML algorithms in real-time control systems. The Xopt ecosystem has been successfully applied towards solving challenging real-time control problems at leading international accelerator facilities, including SLAC, LBNL, Argonne, Fermilab, BNL, DESY, and ESRF, demonstrating its effectiveness in real-world optimization tasks. In this presentation, we provide an overview of Xopt’s capabilities and illustrate its impact through case studies from SLAC accelerator facilities including LCLS, LCLS-II, and FACET-II.

Roussel, Ryan [SLAC]↗
DOE OSTI2021

Inference of neutrino flavor evolution through data assimilation and neural differential equations

The evolution of neutrino flavor in dense environments such as core-collapse supernovae and binary compact object mergers constitutes an important and unsolved problem. Its solution has potential implications for the dynamics and heavy-element nucleosynthesis in these environments. In this paper, we build upon recent work to explore inference-based techniques for the estimation of model parameters and neutrino flavor evolution histories. Here, we combine data assimilation, ordinary differential equation solvers, and neural networks to craft an inference approach tailored for nonlinear dynamical systems. Using this architecture, and a simple two-neutrino-beam, two-flavor model, we compare the performances of nine different optimization algorithms and expand upon previous assessments of the efficacy of inference for tackling problems in flavor evolution. We find that employing this new architecture, together with evolutionary optimization algorithms, accurately captures flavor histories in the small-scale model and allows us to quickly explore both model parameters and initial flavor content. In future work we plan to extend these inference techniques to large numbers of neutrinos.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗
DOE OSTI2023

Direct stellarator coil optimization for nested magnetic surfaces with precise quasi-symmetry

We present a robust optimization algorithm for the design of electromagnetic coils that generate vacuum magnetic fields with nested flux surfaces and precise quasi-symmetry. The method is based on a bilevel optimization problem, where the outer coil optimization is constrained by a set of inner least squares optimization problems whose solutions describe magnetic surfaces. The outer optimization objective targets coils that generate a field with nested magnetic surfaces and good quasi-symmetry. The inner optimization problems identify magnetic surfaces when they exist, and approximate surfaces in the presence of magnetic islands or chaos. We show that this formulation can be used to heal islands and chaos, thus producing coils that result in magnetic fields with precise quasi-symmetry. We show that the method can be initialized with coils from the traditional two-stage coil design process, as well as coils from a near-axis expansion optimization. We present a numerical example where island chains are healed and quasi-symmetry is optimized up to surfaces with aspect ratio 6. Another numerical example illustrates that the aspect ratio of nested flux surfaces with optimized quasi-symmetry can be decreased from 6 to approximately 4. In conclusion, the last example shows that our approach is robust and a cold-start using coils from a near-axis expansion optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flow

With the increasing penetration of distributed energy resources, distributed optimization algorithms have attracted significant attention for power systems applications due to their potential for superior scalability, privacy, and robustness to a single point-of-failure. The Alternating Direction Method of Multipliers (ADMM) is a popular distributed optimization algorithm; however, its convergence performance is highly dependent on the selection of penalty parameters, which are usually chosen heuristically. In this work, we use reinforcement learning (RL) to develop an adaptive penalty parameter selection policy for alternating current optimal power flow (ACOPF) problem solved via ADMM with the goal of minimizing the number of iterations until convergence. We train our RL policy using deep Q-learning and show that this policy can result in significantly accelerated convergence (up to a 59% reduction in the number of iterations compared to existing, curvatureinformed penalty parameter selection methods). Furthermore, we show that our RL policy demonstrates promise for generalizability, performing well under unseen loading schemes as well as under unseen losses of lines and generators (up to a 50% reduction in iterations). This work thus provides a proof-of-concept for using RL for parameter selection in ADMM for power systems applications.

alternating current optimal power flow↗
DOE OSTI2022

A modified model parametrization algorithm for solving a special type of heat and mass transfer systems

A new method for solving nonlinear heat and mass transfer design tasks was considered. Systems using the Number of Transfer Units (NTU) method are a special type of mathematical model of heat and mass exchangers. It was observed, that the NTU models in a form of differential-algebraic equations (DAEs) cannot be directly solved with higher values of NTU. The requirements for consistent initial conditions, as well as numerical limitations of DAEs solvers, result, that the solution to the considered design problems that cannot be obtained by a classical direct shooting procedure. To overcome the presented difficulties, the αDAE model optimization algorithm was adjusted for solving NTU-based models. The new approach consists of 3 main steps: 1) task discretization by a multiple-shooting approach, 2) design an appropriate function $f_{NTU}$(α) to effectively influence the variability of the state variables described by dynamical relations, 3) the iterative numerical optimization algorithm for the new parametrized system. Moreover, computations can be performed by a chosen numerical optimization approach, which can be communicated with an available outer procedure for solving differential-algebraic equations. The presented algorithm was implemented and applied to solve the design task with the NTU model of a counter-flow exchanger. Here, the new approach was used to modify the system dynamics to influence the difficulty of the considered problem. Finally, the presented method enabled failure-free numerical computations for the higher values of the NTU parameter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Geometry-independent microstructure optimization for electron beam powder bed fusion additive manufacturing

The ability to manipulate the formation of microstructure is one of the potential advantages of additive manufacturing. Yet, the additive manufacturing process is riddled with complex interactions between processing parameters, geometry, and spot melting sequence which makes the task of controlling microstructure challenging. This paper proposes a method to solve the microstructure texture optimization problem by leveraging established optimization techniques and increasingly fast and accurate analytical heat transfer models. Respectively, we apply two different optimization algorithms, genetic algorithm and concurrent greedy line search, in order to induce arbitrarily shaped microstructure regions and we use a heat transfer model to evaluate the fitness of solutions in an iterative approach that is far more efficient than pure trial and error. The objective of the optimization algorithm is to control local thermal conditions – hence microstructure formation – during the melting process by manipulating the order and the dwell time of all the points of the infill pattern sequence. We then analyze the optimized sequence to determine important path characteristics that affect the microstructure formation. Through examples, we show that relative order and frequency, as measured by weighted average and variance of spot order, are important factors that influence the final characteristics.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Implementation of Genetic Algorithms to Optimize Metal–Organic Frameworks for CO 2 Capture

Metal-organic frameworks (MOFs) are promising materials for CO 2 capture with the potential to use less energy than current industrial CO 2 capture methods. MOFs are highly versatile sorbents, and there is an almost unlimited number of MOFs that could be synthesized. In this work, we used a genetic algorithm (GA) and grand canonical Monte Carlo (GCMC) simulations to efficiently search for high-performing MOFs for CO 2 capture. We analyzed the effects of important GA parameters, including the mutation probability, the number of MOFs per generation and the number of GA generations, on the GA performance. Here, we performed GCMC simulations on-the-fly during the GA procedure to determine the performance of proposed MOFs and optimized their structures using multiple objective functions across different topologies. The GA was able to determine top-performing MOFs balancing CO 2 selectivity versus working capacity and reduced the cost of molecular simulations by a factor of 25 versus brute-force screening of an entire database of structures.

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

Minimizing Ground Risk in Cellular-Connected Drone Corridors With mmWave Links

Unmanned Aircraft Systems (UASs) have been receiving significant interest and support from academia, industry, and regulatory bodies over the past decade due to their various use cases. To safely integrate UAS operations into the national airspace, particularly overpopulated regions, the risk posed to ground users, buildings, and vehicles due to unmanned aerial vehicle (UAV) flight should be minimized. This risk can be represented by a numerical metric, which we refer to in this article as the “ground risk.” Many UAS applications also depend on the presence of a reliable wireless communication link between the UAV and a control station for the transmission of UAV position, surveillance video, UAV payload commands, and other mission-related data. Such wireless communication requirements also need to be considered in the design of UAS operations. In this article, we consider both these aspects and study the design of nonintersecting trajectories for UAS operations to minimize ground risk, subject to constraints on the wireless signal strength and geometry of the trajectory, specified in terms of: 1) an enclosing cylinder within which the trajectory must lie and 2) an integrated angular change along the UAV's trajectory. The performance of a computationally expensive optimal algorithm is compared with that of a computationally faster heuristic approach within the dense urban environment of Manhattan, NY, USA. Performance evaluation using ray-tracing simulations shows that the heuristic approach performs close to the optimal algorithm at a reduced computation cost. In conclusion, this research can be utilized to make UAS operations safe and reliable and accelerate their adoption.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2021

Mesh independency in topology optimization

The topology optimization community has regularly employed optimization algorithms from the operations research community. However, these algorithms are implemented in the sequence space l2 instead of the proper function space where the design variable resides. In this software, we benchmark the mesh independent implementation of pyMMAopt with three common problems in topology optimization. We show how the volume fraction variable discretization on non-uniform meshes affects the convergence of l2 based optimization algorithms and how pyMMAopt successfully achieves mesh independent convergence.

Salazar De Troya, Miguel↗