Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient based 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 433 records · Page 24

Transient Growth Theory Prediction of Optimal Placing of Passive and Active Flow Control Devices for Separation Delay in LPT Airfoils

An analysis of the non-modal growth of perturbations in a boundary layer in the presence of a streamwise pressure gradient is presented. The analysis is based on PSE equations for an incompressible fluid. Examples with Falkner-Skan profiles indicate that a favorable pressure gradient decreases the non-modal growth while an unfavorable pressure gradient leads to an increase of the amplification. It is suggested that the transient growth mechanism be utilized to choose optimal parameters of tripping elements on a low-pressure turbine (LPT) airfoil. As an example, a boundary layer flow with a streamwise pressure gradient corresponding to the pressure distribution over a LPT airfoil is considered. It is shown that there is an optimal spacing of the tripping elements and that the transient growth effect depends on the starting point. At very low Reynolds numbers, there is a possibility to enhance the transient energy growth by means of wall cooling.

Tumin, Anatoli↗

Optimizing $\mathrm{ACRT}$ to reduce inclusion formation during the $\mathrm{VGF}$ growth of cadmium zinc telluride: II. Application to experiments

Here two different accelerated crucible rotation technique (ACRT) rotation schedules are assessed, via theoretical computations and growth experiments, according to their ability to reduce tellurium-rich inclusions during the vertical gradient freeze (VGF) of cadmium zinc telluride (CZT). A vigorous rotation schedule based on classical ACRT guidelines produces a well-mixed melt that is expected to reduce tellurium inclusions compared to growth without crucible rotation. In contrast, a new ACRT schedule, derived from model-based optimization for interface stability, employs slower rotation with longer periods and is predicted to further reduce inclusions. Growth experiments corroborate these expectations. Namely, both ACRT schedules result in crystals with inclusion size and volume significantly decreased from levels found in material grown with no rotation, and material grown using the computationally optimized ACRT parameters exhibits a median inclusion size that is smaller and with a sharper distribution than in material grown via classical ACRT.

36 MATERIALS SCIENCE↗

Intelligent multi-zone residential HVAC control strategy based on deep reinforcement learning

Residential heating, ventilation, and air conditioning (HVAC) has been considered as an important demand response resource. However, the optimization of residential HVAC control is no trivial task due to the complexity of the thermal dynamic models of buildings and uncertainty associated with both occupant-driven heat loads and weather forecasts. In this paper, we apply a novel model-free deep reinforcement learning (RL) method, known as the deep deterministic policy gradient (DDPG), to generate an optimal control strategy for a multi-zone residential HVAC system with the goal of minimizing energy consumption cost while maintaining the users’ comfort. Here, the applied deep RL-based method learns through continuous interaction with a simulated building environment and without referring to any prior model knowledge. Simulation results show that compared with the state-of-art deep Q network (DQN), the DDPG-based HVAC control strategy can reduce the energy consumption cost by 15% and reduce the comfort violation by 79%; and when compared with a rule-based HVAC control strategy, the comfort violation can be reduced by 98%. In addition, experiments with different building models and retail price models demonstrate that the well-trained DDPG-based HVAC control strategy has high generalization and adaptability to unseen environments, which indicates its practicability for real-world implementation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

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↗

Multi-task deep reinforcement learning for intelligent multi-zone residential HVAC control

In this short communication, a data-driven deep reinforcement learning (deep RL) method is applied to minimize HVAC users’ energy consumption costs while maintaining users’ comfort. The applied deep RL method's efficiency is enhanced by conducting multi-task learning that can achieve an economic control strategy for a multi-zone residential HVAC system in both cooling and heating scenarios. The applied multi-task deep RL method is compared with a rule-based benchmark case and a single-task deep deterministic policy gradient algorithm to verify its effective and generalized application in optimizing HVAC operation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Four Years of Atmospheric Boundary Layer Height Retrievals Using COSMIC-2 Satellite Data

This work aimed to study the atmospheric boundary layer height (ABLH) from COSMIC-2 refractivity data, endeavoring to refine existing ABLH detection algorithms and scrutinize the resulting spatial and seasonal distributions. Through validation analyses involving different ground-based methodologies (involving data from lidar, ceilometer, microwave radiometers, and radiosondes), the optimal ABLH determination relied on identifying the lowest refractivity gradient negative peak with a magnitude at least $τ$% times the minimum refractivity gradient magnitude, where $τ$ is a fitting parameter representing the minimum peak strength relative to the absolute minimum refractivity gradient. Different $τ$ values were derived accounting for the moment of the day (daytime, nighttime, or sunrise/sunset) and the underlying surface (land or sea). Results show discernible relations between ABLH and various features, notably, the land cover and latitude. On average, ABLH is higher over oceans (≈1.5 km), but extreme values (maximums > 2.5 km, and minimums < 1 km) are reached over intertropical lands. Variability is generally subtle over oceans, whereas seasonality and daily evolution are pronounced over continents, with higher ABLHs during daytime and local wintertime (summertime) in intertropical (middle) latitudes.

