Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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,441 records · Page 80

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗

A complementarity-based vapor-liquid equilibrium formulation for equation-oriented simulation and optimization

Vapor-Liquid Equilibrium (VLE) is a cornerstone of computer aided process engineering (CAPE). Embedded within process system models, VLE calculations are inherently procedural with non-smooth behavior that frequently require discrete decisions. Traditionally, these features resist the incorporation of VLE within efficient, large-scale equation-oriented (EO) process simulation and optimization strategies. On the other hand, recent reformulation of VLE models through the incorporation of complementarity constraints has broadened its scope to deal seamlessly with phase transitions and even supercritical excursions in process simulation and optimization. In this study, we extend these VLE complementarity models to EO frameworks where procedural thermodynamic property libraries are still required. Here, we develop an efficient, non-intrusive, and intuitive “square-flash” equation system that has been implemented within the IDAES Integrated Platform (IDAES-IP). Further, the effectiveness of this modular approach is demonstrated on case studies for non-ideal flash calculations and distillation optimization with disappearing phases and supercritical transitions.

97 MATHEMATICS AND COMPUTING↗

First principles molecular dynamics without self-consistent field optimization

We present a first principles molecular dynamics approach that is based on time-reversible extended Lagrangian Born-Oppenheimer molecular dynamics [A. M. N. Niklasson, Phys. Rev. Lett. 100, 123004 (2008)] in the limit of vanishing self-consistent field optimization. The optimization-free dynamics keeps the computational cost to a minimum and typically provides molecular trajectories that closely follow the exact Born-Oppenheimer potential energy surface. Only one single diagonalization and Hamiltonian (or Fockian) construction are required in each integration time step. The proposed dynamics is derived for a general free-energy potential surface valid at finite electronic temperatures within hybrid density functional theory. Even in the event of irregular functional behavior that may cause a dynamical instability, the optimization-free limit represents a natural starting guess for force calculations that may require a more elaborate iterative electronic ground state optimization. Our optimization-free dynamics thus represents a flexible theoretical framework for a broad and general class of ab initio molecular dynamics simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Learning to simulate high energy particle collisions from unlabeled data

In many scientific fields which rely on statistical inference, simulations are often used to map from theoretical models to experimental data, allowing scientists to test model predictions against experimental results. Experimental data is often reconstructed from indirect measurements causing the aggregate transformation from theoretical models to experimental data to be poorly-described analytically. Instead, numerical simulations are used at great computational cost. We introduce Optimal-Transport-based Unfolding and Simulation (OTUS), a fast simulator based on unsupervised machine-learning that is capable of predicting experimental data from theoretical models. Without the aid of current simulation information, OTUS trains a probabilistic autoencoder to transform directly between theoretical models and experimental data. Identifying the probabilistic autoencoder’s latent space with the space of theoretical models causes the decoder network to become a fast, predictive simulator with the potential to replace current, computationally-costly simulators. Here, we provide proof-of-principle results on two particle physics examples, Z-boson and top-quark decays, but stress that OTUS can be widely applied to other fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

CCAMP: An Integrated Translation and Optimization Framework for OpenACC and OpenMP

Heterogeneous computing and exploration into specialized accelerators are inevitable in current and future supercomputers. Although this diversity of devices is promising for performance, the array of architectures presents programming challenges. High-level programming strategies have emerged to face these challenges, such as the OpenMP offloading model and OpenACC. The varying levels of support for these standards, however, within vendor-specific and open-source tools, as well as the lack of performance portability across devices, have prevented the standards from achieving their goals. To address these shortcomings, we present CCAMP, an OpenMP and OpenACC interoperable framework. CCAMP provides two primary facilities: language translation between the two standards and device-specific directive optimization within each standard. We show that by using the CCAMP framework, programmers can easily transplant non-portable code into new ecosystems for new architectures. Additionally, by using CCAMP device-specific directive optimizations, users can achieve optimized performance across architectures using a single source code.

Lambert, Jacob↗

Finding Electronic Structure Machine Learning Surrogates without Training

A myriad of phenomena in materials science and chemistry rely on quantum-level simulations of the electronic structure in matter. While moving to larger length and time scales has been a pressing issue for decades, such large-scale electronic structure calculations are still challenging despite modern software approaches and advances in high-performance computing. The silver lining in this regard is the use of machine learning to accelerate electronic structure calculations – this line of research has recently gained growing attention. The grand challenge therein is finding a suitable machine-learning model during a process called hyperparameter optimization. This, however, causes a massive computational overhead in addition to that of data generation. We accelerate the construction of machine-learning surrogate models by roughly two orders of magnitude by circumventing excessive training during the hyperparameter optimization phase. We demonstrate our workflow for Kohn-Sham density functional theory, the most popular computational method in materials science and chemistry.

