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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

All sources NASA NTRS DOE OSTI

DOE OSTI2015

Use of density functional theory method to calculate structures of neutral carbon clusters C{sub n} (3 ≤ n ≤ 24) and study their variability of structural forms

In this work, we present modifications to the well-known basin hopping (BH) optimization algorithm [D. J. Wales and J. P. Doye, J. Phys. Chem. A 101, 5111 (1997)] by incorporating in it the unique and specific nature of interactions among valence electrons and ions in carbon atoms through calculating the cluster’s total energy by the density functional tight-binding (DFTB) theory, using it to find the lowest energy structures of carbon clusters and, from these optimized atomic and electronic structures, studying their varied forms of topological transitions, which include a linear chain, a monocyclic to a polycyclic ring, and a fullerene/cage-like geometry. In this modified BH (MBH) algorithm, we define a spatial volume within which the cluster’s lowest energy structure is to be searched, and introduce in addition a cut-and-splice genetic operator to increase the searching performance of the energy minimum than the original BH technique. The present MBH/DFTB algorithm is, therefore, characteristically distinguishable from the original BH technique commonly applied to nonmetallic and metallic clusters, technically more thorough and natural in describing the intricate couplings between valence electrons and ions in a carbon cluster, and thus theoretically sound in putting these two charged components on an equal footing. The proposed modified minimization algorithm should be more appropriate, accurate, and precise in the description of a carbon cluster. We evaluate the present algorithm, its energy-minimum searching in particular, by its optimization robustness. Specifically, we first check the MBH/DFTB technique for two representative carbon clusters of larger size, i.e., C{sub 60} and C{sub 72} against the popular cut-and-splice approach [D. M. Deaven and K. M. Ho, Phys. Rev. Lett. 75, 288 (1995)] that normally is combined with the genetic algorithm method for finding the cluster’s energy minimum, before employing it to investigate carbon clusters in the size range C{sub 3}-C{sub 24} studying their topological transitions. An effort was also made to compare our MBH/DFTB and its re-optimized results carried out by full density functional theory (DFT) calculations with some early DFT-based studies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2015

PSO algorithm enhanced with Lozi Chaotic Map - Tuning experiment

In this paper it is investigated the effect of tuning of control parameters of the Lozi Chaotic Map employed as a chaotic pseudo-random number generator for the particle swarm optimization algorithm. Three different benchmark functions are selected from the IEEE CEC 2013 competition benchmark set. The Lozi map is extensively tuned and the performance of PSO is evaluated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2015

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

DOE OSTI2023

A novel method for co-optimizing battery sizing and charging strategy of battery electric bus fleets: An application to the city of Paris

Battery-electric buses (BEBs) are a promising technology for replacing diesel buses and reducing their environmental burden. However, their charging process can take several hours, depending on the charging technique and strategy, making them susceptible to schedule disruptions. Furthermore, the selection of the charging strategy and battery size can increase the total capital investment and operational expenses of a BEB fleet, which is a major obstacle to its adoption. Therefore, to minimize the total cost of ownership (TCO) and prevent schedule disruptions, it is essential to establish a well-defined approach to determine an appropriate battery size and charging strategy for BEB fleets. This paper presents a method for reducing the TCO of BEB by determining the optimal battery size and charging strategy for each bus while satisfying operating constraints. The method involves a two-step optimization algorithm that uses Dynamic Programming and Genetic Algorithm. Further, the study applies this approach to the bus fleet serving line 21 in Paris and generates the optimal battery sizing, charging strategy, and required charging infrastructure. The results indicate that 100 kWh batteries offer the best trade-off between capital and operational expenditure for the fleet deployment if used with 65–85 kW chargers at bus terminals.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2022

Scaling quantum approximate optimization on near-term hardware

The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Variational quantum simulation of the critical Ising model with symmetry averaging

Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.

1-dimensional spin chains↗

DOE OSTI2022

Scalable and Energy-Efficient Methods for Interactive Exploration of Scientific Data

