Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Microhole drilling technology utilizing a golden section search algorithm

A fundamental issue in microhole drilling is that delivering high weight-on-bit (WOB), high torque rotational horsepower to a conventional drill bit does not scale down to the hole sizes necessary to realize the envisioned cost savings An optimization algorithm called a golden section search (GSS) was used to systematically identify the preferred WOB for a given set of conditions. This research focused on implementing and evaluating two low WOB drilling technologies for microhole drilling: - Laser-assisted mechanical drill, which was tested in the laboratory - Lightly modified commercial off-the-shelf (COTS) percussive hammer, which was tested in a limited field test. Data were collected for microhole GSS using WOB optimization via simulation as well as at the Blue Canyon Dome Site in Socorro, NM. Information on the attached files and folders are as follows: - the .tdms files are LabView data files, which can be opened within Excel using a .tdms add-in or using a Matlab .tdms converter - the .tdms_index files are part of the .tdms file structure - sampling rate, column headers, and length data within the .tdms files follow SOP when utilizing Excel and/or Matlab as described above

15 GEOTHERMAL ENERGY↗
DOE OSTI2024

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗
DOE OSTI2020

CLUE: A Fast Parallel Clustering Algorithm for High Granularity Calorimeters in High-Energy Physics

One of the challenges of high granularity calorimeters, such as that to be built to cover the endcap region in the CMS Phase-2 Upgrade for HL-LHC, is that the large number of channels causes a surge in the computing load when clustering numerous digitized energy deposits (hits) in the reconstruction stage. In this article, we propose a fast and fully parallelizable density-based clustering algorithm, optimized for high-occupancy scenarios, where the number of clusters is much larger than the average number of hits in a cluster. The algorithm uses a grid spatial index for fast querying of neighbors and its timing scales linearly with the number of hits within the range considered. We also show a comparison of the performance on CPU and GPU implementations, demonstrating the power of algorithmic parallelization in the coming era of heterogeneous computing in high-energy physics.

Rovere, Marco↗
DOE OSTI2021

Progress on Optimizing Wind Farms and Rotor Designs Using Adjoints

Modern wind plants are increasingly tasked with multiple performance objectives. In addition to designing plants that maximize power output and minimize the levelized cost of energy (LCOE), the design and operation of wind plants is increasingly influenced by challenges regarding grid integration of variable generation renewables. This places a growing emphasis on making wind plants more controllable and predictable. WindSE is a Reynolds-averaged Navier-Stokes (RANS) model designed around analytical gradient and adjoint methods, with the ability to capture terrain-induced effects, as shown in Figure 1. The recent addition of an unsteady solver with an actuator line method (ALM) and ongoing work to enable massively parallel optimizations gives it a unique niche to explore coupled plant-level controls and design problems. This code is an open source python package built on the FEniCS framework that utilizes fast, parallel PETSc solvers to model fluid flow throughout wind-farm scale domains. Two recent studies performed using WindSE demonstrate the capability to optimize under a wide variety of flow conditions and objective functions. In the first, we present an optimization focused on modifying the layout of a wind farm with a fixed number of turbines for maximum total power output [1]. This study highlights the ability to quickly perform simulations using the steady Navier-Stokes solver combined with rotors represented as actuator disks while also stressing the importance of capturing terrain-induced effects. Gradient-based optimization using the RANS equations is viable due to the inclusion of efficiently computed adjoint derivatives. We interpret the physical results of the optimal layout and also discuss the computational cost of scaling to larger problems. In the second study, we present the capabilities of the unsteady Navier-Stokes solver, where rotor-blade profiles represented by actuator lines are optimized to enhance wake steering effects and overall power production [2]. We quantify the wind plant performance gains obtained from this type of simultaneous control co-design optimization as compared to optimizing the blade design and yaw independently. Figure 2 shows the differences between a baseline two-turbine system and an optimized system where we fine-tune the blade chord profile. Results and challenges from each study are quickly summarized and used to motivate the current development efforts within WindSE. Current and future work is focused on enabling higher-resolution studies with more degrees of freedom through parallelization of both the simulation and optimization algorithms. We present benchmarking results to show that WindSE performs well in both weak- and strong-scaling tests and further demonstrate that the optimizer obtains the same convergence rates in both shared- and distributed-memory environments. Using larger wind farms, we can study deep-array effects within an optimization context, allowing the use of objective functions that have been previously unstudied. As an example, we present ongoing work on a blockage metric which characterizes the loss of available kinetic energy due to wake effects from multiple upstream turbines.

adjoint optimization↗
DOE OSTI2023

Accelerating gradient descent and Adam via fractional gradients