54 ENVIRONMENTAL SCIENCES↗

MODELING AND OPTIMIZATION OF A PCM-BASED OCEAN THERMAL ENERGY HARVESTER FOR POWERING UNMANNED UNDERWATER VEHICLES

As oceans cover over 70% of the planet’s surface, they represent a large reservoir of resources that remained vastly untapped. Uncrewed Underwater Vehicles (UUVs) are becoming key technology for ocean exploration. Ocean thermal gradient is a permanent and reliable energy source that can be used to power UUVs using phase change material (PCM)-based thermal engines. However, the main drawback of this technology is its low conversion efficiency. When using PCM-based thermal engines to power UUVs, there are different energy conversion stages, thermal-hydraulic, hydraulic-kinetic, kinetic-electrical, dependent of a wide variety of parameters. Thus, optimization of the overall energy conversion is still a challenge for powering the increasing energy demanding UUVs for long missions. The goal of this study is to propose a PCM-based ocean thermal energy harvesting system for powering the Solo II float. Using the ocean thermal energy reduces the cost for battery replacement and expands the float’s mission time. For this purpose, we developed a multiphysics model for a system consisting of thermal material, hydraulic, and electrical systems. This system is designed to provide the electrical power needed for the instruments aboard the underwater vehicle. The models of the hydraulic and the electric systems are implemented in MATLAB-Simulink/Simscape environment. The final model developed can provide 13.66 kJ of electrical energy, which is more than 1.5 times the energy requirement per cycle for the SOLO II float.

Ouro-Koura, Habilou↗

An optimization-based approach to parameter learning for fractional type nonlocal models

Nonlocal operators of fractional type are a popular modeling choice for applications that do not adhere to classical diffusive behavior; however, one major challenge in nonlocal simulations is the selection of model parameters. In this study we propose an optimization-based approach to parameter identification for fractional models with an optional truncation radius. We formulate the inference problem as an optimal control problem where the objective is to minimize the discrepancy between observed data and an approximate solution of the model, and the control variables are the fractional order and the truncation length. For the numerical solution of the minimization problem we propose a gradient-based approach, where we enhance the numerical performance by an approximation of the bilinear form of the state equation and its derivative with respect to the fractional order. Several numerical tests in one and two dimensions illustrate the theoretical results and show the robustness and applicability of our method.

97 MATHEMATICS AND COMPUTING↗

An optimization-based approach to parameter learning for fractional type nonlocal models

Nonlocal operators of fractional type are a popular modeling choice for applications that do not adhere to classical diffusive behavior; however, one major challenge in nonlocal simulations is the selection of model parameters. In this work we propose an optimization-based approach to parameter identification for fractional models with an optional truncation radius. We formulate the inference problem as an optimal control problem where the objective is to minimize the discrepancy between observed data and an approximate solution of the model, and the control variables are the fractional order and the truncation length. For the numerical solution of the minimization problem we propose a gradient-based approach, where we enhance the numerical performance by an approximation of the bilinear form of the state equation and its derivative with respect to the fractional order. Several numerical tests in one and two dimensions illustrate the theoretical results and show the robustness and applicability of our method.

97 MATHEMATICS AND COMPUTING↗

Optimization techniques in self-similar compressible flow

We investigate the one-dimensional (1D) inviscid compressible flow equations for an ideal gas through the lens of optimization techniques. It is the case that, to our knowledge, optimization analysis applied to the so-called “linear velocity” solutions of the Euler compressible flow equations has not been previously conducted. Through both gradient-based and variational techniques, new variants of well-studied flow scenarios, i.e., self-similar, 1D, linear velocity solution class to idealized inviscid compressible flow equations, are determined, as encoded in both the kinematic and thermodynamic properties of this self-similar solution class. With the kinematics of the said solutions being driven by a self-similar “scale radius” and the thermodynamics being driven separately through the appearance of an arbitrary function, a myriad of new solution classes is possible. Acting as a guide to more realistic physical circumstances as well as discovery, it is the hope that the presented cases serve as the framework for future investigations into the intersection of self-similarity and optimization techniques. Fields of study that may find this work to be of interest include aerodynamic design, flow control, inertial confinement fusion, physics-informed neural networks, and other related areas of interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Image Correlation Pattern Optimization for Micro-Scale In-Situ Strain Measurements