The main scientific contributions of this project are the following novel concepts for multidimensional arrays: shape-based similarity join (SIGMOD 2016), incremental view maintenance (SIGMOD 2017), user-defined stencil functions (HPDC 2017), and distributed caching for in-situ processing (SSDBM 2018). Building on our collaboration with the astrophysics group at LBNL, we applied these techniques to the data generated in the Palomar Transient Factory (PTF) astronomical survey. They played a pivotal role in the first-ever observation of a neutron star merger, which produces gravitational waves and turns out to be the origin of heavy elements, including gold. This has lead to a Science magazine article that has received extensive media coverage on ACM TechNews, Slashdot, FiveThirtyEight, and Quanta Magazine, among others. Additionally, two other articles detailing related aspects of the same discovery have been published in the Astrophysical Journal Letters journal. These publications have more than 3,000 citations according to Google Scholar (as of February 2022). This cross-disciplinary collaboration provided very good opportunities to apply database techniques to real-life scientific problems. The fact that they facilitated major discoveries in astrophysics proves the importance of our research. In addition to the work on multidimensional array databases, this project has also developed stochastic gradient descent (SGD) optimization algorithms for training large scale machine learning models, methods for querying in-situ data, and a database query optimizer based on sketch synopses.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Optimized Floating Offshore Wind Turbine Substructure Design Trends for 10–30 MW Turbines in Low-, Medium-, and High-Severity Wave Environments

Floating offshore wind is a promising renewable energy source, as 60% of the wind resources globally are found at depths requiring floating technologies, it minimizes construction at sea, and provides opportunities for industrialization given a lower site dependency. While floating offshore wind has numerous advantages, a current obstacle is its cost in comparison to more established energy sources. One cost-reduction approach for floating wind is increasing turbine capacities, which minimizes the amount of foundations, moorings, cables, and O&M equipment. This work presents trends in mass-optimized VolturnUS hull designs as turbine capacity increases for various wave environments. To do this, a novel rapid hull optimization framework is presented that employs frequency domain modeling, estimations of statistical extreme responses, industry constructability requirements, and genetic algorithm optimization to generate preliminary mass-optimal VolturnUS hull designs for a given turbine design and set of site conditions. Using this framework, mass-optimized VolturnUS hull designs were generated for 10–30 MW turbines for wave environments of varying severities. These design studies show that scaling up turbine capacities increases the mass efficiency of substructure designs, with decreasing returns, throughout the examined turbine capacity range. Additionally, increased wave environment severity is shown to increase the required mass of a given substructure design.

VolturnUS↗

DOE OSTI2015

Stabilized quasi-Newton optimization of noisy potential energy surfaces

Optimizations of atomic positions belong to the most commonly performed tasks in electronic structure calculations. Many simulations like global minimum searches or characterizations of chemical reactions require performing hundreds or thousands of minimizations or saddle computations. To automatize these tasks, optimization algorithms must not only be efficient but also very reliable. Unfortunately, computational noise in forces and energies is inherent to electronic structure codes. This computational noise poses a severe problem to the stability of efficient optimization methods like the limited-memory Broyden–Fletcher–Goldfarb–Shanno algorithm. We here present a technique that allows obtaining significant curvature information of noisy potential energy surfaces. We use this technique to construct both, a stabilized quasi-Newton minimization method and a stabilized quasi-Newton saddle finding approach. We demonstrate with the help of benchmarks that both the minimizer and the saddle finding approach are superior to comparable existing methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Source localization for neutron imaging systems using convolutional neural networks

The nuclear imaging system at the National Ignition Facility (NIF) is a crucial diagnostic for determining the geometry of inertial confinement fusion implosions. The geometry is reconstructed from a neutron aperture image via a set of reconstruction algorithms using an iterative Bayesian inference approach. An important step in these reconstruction algorithms is finding the fusion source location within the camera field-of-view. Currently, source localization is achieved via an iterative optimization algorithm. In this paper, we introduce a machine learning approach for source localization. Specifically, we train a convolutional neural network to predict source locations given a neutron aperture image. We show that this approach decreases computation time by several orders of magnitude compared to the current optimization-based source localization while achieving similar accuracy on both synthetic data and a collection of recent NIF deuterium–tritium shots.

47 OTHER INSTRUMENTATION↗

DOE OSTI2024

Source localization for neutron imaging systems using convolutional neural networks

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2014

Optimized aperiodic multilayer structures for use as narrow-angular absorbers

In this paper, we investigate aperiodic multilayer structures for use as narrow-angular absorbers. The layer thicknesses and materials are optimized using a genetic global optimization algorithm coupled to a transfer matrix code to maximize the angular selectivity in the absorptance at a single or multiple wavelengths. We first consider structures composed of alternating layers of tungsten and silicon or silica, and find that it is not possible to achieve angular selectivity in the absorptance with such structures. We next consider structures composed of alternating layers of silicon and silica, and show that when optimized they exhibit high angular selectivity in absorptance. In addition, as the angular selectivity in absorptance increases, the wavelength range of high angular selectivity also decreases. Optimizing the material composition of the multilayer structures, in addition to optimizing the layer thicknesses, leads to marginal improvement in angular selectivity. Finally, we show that by optimizing the absorptance of the multilayer structures at multiple wavelengths, we can obtain structures exhibiting almost perfect absorptance at normal incidence and narrow angular width in absorptance at these wavelengths. Similar to the structures optimized at a single wavelength, the wavelength range of high angularly selective absorptance is narrow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2017