Here we propose a class of novel fractional-order optimization algorithms. We define a fractional-order gradient via the Caputo fractional derivatives that generalizes integer-order gradient. We refer it to as the Caputo fractional-based gradient, and develop an efficient implementation to compute it. A general class of fractional-order optimization methods is then obtained by replacing integer-order gradients with the Caputo fractional-based gradients. To give concrete algorithms, we consider gradient descent (GD) and Adam, and extend them to the Caputo fractional GD (CfGD) and the Caputo fractional Adam (CfAdam). We demonstrate the superiority of CfGD and CfAdam on several large scale optimization problems that arise from scientific machine learning applications, such as ill-conditioned least squares problem on real-world data and the training of neural networks involving non-convex objective functions. Numerical examples show that both CfGD and CfAdam result in acceleration over GD and Adam, respectively. We also derive error bounds of CfGD for quadratic functions, which further indicate that CfGD could mitigate the dependence on the condition number in the rate of convergence and results in significant acceleration over GD.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Bayes_Opt-SWMM: A Gaussian process-based Bayesian optimization tool for real-time flood modeling with SWMM

Real-time flood model plays a pivotal role in averting urban flood damage, particularly when there is minimal lead time for preparatory measures. However, urban flood modeling in real-time often contends with inherent uncertainties arising from input data uncertainty and parameter ambiguities. Here this study introduces a real-time calibration (RTC) tool called Bayes_Opt-SWMM, specifically tailored for real-time urban flood modeling and uncertainty optimization. This tool leverages the Gaussian process-based Bayesian optimization algorithm and interfaces seamlessly with the Stormwater Management Model (SWMM). It integrates real-time model forcing data and flood monitoring collected through sensors and gauges which are strategically placed within critical locations of urban drainage systems. Our approach hinges on the Surrogate Model based Uncertainty Optimization (SMUO) concept, providing an avenue for enhancing real-time flood modeling. Bayes_Opt-SWMM runs the optimization process using a surrogate model called Gaussian Process emulator with two inference methods: (1) the Gaussian Process (GP) model and (2) Markov Chain Monte Carlo (MCMC) algorithm in GP model (GP_MCMC). Furthermore, three acquisition functions, namely Expected Improvement (EI), Maximum Probability of Improvement (MPI), and Lower Confidence Bound (LCB), facilitate optimal parameter fitting within the surrogate models. The efficiency of GP-based surrogate models in learning SWMM model parameters, leads to an improved uncertainty quantification and accelerated real-time flood modeling in urban areas. Overall, Bayes_Opt-SWMM emerges as a cost-effective and valuable tool for real-time flood modeling and monitoring, with significant potential for managing intelligent storm water systems in urban environments.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Adjoint-enabled multidimensional optimization of satellite electron/proton shields - 25452

The design of satellites usually includes the objective of minimizing mass due to high launch costs, which is complicated by the need to protect sensitive electronics from the space radiation environment. There is growing interest in automated design optimization techniques to help achieve that objective. Traditional optimization approaches that rely exclusively on response functions (e.g. dose calculations) can be quite expensive when applied to transport problems. Previously we showed how adjoint-based transport sensitivities used in conjunction with gradient-based optimization algorithms can be quite effective in designing mass-efficient electron/proton shields in one-dimensional slab geometries. In this paper we extend that work to two-dimensional Cartesian geometries. This consists primarily of deriving the sensitivities to geometric changes, given a particular prescription for parameterizing the shield geometry. We incorporate these sensitivities into our optimization process and demonstrate their effectiveness in such design calculations. (authors)

42 ENGINEERING↗
DOE OSTI2026

Optimized Tandem Catalyst Patterning for CO 2 Reduction Flow Reactors

Tandem catalysis involves two or more catalysts arranged in proximity within a single reaction vessel, with the aim of synergistically aligning the catalysts’ reaction pathways to maximize overall system performance. This study presents a proof of concept showing the integration of continuum transport modeling with design optimization in a simplified two-dimensional flow reactor setup for electrochemical CO 2 reduction. Ag catalysts provide the CO 2 ⟶ CO reaction capability, and Cu catalysts provide the CO ⟶ high-value products reaction capability. Given a set of input parameters, the optimization algorithm uses adjoint methods to modify the Ag/Cu surface patterning in order to maximize the current density toward high-value products, such as ethylene. The optimized designs yield significant performance enhancement especially at more negative applied voltages (i.e., stronger surface reactions) and for larger numbers of patterning sections. For an applied voltage of −1.7 V vs. SHE, the 12-section optimized design increases the current density toward ethylene by up to 65% compared to the unoptimized 2-section design. For the optimized cases, observed differences in the production and consumption of CO (the key intermediate species) and minimized zones of low CO reactant surface concentration on Cu sections explain the improved reactor performance.