36 MATERIALS SCIENCE↗

Multistage robust optimization for the day-ahead scheduling of hybrid thermal-hydro-wind-solar systems

The integration of large-scale uncertain and uncontrollable wind and solar power generation has brought new challenges to the operations of modern power systems. In a power system with abundant water resources, hydroelectric generation with high operational flexibility is a powerful tool to promote a higher penetration of wind and solar power generation. In this paper, we study the day-ahead scheduling of a thermal-hydro-wind-solar power system. The uncertainties of renewable energy generation, including uncertain natural water inflow and wind/solar power output, are taken into consideration. We explore how the operational flexibility of hydroelectric generation and the coordination of thermal-hydro power can be utilized to hedge against uncertain wind/solar power under a multistage robust optimization (MRO) framework. To address the computational issue, mixed decision rules are employed to reformulate the original MRO model with a multi-level structure into a bi-level one. Column-and-constraint generation (C &CG) algorithm is extended into the MRO case to solve the bi-level model. The proposed optimization approach is tested in three real-world cases. Furthermore, the computational results demonstrate the capability of hydroelectric generation to promote the accommodation of uncertain wind and solar power.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

SPECTER: efficient evaluation of the spectral EMD

The Energy Mover’s Distance (EMD) has seen use in collider physics as a metric between events and as a geometric method of defining infrared and collinear safe observables. Recently, the Spectral Energy Mover’s Distance (SEMD) has been proposed as a more analytically tractable alternative to the EMD. In this work, we obtain a closed-form expression for the Riemannian-like p = 2 SEMD metric between events, eliminating the need to numerically solve an optimal transport problem. Additionally, we show how the SEMD can be used to define event and jet shape observables by minimizing the distance between events and parameterized energy flows (similar to the EMD), and we obtain closed-form expressions for several of these observables. We also present the Specter framework, an efficient and highly parallelized implementation of the SEMD metric and SEMD-derived shape observables as an analogue of the previously-introduced Shaper for EMD-based computations. We demonstrate that computing the SEMD with Specter can be up to a thousand times faster than computing the EMD with standard optimal transport libraries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Analysis of the Challenges in Developing Sample-Based Multi-fidelity Estimators for Non-deterministic Models

Multifidelity (MF) uncertainty quantification (UQ) seeks to leverage and fuse information from a collection of models to achieve greater statistical accuracy with respect to a single-fidelity counterpart, while maintaining an efficient use of computational resources. Despite many recent advancements in MF UQ, several challenges remain and these often limit its practical impact in certain application areas. In this manuscript, we focus on the challenges introduced by nondeterministic models to sampling MF UQ estimators. Nondeterministic models produce different responses for the same inputs, which means their outputs are effectively noisy. MF UQ is complicated by this noise since many state-of-the-art approaches rely on statistics, e.g., the correlation among models, to optimally fuse information and allocate computational resources. Here, we demonstrate how the statistics of the quantities of interest, which impact the design, effectiveness, and use of existing MF UQ techniques, change as functions of the noise. With this in hand, we extend the unifying approximate control variate framework to account for nondeterminism, providing for the first time a rigorous means of comparing the effect of nondeterminism on different multifidelity estimators and analyzing their performance with respect to one another. Numerical examples are presented throughout the manuscript to illustrate and discuss the consequences of the presented theoretical results.

97 MATHEMATICS AND COMPUTING↗

ComPort: Rigorous Testing Methods to Safeguard Software Porting (Final Technical Report)

This is a technical report from the lead institution – University of Utah, Kahlert School of Computing – funded under the Department of Energy, Office of Science, Office of Advanced Scientific Computing Research under award number DE-SC0022252. We summarize our work done over the three years of funding received. The relevant papers and software have already been uploaded at the DOE site.

97 MATHEMATICS AND COMPUTING↗

Performance Optimization and Auto-Tuning

