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,603 records · Page 89

KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set

KSSOLV (Kohn-Sham Solver) is a MATLAB toolbox for performing Kohn-Sham density functional theory (DFT) calculations with a plane-wave basis set. KSSOLV 2.0 preserves the design features of the original KSSOLV software to allow users and developers to easily set up a problem and perform ground-state calculations as well as to prototype and test new algorithms. Furthermore, it includes new functionalities such as new iterative diagonalization algorithms, k-point sampling for electron band structures, geometry optimization and advanced algorithms for performing DFT calculations with local, semi-local, and hybrid exchange-correlation functionals. It can be used to study the electronic structures of both molecules and solids. So, we describe these new capabilities in this work through a few use cases. We also demonstrate the numerical accuracy and computational efficiency of KSSOLV on a variety of examples.

97 MATHEMATICS AND COMPUTING↗

Economical and Engineering Aspects of Proactive Demand Participation: Centralized versus Bilateral Control Structure

The electric grid of the U.S. is evolving from a system characterized by large and centralized fossil-fueled power plants and passive customers to a network with high penetration of distributed energy resources and proactive customers. This project facilitated the evolution of the U.S. electric power grid by enabling proactive participation of demands in electricity market at the power distribution system level. This project has three major achievements. First, we designed a centralized distribution system operator managed electricity market and developed a three-phase alternating current optimal power flow algorithm to coordinate the operation of large-scale flexible loads and distributed energy resources. Second, we designed a decentralized bilateral coordinate framework for retail electricity market, where each participating customer is capable of making decisions regarding energy production and consumption based on information received from transactive neighbors. Third, the impacts of centralized and decentralized demand-side participation scheme on power system operations were evaluated with both large-scale simulations and hardware-in-the-loop demonstrations. The major activities and specific accomplishments of the technical tasks are summarized in Section II. The detailed design of centralized/hierarchical and decentralized/bilateral retail electricity markets and the comparison between the two markets are described in Section III. The accomplishments and conclusions of the project are presented in Section IV. The major findings of the project falls into three areas, hierarchical distribution system operator managed electricity market, bilateral electricity market and decentralized market coordination, and comparison of centralized and decentralized market coordination mechanisms. In the area of hierarchical distribution system operator managed electricity market design, an integrated wholesale and retail electricity market was shown to be highly effective in extracting the operational flexibility from distributed energy resources to provide services to the wholesale market. A chordal conversion based convex iteration algorithm is not only computationally efficiency but also achieves global optimal solution in coordinating the operations of a large number of heterogeneous distributed energy resources.In the area of decentralized market coordination approach, we showed that bilateral transactions among proactive customers and decentralized transaction clearing mechanism based on simultaneous second-price sealed-bid auction can encourage truthful bidding strategies from the market participations. In addition, the individual customers can rely on a portfolio optimization approach to maximize their returns while minimizing risks. In the area of comparison of centralized and decentralized market coordination mechanisms, we found that the centralized market design results in higher social welfare and lower wholesale market clearing price for electricity. In general, centralized market design favors distributed energy resources and fixed loads. The decentralized market design mostly benefits flexible loads and conventional generators.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

MO-G-304-04: Generating Well-Dispersed Representations of the Pareto Front for Multi-Criteria Optimization in Radiation Treatment Planning

Purpose: To present a novel multi-criteria optimization (MCO) solution approach that generates well-dispersed representation of the Pareto front for radiation treatment planning. Methods: Different algorithms have been proposed and implemented in commercial planning software to generate MCO plans for external-beam radiation therapy. These algorithms consider convex optimization problems. We propose a grid-based algorithm to generate well-dispersed treatment plans over Pareto front. Our method is able to handle nonconvexity in the problem to deal with dose-volume objectives/constraints, biological objectives, such as equivalent uniform dose (EUD), tumor control probability (TCP), normal tissue complication probability (NTCP), etc. In addition, our algorithm is able to provide single MCO plan when clinicians are targeting narrow bounds of objectives for patients. In this situation, usually none of the generated plans were within the bounds and a solution is difficult to identify via manual navigation. We use the subproblem formulation utilized in the grid-based algorithm to obtain a plan within the specified bounds. The subproblem aims to generate a solution that maps into the rectangle defined by the bounds. If such a solution does not exist, it generates the solution closest to the rectangle. We tested our method with 10 locally advanced head and neck cancer cases. Results: 8 objectives were used including 3 different objectives for primary target volume, high-risk and low-risk target volumes, and 5 objectives for each of the organs-at-risk (OARs) (two parotids, spinal cord, brain stem and oral cavity). Given tight bounds, uniform dose was achieved for all targets while as much as 26% improvement was achieved in OAR sparing comparing to clinical plans without MCO and previously proposed MCO method. Conclusion: Our method is able to obtain well-dispersed treatment plans to attain better approximation for convex and nonconvex Pareto fronts. Single treatment plan can be achieved when given bounds on the objectives.