CO2 reduction↗
DOE OSTI2024

Automated Operational Forecasting of Monsoon Low Pressure Systems

Monsoon low pressure systems (LPSs) are the dominant rain-bearing weather system of South Asia, often producing extreme precipitation and hydrological disasters in a region inhabited by nearly two billion people. Despite the importance of these storms, no operational system has automatically identified and tracked LPS in real time in numerical weather prediction model output; many commonly used vortex-tracking algorithms are ill suited for monsoon LPS because of the weak winds and cold cores of these systems. Here, we describe a new system that uses optimized algorithms to identify monsoon LPS in short- to medium-range forecasts from the U.S. Global Ensemble Forecast System (GEFS) and a version of the deterministic Global Forecast System (GFS) adapted and used operationally by the Indian Institute of Tropical Meteorology (IITM). We also assess the historical performance of these models in forecasting South Asian monsoon LPS, comparing this with the performance of the Integrated Forecasting System of the ECMWF. We assess the accuracy of model predictions of LPS genesis, position, intensity, and precipitation rates for forecast lead times of 1–5 days, yielding quantitative information on model biases to guide operational forecasters and disaster managers. The system we introduce here could be extended to other low-latitude regions affected by dynamically weak, heavily precipitating atmospheric vortices that are often not included in tropical cyclone inventories.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Review of Shape and Topology Optimization for Design of Air-to-Refrigerant Heat Exchangers

Air-to-refrigerant heat exchangers (HXs) have been the topic of exhaustive research as they are fundamental components of HVAC&R systems. It has been well-established that the large airside thermal resistance dominates the HX thermal resistance, and thus significant research efforts have focused on improving the air-side performance of these heat exchangers. As HXs continue to become more compact, thermal resistance reduction is typically realized through the utilization of extended secondary heat transfer surfaces such as fins. However, past research has shown that the thermal-hydraulic trade-offs provided by fins are often not attractive enough to warrant their use, especially for small diameter tubes. Yet, the inadequate primary surface area provided by compact HXs essentially mandate the necessity of fins to meet thermal resistance requirements. In recent years, advancements in computational tools such as Computational Fluid Dynamics (CFD) and optimization algorithms, coupled with the advent of additive manufacturing technologies, have allowed engineers to expand conventional HX design ideologies to include such concepts as shape and topology optimization. This lends itself directly to primary heat transfer surface optimization and even the potential removal of finned surfaces altogether. This paper presents a comprehensive literature review investigating air-to-refrigerant HX shape and topology optimization. The fundamentals of both shape and topology optimization, model development, and experimental validations are all separately discussed. Studies featuring manufactured prototypes and/or experimentally validated optimal designs are treated with additional emphasis. This paper concludes by identifying key research gaps and proposing future research directions for HX shape and topology optimization.

42 ENGINEERING↗
DOE OSTI2024

Optimal operation of solid-oxide electrolysis cells considering long-term chemical degradation

Optimizing the performance of solid oxide electrolysis cells (SOECs) for long-term hydrogen (H 2 ) production at high temperatures is crucial, as prolonged operation leads to efficiency losses and shorter cell lifespans due to chemical degradation. Here, in this work, we adopt a quasi-steady state approach for dynamic optimization over extended operational periods to address the disparity in timescales between cell operation and degradation. Integrating a 2-D non-isothermal SOEC model with balance-of-plant (BOP) equipment, we explore three optimization objectives: minimizing terminal degradation, maximizing integral efficiency, and minimizing the levelized cost of H 2 (LCOH). Our dynamic optimization algorithm reduces LCOH by 9.5% and 16% compared to strategies focusing solely on terminal degradation and integral efficiency, respectively. For electricity prices of 0.03 $\$$/mWh and 0.3 $\$$ mWh optimal replacement schedules range from 5 to 2 years, depending on the operational mode. Furthermore, a flexible operational mode yields additional improvements in LCOH over traditional galvanostatic and potentiostatic modes.

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

Development and Application of a Risk Analysis Toolkit for Plant Resources Optimization