The accuracy and precision of digital image correlation (DIC) is a function of three primary ingredients: image acquisition, image analysis, and the subject of the image. Development of the first two (i.e. image acquisition techniques and image correlation algorithms) has led to widespread use of DIC; however, fewer developments have been focused on the third ingredient. Typically, subjects of DIC images are mechanical specimens with either a natural surface pattern or a pattern applied to the surface. Research in the area of DIC patterns has primarily been aimed at identifying which surface patterns are best suited for DIC, by comparing patterns to each other. Because the easiest and most widespread methods of applying patterns have a high degree of randomness associated with them (e.g., airbrush, spray paint, particle decoration, etc.), less effort has been spent on exact construction of ideal patterns. With the development of patterning techniques such as microstamping and lithography, patterns can be applied to a specimen pixel by pixel from a patterned image. In these cases, especially because the patterns are reused many times, an optimal pattern is sought such that error introduced into DIC from the pattern is minimized. DIC consists of tracking the motion of an array of nodes from a reference image to a deformed image. Every pixel in the images has an associated intensity (grayscale) value, with discretization depending on the bit depth of the image. Because individual pixel matching by intensity value yields a non-unique scale-dependent problem, subsets around each node are used for identification. A correlation criteria is used to find the best match of a particular subset of a reference image within a deformed image. The reader is referred to references for enumerations of typical correlation criteria. As illustrated by Schreier and Sutton and Lu and Cary systematic errors can be introduced by representing the underlying deformation with under-matched shape functions. An important implication, as discussed by Sutton et al., is that in the presence of highly localized deformations (e.g., crack fronts), error can be reduced by minimizing the subset size. In other words, smaller subsets allow the more accurate resolution of localized deformations. Contrarily, the choice of optimal subset size has been widely studied and a general consensus is that larger subsets with more information content are less prone to random error. Thus, an optimal subset size balances the systematic error from under matched deformations with random error from measurement noise. The alternative approach pursued in the current work is to choose a small subset size and optimize the information content within (i.e., optimizing an applied DIC pattern), rather than finding an optimal subset size. In the literature, many pattern quality metrics have been proposed, e.g., sum of square intensity gradient (SSSIG), mean subset fluctuation, gray level co-occurrence, autocorrelation-based metrics, and speckle-based metrics. The majority of these metrics were developed to quantify the quality of common pseudo-random patterns after they have been applied, and were not created with the intent of pattern generation. As such, it is found that none of the metrics examined in this study are fit to be the objective function of a pattern generation optimization. In some cases, such as with speckle-based metrics, application to pixel by pixel patterns is ill-conditioned and requires somewhat arbitrary extensions. In other cases, such as with the SSSIG, it is shown that trivial solutions exist for the optimum of the metric which are ill-suited for DIC (such as a checkerboard pattern). In the current work, a multi-metric optimization method is proposed whereby quality is viewed as a combination of individual quality metrics. Specifically, SSSIG and two auto-correlation metrics are used which have generally competitive objectives. Thus, each metric could be viewed as a constraint imposed upon the others, thereby precluding the achievement of their trivial solutions. In this way, optimization produces a pattern which balances the benefits of multiple quality metrics. The resulting pattern, along with randomly generated patterns, is subjected to numerical deformations and analyzed with DIC software. The optimal pattern is shown to outperform randomly generated patterns.

Bomarito, G. F.↗

A Comparative Study of Probability Collectives Based Multi-agent Systems and Genetic Algorithms

