Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization algorithm”

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,747 records · Page 97

Optimization of the generator coordinate method with machine-learning techniques for nuclear spectra and neutrinoless double- β decay: Ridge regression for nuclei with axial deformation

The generator coordinate method (GCM) is an important tool of choice for modeling large-amplitude collective motion in atomic nuclei. The computational complexity of the GCM increases rapidly with the number of collective coordinates. It imposes a strong restriction on the applicability of the method. In this work, we propose a subspace-reduction algorithm that employs optimal statistical ML models as surrogates for exact quantum-number projection calculations for norm and Hamiltonian kernels. The model space of the original GCM is reduced to a subspace relevant for nuclear low energy spectra and the NME of ground state to ground state 0νββ decay based on the orthogonality condition (OC) and the energy-transition-orthogonality procedure (ENTROP), respectively. For simplicity, the polynomial ridge regression (RR) algorithm is used to learn the norm and Hamiltonian kernels of axially deformed configurations. The efficiency and accuracy of this algorithm are illustrated for 76 Ge and 76 Se by comparing results obtained using the optimal RR models to direct GCM calculations. The low-lying energy spectra of 76 Ge and 76 Se, as well as the 0νββ-decay NME between their ground states, are computed. Furthermore, the results show that the performance of the GCM+OC/ENTROP+RR is more robust than that of the GCM+RR alone, and the former can reproduce the results of the original GCM calculation accurately with a significantly reduced computational cost.

59 ≤ A ≤ 89↗

Evaluation of Optimal Net Load Management in Microgrids Using Hardware-in-the-Loop Simulation

This paper presents the performance evaluation of a net load management (NLM) engine that balances load and generation in an isolated community to power a critical facility after a grid interruption event (e.g., the loss of a large generation unit). This NLM engine is particularly important for microgrid systems because it provides a high-speed, cost-optimal control solution to coordinate grid-forming inverters and to dispatch grid-following inverters and deferrable loads in microgrid systems to enhance grid resilience and reliability. The NLM algorithm cost-optimally dispatches the grid-following inverters and deferrable loads based on the demanded power and load priorities, and the grid-forming inverters use droop control to form system voltages and share active and reactive power. A controller-hardware-in-the-loop platform is developed to evaluate the control performance of the NLM algorithm with two sequential contingency events of lost generation units. The experimental results indicate that the NLM engine can maintain system stability, achieve the targeted system voltage and frequency, and balance load and generation to serve the critical facility with improved system resilience and reliability.

grid-following inverter↗

Evaluation of Optimal Net Load Management in Microgrids Using Hardware-in-the-Loop Simulation

This presentation discusses the performance evaluation of a net load management (NLM) engine that balances load and generation in an isolated community to power a critical facility after a grid interruption event (e.g., the loss of a large generation unit). This NLM engine is particularly important for microgrid systems because it provides a high-speed, cost-optimal control solution to coordinate grid-forming inverters and to dispatch grid-following inverters and deferrable loads in microgrid systems to enhance grid resilience and reliability. The NLM algorithm cost-optimally dispatches the grid-following inverters and deferrable loads based on the demanded power and load priorities, and the grid-forming inverters use droop control to form system voltages and share active and reactive power. A controller-hardware-in-the-loop platform is developed to evaluate the control performance of the NLM algorithm with two sequential contingency events of lost generation units. The experimental results indicate that the NLM engine can maintain system stability, achieve the targeted system voltage and frequency, and balance load and generation to serve the critical facility with improved system resilience and reliability.

droop control↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗

The need for application-based adaptation of deformable image registration