60 APPLIED LIFE SCIENCES↗

Numerical study of a matrix-free trust-region SQP method for equality constrained optimization

This is a companion publication to the paper 'A Matrix-Free Trust-Region SQP Algorithm for Equality Constrained Optimization' in which we develop and analyze a trust-region sequential quadratic programming (SQP) method that supports the matrix-free (iterative, in-exact) solution of linear systems. In this report, we document the numerical behavior of the algorithm applied to a variety of equality constrained optimization problems, with constraints given by partial differential equations (PDEs).

99 GENERAL AND MISCELLANEOUS↗

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗

A Software Framework for Comparing Training Approaches for Spiking Neuromorphic Systems

There are a wide variety of training approaches for spiking neural networks for neuromorphic deployment. However, it is often not clear how these training algorithms perform or compare when applied across multiple neuromorphic hardware platforms and multiple datasets. In this work, we present a software framework for comparing performance across four neuromorphic training algorithms across three neuromorphic simulators and four simple classification tasks. We introduce an approach for training a spiking neural network using a decision tree, and we compare this approach to training algorithms based on evolutionary algorithms, back-propagation, and reservoir computing. We present a hyperparameter optimization approach to tune the hyperparameters of the algorithm, and show that these optimized hyperparameters depend on the processor, algorithm, and classification task. Finally, we compare the performance of the optimized algorithms across multiple metrics, including accuracy, training time, and resulting network size, and we show that there is not one best training algorithm across all datasets and performance metrics.

Schuman, Catherine↗

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems which display a variety of complex rearrangements (e.g. mobile genetic elements), mutation for genetic algorithms commonly utilizes only random point-wise changes. Furthermore, generalizing beyond point-wise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined point-wise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e. mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Finally, our results show that moving beyond random point-wise mutations accelerates genetic algorithm optimization.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluating In-Clique and Topological Parallelism Strategies for Junction Tree-Based Bayesian Inference Algorithm on the Cray XMT

Long viewed as a strong statistical inference technique, Bayesian networks have emerged to be an important class of applications for high-performance computing. We have applied an architecture-conscious approach to parallelizing the Lauritzen-Spiegelhalter Junction Tree algorithm for exact inferencing in Bayesian networks. In optimizing the Junction Tree algorithm, we have implemented both in-clique and topological parallelism strategies to best leverage the fine-grained synchronization and massive-scale multithreading of the Cray XMT architecture. Two topological techniques were developed to parallelize the evidence propagation process through the Bayesian network. One technique involves performing intelligent scheduling of junction tree nodes based on its topology and relative size. The second technique involves decomposing the junction tree into a much finer tree-like representation to offer much more opportunities for parallelism. We evaluate these optimizations on five different Bayesian networks and report our findings and observations. Another important contribution of this paper is to demonstrate the application of massive-scale multithreading for load balancing and use of implicit parallelism-based compiler optimizations in designing scalable inferencing algorithms.

99 GENERAL AND MISCELLANEOUS↗

Optimization of a Unipolar Magnetic Bearing

New designs of unipolar magnetic bearings in electrical industrial machines are optimized by means of genetic algorithms. As a result, the optimal geometric dimensions are determined. On that basis, a design is developed for an electric motor with a unipolar active magnetic bearing.

42 ENGINEERING↗

Inverse Design of a Graphene-Based Quantum Transducer via Neuroevolution