We compare Genetic Algorithms (GA's) with Probability Collectives (PC), a new framework for distributed optimization and control. In contrast to GA's, PC-based methods do not update populations of solutions. Instead they update an explicitly parameterized probability distribution p over the space of solutions. That updating of p arises as the optimization of a functional of p. The functional is chosen so that any p that optimizes it should be p peaked about good solutions. The PC approach works in both continuous and discrete problems. It does not suffer from the resolution limitation of the finite bit length encoding of parameters into GA alleles. It also has deep connections with both game theory and statistical physics. We review the PC approach using its motivation as the information theoretic formulation of bounded rationality for multi-agent systems. It is then compared with GA's on a diverse set of problems. To handle high dimensional surfaces, in the PC method investigated here p is restricted to a product distribution. Each distribution in that product is controlled by a separate agent. The test functions were selected for their difficulty using either traditional gradient descent or genetic algorithms. On those functions the PC-based approach significantly outperforms traditional GA's in both rate of descent, trapping in false minima, and long term optimization.

Huang, Chien-Feng↗

Grid sensitivity for aerodynamic optimization and flow analysis

After reviewing relevant literature, it is apparent that one aspect of aerodynamic sensitivity analysis, namely grid sensitivity, has not been investigated extensively. The grid sensitivity algorithms in most of these studies are based on structural design models. Such models, although sufficient for preliminary or conceptional design, are not acceptable for detailed design analysis. Careless grid sensitivity evaluations, would introduce gradient errors within the sensitivity module, therefore, infecting the overall optimization process. Development of an efficient and reliable grid sensitivity module with special emphasis on aerodynamic applications appear essential. The organization of this study is as follows. The physical and geometric representations of a typical model are derived in chapter 2. The grid generation algorithm and boundary grid distribution are developed in chapter 3. Chapter 4 discusses the theoretical formulation and aerodynamic sensitivity equation. The method of solution is provided in chapter 5. The results are presented and discussed in chapter 6. Finally, some concluding remarks are provided in chapter 7.

Sadrehaghighi, I.↗

A backward SDE method for uncertainty quantification in deep learning

Here, we develop a backward stochastic differential equation based probabilistic machine learning method, which formulates a class of stochastic neural networks as a stochastic optimal control problem. An efficient stochastic gradient descent algorithm is introduced with the gradient computed through a backward stochastic differential equation. Convergence analysis for stochastic gradient descent optimization and numerical experiments for applications of stochastic neural networks are carried out to validate our methodology in both theory and performance.

97 MATHEMATICS AND COMPUTING↗

Accelerating Continuous Variable Coherent Ising Machines Via Momentum

The Coherent Ising Machine (CIM) is a non-conventional architecture that takes inspiration from physical annealing processes to solve Ising problems heuristically. Its dynamics are naturally continuous and described by a set of ordinary differential equations that have been proven to be useful for the optimization of continuous variables nonconvex quadratic optimization problems. The dynamics of such Continuous Variable CIMs (CV-CIM) encourage optimization via optical pulses whose amplitudes are determined by the negative gradient of the objective; however, standard gradient descent is known to be trapped by local minima and hampered by poor problem conditioning. In this work, we propose to modify the CV-CIM dynamics using more sophisticated pulse injections based on tried-and-true optimization techniques such as momentum and Adam. Through numerical experiments, we show that the momentum and Adam updates can significantly speed up the CV-CIM’s convergence and improve sample diversity over the original CV-CIM dynamics. We also find that the Adam-CV-CIM’s performance is more stable as a function of feedback strength, especially on poorly conditioned instances, resulting in an algorithm that is more robust, reliable, and easily tunable. More broadly, we identify the CIM dynamical framework as a fertile opportunity for exploring the intersection of classical optimization and modern analog computing.

Ising Model↗

Comprehensive assessment of deep reinforcement learning approaches for economic dispatch in nuclear-driven microgrids

As the electrical grid integrates more variable renewable energy sources such as wind and solar, the demand for distributed and flexible systems to address this increased variability becomes critical. Nuclear-driven microgrids provide a promising solution by offering stable generation to complement intermittent renewables, ensuring grid reliability and operating efficiency. This paper proposes a recurrent deep reinforcement learning framework for optimal economic dispatch in a nuclear-powered microgrid integrating renewable energy sources, small modular reactors, battery storage systems, and balance-of-plant dynamics. A three-agent control architecture is developed, where demand and renewable energy agents act as forecasters, and a reinforcement learning-based dispatch agent performs real-time energy allocation. A nonlinear programming formulation is first used to generate an optimal baseline for benchmarking. The proposed dispatch controller, based on Proximal Policy Optimization enhanced with Long Short-Term Memory networks, exploits temporal correlations in system dynamics by taking advantage of the time series used as inputs to improve policy robustness under uncertainty. Comparative analysis against established deep reinforcement learning methods, including Proximal Policy Optimization with a feedforward architecture, Soft Actor-Critic, and Twin Delayed Deep Deterministic Policy Gradient, demonstrates superior performance. Numerical results indicate that the proposed controller achieves a 0.39% cost reduction relative to the nonlinear programming benchmark and outperforms other learning-based methods by generating additional revenue of up to 0.35%. All reinforcement learning controllers compute dispatch actions in less than 0.3 s, resulting in a computational speedup of more than three orders of magnitude over the nonlinear programming baseline. The findings of this paper highlight their applicability for real-time operation and control in nuclear-integrated microgrids under volatile operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

HPC-Enabled Optimization of High Temperature Heat Exchangers (CRADA Final Report)

This project was a collaborative effort between Lawrence Livermore National Security, LLC (LLNS) as manager and operator of Lawrence Livermore National Laboratory (LLNL) and Materials Sciences, LLC, to develop a technology for design and optimization of heat exchangers using powerful desktop and laptop computers. The project was originally designated as a 12-month project, and consisted of 3# major tasks and the following 8# major deliverables: 1) CFD models of 3D heat exchangers based on existing and new geometry. 2) Validation against experimental data provided by MSC and published in the literature. 3) CFD models of 3D unit cells based on TPMS. 4) Surrogate models capable of delivering the gradients of the homogenized properties with respect to the parametrization. 5) 3D design methodology using TO algorithms. 6) Conventional reference and topology optimized designs. 7) 3D optimized designs stored in a 3D printer build format. 8) Verification of the improved performance. All of the deliverables for this project were successfully completed with two no-cost time extensions.

36 MATERIALS SCIENCE↗