Purpose: To utilize a deformable phantom to objectively evaluate the accuracy of 11 different deformable image registration (DIR) algorithms. Methods: The phantom represents an axial plane of the pelvic anatomy. Urethane plastic serves as the bony anatomy and urethane rubber with three levels of Hounsfield units (HU) is used to represent fat and organs, including the prostate. A plastic insert is placed into the phantom to simulate bladder filling. Nonradiopaque markers reside on the phantom surface. Optical camera images of these markers are used to measure the positions and determine the deformation from the bladder insert. Eleven different DIR algorithms are applied to the full and empty-bladder computed tomography images of the phantom (fixed and moving volumes, respectively) to calculate the deformation. The algorithms include those from MIM Software (MIM) and Velocity Medical Solutions (VEL) and nine different implementations from the deformable image registration and adaptive radiotherapy toolbox for Matlab. These algorithms warp one image to make it similar to another, but must utilize a method for regularization to avoid physically unrealistic deformation scenarios. The mean absolute difference (MAD) between the HUs at the marker locations on one image and the calculated location on the other serves as a metric to evaluate the balance between image similarity and regularization. To demonstrate the effect of regularization on registration accuracy, an additional beta version of MIM was created with a variable smoothness factor that controls the emphasis of the algorithm on regularization. The distance to agreement between the measured and calculated marker deformations is used to compare the overall spatial accuracy of the DIR algorithms. This overall spatial accuracy is also utilized to evaluate the phantom geometry and the ability of the phantom soft-tissue heterogeneity to represent patient data. To evaluate the ability of the DIR algorithms to accurately transfer anatomical contours, the rectum is delineated on both the fixed and moving images. A Dice similarity coefficient is then calculated between the contour on the fixed image and that transferred, via the calculated deformation, from the moving to the fixed image. Results: The phantom possesses sufficient soft-tissue heterogeneity to act as a proxy for patient data. Large discrepancies appear between the algorithms and the measured ground-truth deformation. VEL yields the smallest mean spatial error and a Dice coefficient of 0.90. MIM produces the lowest MAD value and the highest Dice coefficient of 0.96, but creates the largest spatial errors. Increasing the MIM smoothness factor above the default value improves the overall spatial accuracy, but the factor associated with the lowest mean error decreases the Dice coefficient to 0.85. Conclusions: Different applications of DIR require disparate balances between image similarity and regularization. A DIR algorithm that is optimized only for its ability to transfer anatomical contours will yield large deformation errors in homogeneous regions, which is problematic for dose mapping. For this reason, these algorithms must be tested for their overall spatial accuracy. The developed phantom is an objective tool for this purpose.

60 APPLIED LIFE SCIENCES↗

Sensor System and Observer Algorithm Co-Design For Modern Internal Combustion Engine Air Management Based on H2 Optimization

This paper outlines a novel sensor selection and observer design algorithm for linear time-invariant systems with both process and measurement noise based on H 2 optimization to optimize the tradeoff between the observer error and the number of required sensors. The optimization problem is relaxed to a sequence of convex optimization problems that minimize the cost function consisting of the H 2 norm of the observer error and the weighted l 1 norm of the observer gain. An LMI formulation allows for efficient solution via semi-definite programing. The approach is applied here, for the first time, to a turbo-charged spark-ignited engine using exhaust gas circulation to determine the optimal sensor sets for real-time intake manifold burnt gas mass fraction estimation. Simulation with the candidate estimator embedded in a high fidelity engine GT-Power model demonstrates that the optimal sensor sets selected using this algorithm have the best H 2 estimation performance. Sensor redundancy is also analyzed based on the algorithm results. This algorithm is applicable for any type of modern internal combustion engines to reduce system design time and experimental efforts typically required for selecting optimal sensor sets.

Zhang, Xu↗

Compressive sensing adaptation for polynomial chaos expansions

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. Here, we present a new adaptation mechanism that builds on compressive sensing algorithms, resulting in a reduced polynomial chaos approximation with optimal sparsity. The developed adaptation algorithm consists of a two-step optimization procedure that computes the optimal coefficients and the input projection matrix of a low dimensional chaos expansion with respect to an optimally rotated basis. Finally, we demonstrate the attractive features of our algorithm through several numerical examples including the application on Large-Eddy Simulation (LES) calculations of turbulent combustion in a HIFiRE scramjet engine.

42 ENGINEERING↗

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗

Cooperative Management of a Lithium-Ion Battery Energy Storage Network: A Distributed MPC Approach

This paper presents a study of cooperative power supply and storage for a network of Lithium-ion energy storage systems (LiBESSs). We propose to develop a distributed model predictive control (MPC) approach for two reasons. First, able to account for the practical constraints of a LiBESS, the MPC can enable a constraint-aware operation. Second, a distributed management can cope with a complex network that integrates a large number of LiBESSs over a complex communication topology. With this motivation, we then build a fully distributed MPC algorithm from an optimization perspective, which is based on an extension of the alternating direction method of multipliers (ADMM) method. A simulation example is provided to demonstrate the effectiveness of the proposed algorithm.

Fang, Huazhen↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasifiction combined sycle (IGCC) power plant with CO2 capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

97 MATHEMATICS AND COMPUTING↗

Sensor placement algorithm development to maximize the efficiency of acid gas removal unit for integrated gasification combined cycle (IGCC) power plant with CO{sub 2} capture