Here we introduce an inverse design framework based on artificial neural networks, genetic algorithms, and tight-binding calculations, capable to optimize the very large configuration space of nanoelectronic devices. Our non-linear optimization procedure operates on trial Hamiltonians through superoperators controlling growth policies of regions of distinct doping. We demonstrate that our algorithm optimizes the doping of graphene-based three-terminal devices for valleytronics applications, monotonously converging to synthesizable devices with high merit functions in a few thousand evaluations (out of similar or equal to ≃ 2 3800 possible configurations). The best-performing device allowed for a terminal-specific separation of valley currents with similar or equal to ≃ 96% (≃ 94%) K(K') valley purity. Importantly, the devices found through our non-linear optimization procedure have both a higher merit function and higher robustness to defects than the ones obtained through geometry optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of Type 4 composite pressure vessels using genetic algorithms and simulated annealing

We propose and demonstrate two methodologies for weight minimization of Type 4 (plastic lined, fiber wrapped) compressed hydrogen pressure vessels: genetic algorithms and simulated annealing. We consider 70 MPa vessels with a safety factor of 2.25, and analyze the vessels with classical laminate theory. We propose an objective function based on Tsai-Wu criterion, composite thickness, a safety factor, and a penalization factor. Here, the optimum results are analyzed and compared by a high resolution finite element model. Computer simulations show that the proposed methodology produces more efficient designs by reducing the weight by up to 9.8% and 11.2% when compared to previously published vessel optimization research.

08 HYDROGEN↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms: Preprint

This paper presents a distributed approach to perform real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approach real-time control/optimization.

17 WIND ENERGY↗

Multiphysics Co-Optimization Design and Analysis of Double-Side Cooled Silicon Carbide-Based Power Module: Preprint

With the rapid growth of Electric Vehicles (EVs) and Hybrid Electric Vehicles (HEVs), much more rigorous design targets have been set for automotive power electronics, including high power density, high reliability, and low cost. Novel power module and inverter technologies based on wide bandgap (WEG) semiconductors have been developed to meet these design targets, while providing optimal power semiconductor operating temperature and promising thermomechanical performance. Compared with conventional cooling techniques which are normally applied only on one side of power module, double-side cooling approach is now believed to be the solution to enable high power density and low thermal resistance of WEG semiconductor-based power electronics. In this work, we develop a three-phase power module that is double-sided cooled using dielectric fluid jet impingement. In each phase, four silicon carbide (SiC) power semiconductors are bonded to copper busbars without electrical insulation layers. A finite element analysis (FEA) model is created for thermal and thermomechanical analysis. Based on FEA modeling results, we select particular dimensions for a parametric study to optimize thermal and mechanical performance. Using a multi-objective genetic algorithm (MOGA)-based optimization method, we have minimized the maximum junction temperature and thermal stresses within the power module. The multiphysics co-optimization approach has enabled an efficient design process of power modules with greatly reduced computational cost, as compared to conventional processes that rely on exhaustive numerical simulations and iterations.

ADVANCED PROPULSION SYSTEMS↗

TH-EF-BRB-04: 4π Dynamic Conformal Arc Therapy Dynamic Conformal Arc Therapy (DCAT) for SBRT

Purpose: To develop an efficient and effective trajectory optimization methodology for 4π dynamic conformal arc treatment (4π DCAT) with synchronized gantry and couch motion; and to investigate potential clinical benefits for stereotactic body radiation therapy (SBRT) to breast, lung, liver and spine tumors. Methods: The entire optimization framework for 4π DCAT inverse planning consists of two parts: 1) integer programming algorithm and 2) particle swarm optimization (PSO) algorithm. The integer programming is designed to find an optimal solution for arc delivery trajectory with both couch and gantry rotation, while PSO minimize a non-convex objective function based on the selected trajectory and dose-volume constraints. In this study, control point interaction is explicitly taken into account. Beam trajectory was modeled as a series of control points connected together to form a deliverable path. With linear treatment planning objectives, a mixed-integer program (MIP) was formulated. Under mild assumptions, the MIP is tractable. Assigning monitor units to control points along the path can be integrated into the model and done by PSO. The developed 4π DCAT inverse planning strategy is evaluated on SBRT cases and compared to clinically treated plans. Results: The resultant dose distribution of this technique was evaluated between 3D conformal treatment plan generated by Pinnacle treatment planning system and 4π DCAT on a lung SBRT patient case. Both plans share the same scale of MU, 3038 and 2822 correspondingly to 3D conformal plan and 4π DCAT. The mean doses for most of OARs were greatly reduced at 32% (cord), 70% (esophagus), 2.8% (lung) and 42.4% (stomach). Conclusion: Initial results in this study show the proposed 4π DCAT treatment technique can achieve better OAR sparing and lower MUs, which indicates that the developed technique is promising for high dose SBRT to reduce the risk of secondary cancer.