This report summarizes the R&D activities of the Risk Informed Asset Management (RIAM) project during fiscal year 2020 (FY20). This project focuses on the development of methods designed to optimize plant operations (e.g., maintenance/replacement schedule, optimal maintenance posture) provided system/component health/cost data. This project development lives in cooperation with the Plant Health Management (PHM) project which focuses on the development of methods that integrate component health data and propagate such information at the system level to evaluate most relevant sources of risk. This year’s activities for the RIAM project focused on the continuation of schedule optimization algorithms developed in FY19. While in FY19 we focused on both deterministic and stochastic capital budgeting methods, in FY20 we moved forward by implementing two versions of schedule optimization methods. The first one reformulates the capital budgeting problem in a distributionally robust form which allows the user to rely on data directly rather than proposing a distribution from the data itself. The second version reformulates the capital budgeting explicitly using risk measures as variables to maximize/minimize. Lastly, we focused on the development of methods designed to identify the optimal maintenance posture based on the Pareto Frontier analysis. Rather than performing a tradeoff analysis (i.e., identify the absolute best posture), the Pareto Frontier analysis performs a trade space exploration approach (i.e., identify value and costs of several postures and have the analyst perform the task of imposing desired value and cost constraints). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A scoping study of far-SOL main-wall protection limiters for steady-state operation of compact pilot plant tokamaks

We present a novel method for handling steady-state heat fluxes incident on the main wall of pilot plant-scale magnetic fusion devices, based on the utilization of protection limiters in the far scrape-off layer (SOL). This method helps avoid large plasma-wall gaps, without excessively compromising blanket performance. We present an optimization algorithm for determining the appropriate size and scale of these protection limiters given (1) probability distributions of SOL plasma parameters and (2) assumed risk tolerance. As part of this optimization, we have developed an analytic description of parallel heat fluxes across limiter shadows, and an objective cost function (the ‘Far-SOL Marginal Cost’) to quantify the impact that different main-wall thermal management design choices have on reactor capital cost. Applying the model to a midscale fusion pilot plant concept shows that making use of far-SOL protection limiters can reduce capital costs on the order of $500 M, relative to naively increasing the plasma-wall gap. Our analysis demonstrates that the far-SOL power decay length is the highest-leverage plasma assumption for thermal loading of the first wall, and the primary cost driver for main wall thermal management. The relative cost efficiency of protection limiters increases as assumptions on the far-SOL heat flux become more pessimistic. The concepts described in this paper motivate the further development of far-SOL protection limiters as part of larger efforts to design economical core-edge-wall compatible solutions for a fusion pilot plant.

Design under uncertainty↗
DOE OSTI2026

EASY-SHIFT v Alpha

The software is a generic, price- and load-responsive control algorithm integrating heat pumps with thermal energy storage. The algorithm leverages simple models of the system and easily accessible data to schedule operation of heat pumps and thermal energy storage in ways that minimize the cost of operating the heating/cooling system. This tool is specifically designed to be easy to interact with, and something that industry partners are able to adopt. There are two current state of the art approaches. Industry tends to develop very simple algorithms, with predetermined schedules that are not capable of changing operation in response to changes in operating environment. For example, a control designed to avoid high-price electricity from 5-8 PM will not be able to adapt if the high-price period changes to 4-9 PM. Academia commonly develops algorithms called Model predictive control (MPC). MPC requires extensive data and highly trained staff to develop a specific type of simulation model of the building, connect the building to optimization algorithms, and leverage powerful computers. Industry, with limited time/finance budgets for any project, is resistant to adopting MPC due to the associated high complexity and cost.

Grant, Peter [Lawrence Berkeley National Laborator↗
DOE OSTI2022

Component-wise reduced-order model design optimization such as for lattice design optimization

Systems and methods for optimizing a lattice structure design are disclosed herein. In some embodiments, a method for optimizing a lattice structure design can include (i) modeling the lattice structure with a component-wise reduced-order model (CWROM) and (ii) optimizing the CWROM based on a selected criterion using a topology optimization algorithm for lattice design. The selected criterion can include a boundary condition and a load applied to the lattice structure. By modeling the lattice structure as a CWROM, the optimization process can be very fast while still permitting the accurate computation of physical quantities of the lattice structure.

Choi, Youngsoo↗
DOE OSTI2020

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗
DOE OSTI2023

Fast Tuning-Free Distributed Algorithm for Solving the Network-Constrained Economic Dispatch

With the increasing penetration of distributed energy resources (DERs) and their participation in the electricity market, it becomes more desirable to apply distributed algorithms for resource allocation in order to address the resulting computational and communicational challenges. Most of the existing distributed algorithms for solving the network-constrained economic dispatch (NCED) problem require the tuning of certain auxiliary parameters. As a result, the robustness of these algorithms against the varieties in DERs is greatly undermined. In this paper, a new distributed algorithm, optimality condition consensus (OCC), is proposed to solve the NCED problem by using distributed power flow (DPF) and ratio consensus as fundamental tools. It inherits the advantages of existing distributed algorithms for the NCED problem but removes the need for parameter tuning to improve performance in practice. In conclusion, the effectiveness of the proposed distributed algorithm in terms of efficiency, scalability, and robustness is demonstrated through detailed case studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