In the broader computational research community, one subject of recent research is the problem of adapting algorithms to make effective use of multi- and many-core processors. Effective use of these architectures, which have complex memory hierarchies with many layers of cache, typically involves a careful examination of how an algorithm moves data through the memory hierarchy. Unfortunately, there is often a non-obvious relationship between algorithmic parameters like blocking strategies, and their impact on memory utilization, and, in turn, the relationship with runtime performance. Auto-tuning is an empirical method used to discover optimal values for tunable algorithmic parameters under such circumstances. The challenge is compounded by the fact that the settings that produce the best performance for a given problem and a given platform may not be the best for a different problem on the same platform, or the same problem on a different platform. The high performance visualization research community has begun to explore and adapt the principles of auto-tuning for the purpose of optimizing codes on modern multi- and many-core processors. This report focuses on how performance optimization studies reveal a dramatic variation in performance for two fundamental visualization algorithms: one based on a stencil operation having structured, uniform memory access, and the other is ray casting volume rendering, which uses unstructured memory access patterns. The two case studies highlighted in this report show the extra effort required to optimize such codes by adjusting the tunable algorithmic parameters can return substantial gains in performance. Additionally, these case studies also explore the potential impact of and the interaction between algorithmic optimizations and tunable algorithmic parameters, along with the potential performance gains resulting from leveraging architecture-specific features.

97 MATHEMATICS AND COMPUTING↗

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗

Flexible optimized data handling in systems with multiple memories

Methods and systems for optimizing an application for a computing system having multiple distinct memory locations that are interconnected by one or more communication channels include determining one or more data handling properties for a data region in an application. One or more data handling policies for the data region are determined based on the one or more data handling properties. Data setup costs are determined for a scope in the application that uses the data region in different memory locations based on the one or more data handling properties. The application is optimized in accordance with the one or more data handling policies and the data setup costs for the different memory locations.

Chen, Tong↗

Flexible optimized data handling in systems with multiple memories

Methods and systems for optimizing an application for a computing system having multiple distinct memory locations that are interconnected by one or more communication channels include determining one or more data handling properties for a data region in an application. One or more data handling policies for the data region are determined based on the one or more data handling properties. Data setup costs are determined for a scope in the application that uses the data region in different memory locations based on the one or more data handling properties. The application is optimized in accordance with the one or more data handling policies and the data setup costs for the different memory locations.

Chen, Tong↗

An Online Prototype Toolset for Predicting and Optimizing P&T Performance (FY23 Status Report)

A new web-based toolset is being developed to support ongoing remediation optimization efforts and implementation of an adaptive site management strategy for the 200 West Area Pump-and-Treat (P&T) system at the Hanford Site. This toolset, comprising the well performance index tool and the well optimization pre-screening tool, will offer a user-friendly interface to predict and optimize the P&T well network’s performance at a preliminary level. Efforts in fiscal year (FY) 2023 focused on three main components: updating the existing deep learning model for predicting P&T performance, designing and developing a prototype of a web-based performance index tool, and initiating the conceptual design of the well optimization pre-screening tool. The well performance index tool is based on a pre-trained deep learning model that allows users to select a target contaminant and well screen length, then visualize the predicted performance of potential new wells across the site. The well optimization pre-screening tool includes two separate modules: the pre-computed scenario viewer, which organizes and visualizes offline optimization simulation results, and the quick analysis module, which provides real-time model prediction using user-specified well locations. In FY24, the plan is to add web-based applications to SOCRATES for both the well performance prediction tool and the optimization prescreening tool, with accompanying user and theory guides. These tools are intended to enable an accessible, easily applied, and transparent approach to remedy planning and decision-making.

97 MATHEMATICS AND COMPUTING↗

Constrained variational optimization of counting-time allocation in sequential scattering measurements: Application to Bonse–Hart USANS

Sequential scattering measurements are often performed under a fixed experimental-time budget, even though the expected count rate varies strongly across the measured coordinate. When the dwell time at each measurement position can be controlled independently, this variation creates a general resource-allocation problem: how should the available time be distributed to minimize the uncertainty of the reconstructed profile? We formulate this problem as a constrained variational optimization for measurements governed by Poisson counting statistics. When each measurement is treated independently, minimizing the averaged squared relative uncertainty yields an inverse-square-root intensity allocation. The formulation is then generalized to include correlations between neighboring measurements and an instrumental resolution operator, leading to an allocation criterion that equalizes the marginal reduction in posterior uncertainty per unit measurement time. Bonse–Hart ultra-small-angle neutron scattering (USANS), in which reciprocal space is sampled sequentially through analyzer-angle stepping, provides an experimentally grounded application. Computational benchmarking shows that the optimized allocation outperforms uniform-time and constant-relative-error strategies, while application to an experimentally measured graphite USANS profile from the Spallation Neutron Source, using Poisson resampling under alternative schedules, demonstrates how counting time should be redistributed toward weak-intensity regions under an identical total duration. The resulting framework applies to sequential scattering and related scanning measurements whenever local dwell times are adjustable and directly determine the measurement uncertainties, and when the relevant correlation and instrumental-response models are available.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