60 APPLIED LIFE SCIENCES↗

Experimental Evidence on Latency in a Fleet of Controllable Water Heaters

Demand response is an important emerging part of smart grids with wide coverage in theoretical and modeling research. However, experimental evidence on the real-life behavior of controllable loads is still limited. We present observations regarding latency and communication aspects of the operation on a fleet of residential water heaters in a smart neighborhood in Atlanta, GA. Our analysis shows that latency in water heaters is not constant and does not follow a Gaussian distribution. We also find that there is a systematic relationship between latency and hour of the day. Latency was found to increase during morning and evening hours compared to the afternoon. These findings could help better plan deployment of control for demand response programs. Understanding delays associated with controlling smart devices is crucial for proper design and algorithm development for optimization, frequency of dispatch, and override detection.

communication delay↗

EZFF: Python library for multi-objective parameterization and uncertainty quantification of interatomic forcefields for molecular dynamics

Parameterization of interatomic forcefields is a necessary first step in performing molecular dynamics simulations. This is a non-trivial global optimization problem involving quantification of multiple empirical variables against one or more properties. We present EZFF, a lightweight Python library for parameterization of several types of interatomic forcefields implemented in several molecular dynamics engines against multiple objectives using genetic-algorithm-based global optimization methods. The EZFF scheme provides unique functionality such as the parameterization of hybrid forcefields composed of multiple forcefield interactions as well as built-in quantification of uncertainty in forcefield parameters and can be easily extended to other forcefield functional forms as well as MD engines.

97 MATHEMATICS AND COMPUTING↗

Rovibrational controlled-NOT gates using optimized stimulated Raman adiabatic passage techniques and optimal control theory

Implementation of quantum controlled-NOT (CNOT) gates in realistic molecular systems is studied using stimulated Raman adiabatic passage (STIRAP) techniques optimized in the time domain by genetic algorithms or coupled with optimal control theory. In the first case, with an adiabatic solution (a series of STIRAP processes) as starting point, we optimize in the time domain different parameters of the pulses to obtain a high fidelity in two realistic cases under consideration. A two-qubit CNOT gate constructed from different assignments in rovibrational states is considered in diatomic (NaCs) or polyatomic (SCCl{sub 2}) molecules. The difficulty of encoding logical states in pure rotational states with STIRAP processes is illustrated. In such circumstances, the gate can be implemented by optimal control theory and the STIRAP sequence can then be used as an interesting trial field. We discuss the relative merits of the two methods for rovibrational computing (structure of the control field, duration of the control, and efficiency of the optimization)

74 ATOMIC AND MOLECULAR PHYSICS↗

Integrating Natural Language Processing and Machine Learning Algorithms to Categorize Oncologic Response in Radiology Reports

A significant volume of medical data remains unstructured. Natural language processing (NLP) and machine learning (ML) techniques have shown to successfully extract insights from radiology reports. However, the codependent effects of NLP and ML in this context have not been well-studied. Between April 1, 2015 and November 1, 2016, 9418 cross-sectional abdomen/pelvis CT and MR examinations containing our internal structured reporting element for cancer were separated into four categories: Progression, Stable Disease, Improvement, or No Cancer. We combined each of three NLP techniques with five ML algorithms to predict the assigned label using the unstructured report text and compared the performance of each combination. The three NLP algorithms included term frequency-inverse document frequency (TF-IDF), term frequency weighting (TF), and 16-bit feature hashing. The ML algorithms included logistic regression (LR), random decision forest (RDF), one-vs-all support vector machine (SVM), one-vs-all Bayes point machine (BPM), and fully connected neural network (NN). The best-performing NLP model consisted of tokenized unigrams and bigrams with TF-IDF. Increasing N-gram length yielded little to no added benefit for most ML algorithms. With all parameters optimized, SVM had the best performance on the test dataset, with 90.6 average accuracy and F score of 0.813. The interplay between ML and NLP algorithms and their effect on interpretation accuracy is complex. The best accuracy is achieved when both algorithms are optimized concurrently.

62 RADIOLOGY AND NUCLEAR MEDICINE↗