Future integrated gasification combined cycle (IGCC) power plants with CO{sub 2} capture will face stricter operational and environmental constraints. Accurate values of relevant states/outputs/disturbances are needed to satisfy these constraints and to maximize the operational efficiency. Unfortunately, a number of these process variables cannot be measured while a number of them can be measured, but have low precision, reliability, or signal-to-noise ratio. In this work, a sensor placement (SP) algorithm is developed for optimal selection of sensor location, number, and type that can maximize the plant efficiency and result in a desired precision of the relevant measured/unmeasured states. In this work, an SP algorithm is developed for an selective, dual-stage Selexol-based acid gas removal (AGR) unit for an IGCC plant with pre-combustion CO{sub 2} capture. A comprehensive nonlinear dynamic model of the AGR unit is developed in Aspen Plus Dynamics® (APD) and used to generate a linear state-space model that is used in the SP algorithm. The SP algorithm is developed with the assumption that an optimal Kalman filter will be implemented in the plant for state and disturbance estimation. The algorithm is developed assuming steady-state Kalman filtering and steady-state operation of the plant. The control system is considered to operate based on the estimated states and thereby, captures the effects of the SP algorithm on the overall plant efficiency. The optimization problem is solved by Genetic Algorithm (GA) considering both linear and nonlinear equality and inequality constraints. Due to the very large number of candidate sets available for sensor placement and because of the long time that it takes to solve the constrained optimization problem that includes more than 1000 states, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. In this presentation, we will share our experience in setting up parallel computing using GA in the MATLAB® environment and present the overall approach for achieving higher computational efficiency in this framework.

20 FOSSIL-FUELED POWER PLANTS↗

Pressurized-Water Reactor Core Design Demonstration with Genetic Algorithm Based Multi-Objective Plant Fuel Reload Optimization Platform

LWRS M3 milestone report due September 15, 2023. This report summarizes development and demonstration activities of PRLO optimization platform built in Risk Analysis and Virtual ENviroment (RAVEN), specifically: (1) Improvement of multi-objective non-dominated sorting genetic algorithm II (NSGA-II) to handle large size of objectives and constraints, (2) Demonstration of pressurized water reactor core design with NSGA-II multi-objective optimization platform, and (3) Single-objective optimized core design including system analysis and fuel performance feedback.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Stochastic assessment of distributed generation hosting capacity and energy efficiency in active distribution networks

Active network management (ANM) aims to increase the capacity of variable distributed generation (DG), which can be connected to existing distribution networks. In this study, it is proposed to simultaneously consider the efficient use of energy resources when high shares of DG are procured through the ANM approach. To that end, a multi-period and multiobjective optimisation algorithm, based on the linearised optimal power flow, is formulated. The algorithm seeks to maximise the installed capacity of DG while minimising the energy losses and consumption of voltage-dependent loads. The objectives are optimised considering the coordinated operation of voltage regulators and on-load tap changers, and the management of DG generation curtailment and reactive power compensation from DG. Additionally, the effects of load and generation uncertainties are addressed through a two-stage stochastic programming formulation of the multiobjective problem. The result is a set of non-inferior solutions, which allows exploring the degree of conflict among the objectives. The proposed approach was tested on two IEEE test feeders and the solutions show a significant improvement in the system's energy efficiency with a low impact on the amount of connected DG.

Quijano, Darwin Alexis↗

Implementation of density functional embedding theory within the projector-augmented-wave method and applications to semiconductor defect states

We report a new implementation of the density functional embedding theory (DFET) in the VASP code, using the projector-augmented-wave (PAW) formalism. Newly developed algorithms allow us to efficiently perform optimized effective potential optimizations within PAW. The new algorithm generates robust and physically correct embedding potentials, as we verified using several test systems including a covalently bound molecule, a metal surface, and bulk semiconductors. We show that with the resulting embedding potential, embedded cluster models can reproduce the electronic structure of point defects in bulk semiconductors, thereby demonstrating the validity of DFET in semiconductors for the first time. Compared to our previous version, the new implementation of DFET within VASP affords use of all features of VASP (e.g., a systematic PAW library, a wide selection of functionals, a more flexible choice of U correction formalisms, and faster computational speed) with DFET. Furthermore, our results are fairly robust with respect to both plane-wave and Gaussian type orbital basis sets in the embedded cluster calculations. This suggests that the density functional embedding method is potentially an accurate and efficient way to study properties of isolated defects in semiconductors.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

LINAC OPTICS OPTIMIZATION WITH MULTI-OBJECTIVE OPTIMIZATION

The beamline design of recirculating linacs requires special attention to avoid beam instabilities due to RF wakefields. A proposed high-energy, multi-pass energy recovery demonstration at CEBAF uses a low beam current. Stronger focusing at lower energies is necessary to avoid beam breakup(BBU) instabilities, even with this small beam current. The CEBAF linac optics optimization balances over-focusing at higher energies and beta excursions at lower energies. Using proper mathematical expressions, linac optics optimization can be achieved with evolutionary algorithms. Here, we present the optimization process of North Linac optics using multi-objective optimization.

Neththikumara, I.↗

Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem

In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.

42 ENGINEERING↗

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