Direct microstability optimization of stellarator devices

Turbulent transport is regarded as one of the key issues in magnetic confinement nuclear fusion, both for tokamaks and stellarators. Here, in this work, we show that a significant decrease in a microstability-based proxy, as opposed to a geometric one, for the turbulent heat flux, namely the quasilinear heat flux, can be obtained in an efficient manner by coupling stellarator optimization with linear gyrokinetic simulations. This is accomplished by computing the quasilinear heat flux at each step of the optimization process, as well as the deviation from quasisymmetry, and minimizing their sum, leading to a balance between neoclassical and the turbulent transport proxy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Low Cost Hydrogen Production Platform

A technology and design evaluation was carried out for the development of a turnkey hydrogen production system in the range of 2.4 - 12 kg/h of hydrogen. The design is based on existing SMR technology and existing chemical processes and technologies to meet the design objectives. Consequently, the system design consists of a steam methane reformer, PSA system for hydrogen purification, natural gas compression, steam generation and all components and heat exchangers required for the production of hydrogen. The focus of the program is on packaging, system integration and an overall step change in the cost of capital required for the production of hydrogen at small scale. To assist in this effort, subcontractors were brought in to evaluate the design concepts and to assist in meeting the overall goals of the program. Praxair supplied the overall system and process design and the subcontractors were used to evaluate the components and system from a manufacturing and overall design optimization viewpoint. Design for manufacturing and assembly (DFMA) techniques, computer models and laboratory/full-scale testing of components were utilized to optimize the design during all phases of the design development. Early in the program evaluation, a review of existing Praxair hydrogen facilities showed that over 50% of the installed cost of a SMR based hydrogen plant is associated with the high temperature components (reformer, shift, steam generation, and various high temperature heat exchange). The main effort of the initial phase of the program was to develop an integrated high temperature component for these related functions. Initially, six independent concepts were developed and the processes were modeled to determine overall feasibility. The six concepts were eventually narrowed down to the highest potential concept. A US patent was awarded in February 2009 for the Praxair integrated high temperature component design. A risk analysis of the high temperature component was conducted to identify any potential design deficiency related to the concept. The analysis showed that no fundamental design flaw existed with the concept, but additional simulations and prototypes would be required to verify the design prior to fabricating a production unit. These identified risks were addressed in detail during Phase II of the development program. Along with the models of the high temperature components, a detailed process and 3D design model of the remainder of system, including PSA, compression, controls, water treatment and instrumentation was developed and evaluated. Also, in Phase II of the program, laboratory/fullscale testing of the high temperature components was completed and stable operation/control of the system was verified. The overall design specifications and test results were then used to develop accurate hydrogen costs for the optimized system. Praxair continued development and testing of the system beyond the Phase II funding provided by the DOE through the end of 2008. This additional testing is not documented in this report, but did provide significant additional data for development of a prototype system as detailed in the Phase III proposal. The estimated hydrogen product costs were developed (2007 basis) for the 4.8 kg/h system at production rates of 1, 5, 10, 100 and 1,000 units built per year. With the low cost SMR approach, the product hydrogen costs for the 4.8 kg/h units at 50 units produced per year were approximately $3.02 per kg. With increasing the volume production to 1,000 units per year, the hydrogen costs are reduced by about 12% to $2.67 per kg. The cost reduction of only 12% is a result of significant design and fabrication efficiencies being realized in all levels of production runs through utilizing the DFMA principles. A simplified and easily manufactured design does not require large production volumes to show significant cost benefits. These costs represent a significant improvement and a new benchmark in the cost to produce small volume on-site hydrogen using existing process technologies. The cost models assume a natural gas cost of $5/MMBtu (HHV). Praxair has, in Phases I and II of this program, shown that significant improvements in cost, plant layout, system integration and overall system optimization are achievable. Phase III of the program, submitted in January 2007, was to focus on demonstrating both the technical feasibility and economic viability of the design developed in Phases I and II through a full-scale prototype design, construction, installation, analysis and operation at a hydrogen fueling station. Due to funding limitations, Phase III of the program was not approved by the DOE.

08 HYDROGEN↗