Data analytics and optimization of an ice-based energy storage system for commercial buildings

Ice-based thermal energy storage (TES) systems can shift peak cooling demand and reduce operational energy costs (with time-of-use rates) in commercial buildings. The accurate prediction of the cooling load, and the optimal control strategy for managing the charging and discharging of a TES system, are two critical elements to improving system performance and achieving energy cost savings. This study utilizes data-driven analytics and modeling to holistically understand the operation of an ice–based TES system in a shopping mall, calculating the system’s performance using actual measured data from installed meters and sensors. Results show that there is significant savings potential when the current operating strategy is improved by appropriately scheduling the operation of each piece of equipment of the TES system, as well as by determining the amount of charging and discharging for each day. A novel optimal control strategy, determined by an optimization algorithm of Sequential Quadratic Programming, was developed to minimize the TES system’s operating costs. Three heuristic strategies were also investigated for comparison with our proposed strategy, and the results demonstrate the superiority of our method to the heuristic strategies in terms of total energy cost savings. Specifically, the optimal strategy yields energy costs of up to 11.3% per day and 9.3% per month compared with current operational strategies. A one-day-ahead hourly load prediction was also developed using machine learning algorithms, which facilitates the adoption of the developed data analytics and optimization of the control strategy in a real TES system operation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2019

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

Computational quantum technologies are entering a new phase in which noisy intermediate-scale quantum computers are available, but are still too small to benefit from active error correction. Even with a finite coherence budget to invest in quantum information processing, noisy devices with about 50 qubits are expected to experimentally demonstrate quantum supremacy in the next few years. Defined in terms of artificial tasks, current proposals for quantum supremacy, even if successful, will not help to facilitate solutions to practical problems. In contrast, we believe that future users of quantum computers are interested in actual applications and that noisy quantum devices may still provide value by approximately solving hard combinatorial problems via hybrid classical-quantum algorithms. To lower bound the size of quantum computers with practical utility, we perform realistic simulations of the Quantum Approximate Optimization Algorithm and conclude that quantum speedup will not be attainable, at least for a representative combinatorial problem, until several hundreds of qubits are available.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

SU-C-204-04: Patient Specific Proton Stopping Powers Estimation by Combining Proton Radiography and Prior-Knowledge X-Ray CT Information

Purpose: The material relative stopping power (RSP) uncertainty is the highest contributor to the range uncertainty in proton therapy. The purpose of this work is to develop a robust and systematic method that yields accurate, patient specific, RSP by combining 1) pre-treatment x-ray CT and 2) daily proton radiograph of the patient. Methods: The method is formulated as a linear least-square optimization problem (min||Ax-B||2). The parameter A represents the pathlength crossed by the proton in each material. The RSPs for the materials (water equivalent thickness (WET)/physical thickness) are denoted by x. B is the proton radiograph expressed as WET crossed. The problem is minimized using a convex-conic optimization algorithm with xi<xi+1 constraint. The Gammex RMI-465 phantom, with 13 material inserts, is used to investigate the optimal RSPs. The proton radiograph (B) is produced using Geant4 simulation. The matrix A is computed by calculating proton trajectories through the CT with the cubic-spline approach. Geant4 RSPs are used as reference and the clinical HU-RSP calibration curve is used as comparison. The convergence is investigated as a function of the number of angles and protons used. The radiographs angle which yield the most accurate RSPs are investigated. Results: Optimization with 9 angles and 104 protons/angle yields precise RSP (<0.75%) for all materials, except plastic lung (1.5%). Average deviation relative to Geant4 RSP is 0.5% and 3.5% using HU-RSP. Using more than two angles or more than 4×103 proton does not further increase the RSP estimate accuracy. The insert distance to the beam initial plane is related to the RSP error for this insert material. Specific filters are applied on the proton angle and energy loss to remove nuclear interaction artefacts. Conclusion: The proposed formulation of the problem with prior knowledge x-ray CT demonstrates serious potential to increase the accuracy of present RSP estimates.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2020

Demand Driven Cycamore Archetypes

Future nuclear fuel cycle options may present advantages over today’s once-through fuel cycle. Nuclear fuel cycle simulation tools assess the performance of those fuel cycles as well as the dynamics of long-term technology transitions. In many nuclear fuel cycle simulation tools, it has historically been the responsibility of the user to manually define facility deployment schemes and all facility parameters. While this is straightforward in simple fuel cycles, transitions from one fuel cycle to another can be more complex. In particular, deployment schemes for supportive fuel cycle facilities beyond the reactor become complex if the analyst desires to avoid gaps in the nuclear fuel and power supply chain during those transition scenarios. As nuclear fuel cycle analysis approaches questions regarding the feasibility and performance of the deployment schemes and technology choices during technology transition, automation of this historically manual process is necessary. The main objective of this work was to develop and demonstrate Cyclus automation capabilities toward key nuclear fuel cycle transition scenarios. While deploying reactors to meet power demand is trivial, and existed in the earliest versions of CYCLUS, automated, predictive deployment and decommissioning of other facilities is more complex. These include mining, milling, enrichment, fuel fabrication, reprocessing, and others. For example, a balanced closed fuel cycle may require ensuring that there is enough fast reactor fuel for their operation and may drive deployment of a fleet of light water reactors. This concern comprises the main challenge that drove the project effort. The Demand-Driven Cycamore Archetype project (NEUP-FY16-10512) aimed to develop CYCAMORE demand-driven deployment capabilities and thereby automate transition scenario definition. The developed software package, d3ploy, in the form of a CYCLUS Institution agent, deploys Facilities to meet the front-end and back-end demands of the fuel cycle. The University of South Carolina and the University of Illinois applied multiple algorithmic approaches to this challenge. This project developed an in situ demand-driven development schedule calculation through non-optimizing, deterministic-optimizing, and stochastic-optimizing algorithms as CYCLUS archetypes and demonstrated these new archetypes in program-supporting fuel cycle transition scenarios. Both objectives were achieved. This report documents the results and deliverables obtained toward these achievements in detail.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2020

Sign-OPT: A Query-Efficient Hard-label Adversarial Attack

We study the most practical problem setup for evaluating adversarial robustness of a machine learning system with limited access: the hard-label black-box attack setting for generating adversarial examples, where limited model queries are allowed and only the decision is provided to a queried data input. Several algorithms have been proposed for this problem but they typically require huge amount (>20,000) of queries for attacking one example. Among them, one of the state-of-the-art approaches (Cheng et al., 2019) showed that hard-label attack can be modeled as an optimization problem where the objective function can be evaluated by binary search with additional model queries, thereby a zeroth order optimization algorithm can be applied. In this paper, we adopt the same optimization formulation but propose to directly estimate the sign of gradient at any direction instead of the gradient itself, which enjoys the benefit of single query. Using this single query oracle for retrieving sign of directional derivative, we develop a novel query-efficient Sign-OPT approach for hard-label black-box attack. We provide a convergence analysis of the new algorithm and conduct experiments on several models on MNIST, CIFAR-10 and ImageNet. We find that Sign-OPT attack consistently requires 5X to 10X fewer queries when compared to the current state-of-the-art approaches, and usually converges to an adversarial example with smaller perturbation.

Cheng, Minhao↗

DOE OSTI2017

Recent advances in stellarator optimization

Computational optimization has revolutionized the field of stellarator design. To date, optimizations have focused primarily on optimization of neoclassical confinement and ideal MHD stability, although limited optimization of other parameters has also been performed. Here, we outline a select set of new concepts for stellarator optimization that, when taken as a group, present a significant step forward in the stellarator concept. One of the criticisms that has been leveled at existing methods of design is the complexity of the resultant field coils. Recently, a new coil optimization code—COILOPT++, which uses a spline instead of a Fourier representation of the coils,—was written and included in the STELLOPT suite of codes. The advantage of this method is that it allows the addition of real space constraints on the locations of the coils. The code has been tested by generating coil designs for optimized quasi-axisymmetric stellarator plasma configurations of different aspect ratios. As an initial exercise, a constraint that the windings be vertical was placed on large major radius half of the non-planar coils. Further constraints were also imposed that guaranteed that sector blanket modules could be removed from between the coils, enabling a sector maintenance scheme. Results of this exercise will be presented. New ideas on methods for the optimization of turbulent transport have garnered much attention since these methods have led to design concepts that are calculated to have reduced turbulent heat loss. We have explored possibilities for generating an experimental database to test whether the reduction in transport that is predicted is consistent with experimental observations. Thus, a series of equilibria that can be made in the now latent QUASAR experiment have been identified that will test the predicted transport scalings. Fast particle confinement studies aimed at developing a generalized optimization algorithm are also discussed. A new algorithm developed for the design of the scraper element on W7-X is presented along with ideas for automating the optimization approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