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 973 records · Page 54

Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery

Purpose: The authors propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization problem, and eliminates the need for a separate arc-sequencing step. Methods: In this model, a 360° arc is divided into a given number of arc segments in which the leaves move unidirectionally. This facilitates an algorithm that determines the optimal piecewise linear leaf trajectories for each arc segment, which are deliverable in a given treatment time. Multileaf collimator constraints, including maximum leaf speed and interdigitation, are accounted for explicitly. The algorithm is customized to allow for VMAT delivery using constant gantry speed and dose rate, however, the algorithm generalizes to variable gantry speed if beneficial. Results: The authors demonstrate the method for three different tumor sites: a head-and-neck case, a prostate case, and a paraspinal case. The authors first obtain a reference plan for intensity modulated radiotherapy (IMRT) using fluence map optimization and 20 intensity-modulated fields in equally spaced beam directions, which is beyond the standard of care. Modeling the typical clinical setup for the treatment sites considered, IMRT plans using seven or nine beams are also computed. Subsequently, VMAT plans are optimized by dividing the 360° arc into 20 corresponding arc segments. Assuming typical machine parameters (a dose rate of 600 MU/min, and a maximum leaf speed of 3 cm/s), it is demonstrated that the optimized VMAT plans with 2–3 min delivery time are of noticeably better quality than the 7–9 beam IMRT plans. The VMAT plan quality approaches the quality of the 20-beam IMRT benchmark plan for delivery times between 3 and 4 min. Conclusions: The results indicate that high quality treatments can be delivered in a single arc with 20 arc segments if sufficient time is allowed for modulation in each segment.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An energy-optimization method to study gel-swelling in confinement

Using our open-source programming environment Morpho, an energy-optimization method is developed to compute equilibrium shapes of an arbitrarily confined swollen hydrogel. The internal strains and contact forces are measured, probing its mechanics.

Joshi, Chaitanya↗

Sparsity Applications for Gradient‐Based Optimization of Wind Farms

Optimizing wind farms is essential for designing efficient energy systems, especially as farms grow larger and span multiple sites. However, this optimization becomes increasingly challenging due to the rising computational cost associated with more turbines. Gradient‐based optimization methods scale better than gradient‐free approaches for large problems, but the most computationally expensive component remains the calculation of gradients for the objective function and constraint Jacobians. To address this, we propose leveraging sparsity to accelerate gradient evaluations and reduce the size of the constraint Jacobian. Wind farms naturally exhibit sparsity—many turbines do not influence each other under certain wind directions. However, unlike traditional sparse problems with fixed patterns, wind farm sparsity is dynamic, requiring new strategies to handle changing interactions efficiently. This paper presents a study of sparsity in wind farm optimization and introduces several methods to exploit it. These strategies are tested on multiple farms using the analytic Cumulative Curl model, with gradients computed via automatic differentiation (AD). The same sparsity‐aware techniques are also applicable to finite difference (FD) methods, where they can yield even greater speedups due to the high cost of directional evaluations. Results show that sparse methods achieve up to a 10x speedup with less than ± 5% variance in optimized wake losses compared to traditional methods. These findings suggest that sparsity‐aware optimization not only maintains solution quality but also scales efficiently with farm size, enabling more comprehensive design exploration at reduced computational cost.

17 WIND ENERGY↗

Efficient Parameterization of Density Functional Tight-Binding for 5 f -Elements: A Th–O Case Study

Density functional tight binding (DFTB) models for f-element species are challenging to parametrize owing to the large number of adjustable parameters. The explicit optimization of the terms entering the semiempirical DFTB Hamiltonian related to f orbitals is crucial to generating a reliable parametrization for f-block elements, because they play import roles in bonding interactions. However, since the number of parameters grows quadratically with the number of orbitals, the computational cost for parameter optimization is much more expensive for the f-elements than for the main group elements. In this work we present a set of efficient approaches for mitigating the hurdle imposed by the large size of the parameter space. A novel group-by-orbital correction functions for two-center bond integrals was developed. With this approach the number of parameters is reduced, and it grows linearly with the number of elements, maintaining the accuracy and the number of parameters, in the case of f elements, by more than 40%. The parameter optimization step was accelerated by means of the mini-batch BFGS method. This method allows parameter optimizations with much larger training sets than other single batch methods. A stochastic optimizer was employed that helped overcome shallow local minima in the objective function. The proposed algorithm was used to parametrize the DFTB Hamiltonian for the Th–O system, which was subsequently applied to the study of ThO 2 nanoparticles. The training set consisted of 6322 unique structures, which is barely feasible with conventional optimization methods. The optimized parameter set, LANL-ThO, displays good agreement with DFT-calculated properties such as energies, forces, and structures for both clusters and bulk ThO 2 . Benefiting from the fewer number of parameters and lower computational costs for objective function evaluations, this new approach shows its potential applications in DFTB parametrization for elements with high angular momentum, which present a challenge to conventional methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Heuristic methods and performance bounds for photonic design

In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.

Angeris, Guillermo (ORCID:0000000249503990)↗

Optimal size of the block in block GMRES on GPUs: computational model and experiments

The block version of GMRES (BGMRES) is most advantageous over the single right hand side (RHS) counterpart when the cost of communication is high while the cost of floating point operations is not. This is the particular case on modern graphics processing units (GPUs), while it is generally not the case on traditional central processing units (CPUs). Here, in this paper, experiments on both GPUs and CPUs are shown that compare the performance of BGMRES against GMRES as the number of RHS increases, with a particular focus on GPU performance. The experiments indicate that there are many cases in which BGMRES is slower than GMRES on CPUs, but faster on GPUs. Furthermore, when varying the number of RHS on the GPU, there is an optimal number of RHS where BGMRES is clearly most advantageous over GMRES. A computational model for the GPU is developed using hardware specific parameters, providing insight towards how the qualitative behavior of BGMRES changes as the number of RHS increase, and this model also helps explain the phenomena observed in the experiments.

97 MATHEMATICS AND COMPUTING↗

Three-Photon Optical Pumping for Trapped Ion Quantum Computing

In this report we describe the testing of a novel scheme for state preparation of trapped ions in a quantum computing setup. This technique optimally would allow for similar precision and speed of state preparation while allowing for individual addressability of single ions in a chain using technology already available in a trapped ion experiment. As quantum computing experiments become more complicated, mid-experiment measurements will become necessary to achieve algorithms such as quantum error correction. Any mid-experiment measurement then requires the measured qubit to be re-prepared to a known quantum state. Currently this involves the protected qubits to be moved a sizeable distance away from the qubit being re-prepared which can be costly in terms of experiment length as well as introducing errors. Theoretical calculations predict that a three-photon process would allow for state preparation without qubit movement with similar efficiencies to current state preparation methods.

97 MATHEMATICS AND COMPUTING↗

Biomimetic model-based advanced control strategy integrated with multi-agent optimization for nonlinear chemical processes

Here, a novel framework is proposed for integrating biomimetic-based advanced control and multi-agent optimization approaches for nonlinear chemical process applications. In particular, a Biologically-Inspired Optimal Control Strategy, denoted as BIO-CS, is combined with multi-agent optimization (MAO) techniques to provide optimal solutions for dynamic systems. In this combined framework, the BIO-CS algorithm employs gradient-based optimal control solvers for the intermediate problems associated with the leader-follower agents’ local interactions. Also, the MAO uses the capabilities of heuristic-based optimization techniques by sharing process information to obtain optimal operating setpoints for the controller considering an overall process objective. The applicability of the proposed method is demonstrated using a nonlinear, multivariable, process model of a fermentation system. Specifically, the optimal operating points are computed by the MAO implementation for setpoint tracking, trajectory tracking and plant-model mismatch scenarios for BIO-CS application. Results of the developed framework are compared to a gradient-based Sequential Quadratic Programming (SQP) technique and a classical proportional-integral (PI) controller in terms of optimization and control studies, respectively. As an additional contribution, BIO-CS is also cast as a model predictive controller (MPC) for the first time and compared to the agent-based BIO-CS approach in terms of computational time and tracking error. Closed-loop control results show up to 46% improvement in tracking performance during transient for the multi-agent BIO-CS when compared to BIO-CS as MPC for additional computational expense. The obtained results illustrate the capabilities of this novel integrated framework including BIO-CS as MPC to achieve desired nonlinear system performance for various scenarios.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Machine Learning-Assisted Framework to Control Thermally Anisotropic Building Envelopes in Residential Buildings

To curb the energy consumption of buildings and their related CO2 emissions, Oak Ridge National Laboratory (ORNL) has developed the thermally anisotropic building envelope (TABE) —a multi-layer design comprising insulation materials and metal foils connected to thermal loops. In this study, a machine learning-assisted framework was developed to control the TABE in residential buildings to reduce the computation load for future optimal rule-based control and application. First, a 2D finite element model was established in COMSOL to calculate the hourly heat flux through exterior walls installed with the TABE. Then, TABE wall heat fluxes were simulated for various given indoor and outdoor boundary conditions, as well as thermal loops fluid temperatures and flow rates. Since the finite element simulations are computationally expensive, an artificial neural network (ANN) was then trained to use as a proxy of the finite element (COMSOL) modeling. Finally, the trained ANN model was coupled with the EnergyPlus model to predict the energy consumption of a US Department of Energy prototype single-family house installed with the TABE. An optimal simple rule-based control was determined from predefined rules for a case study. The results demonstrate that the developed machine learning–assisted framework can reduce 99.9% of the computation time while efficiently managing residential building energy for installed TABE walls.

Shen, Zhenglai↗

Design And Verification of Controllers for Coupled Bunch Instabilities Using Optimal Control Theory And Numerical Simulation: Predictions for PEP II

We present a technique for the design and verification of efficient bunch-by-bunch controllers for damping longitudinal multibunch instabilities. The controllers attempt to optimize the use of available feedback amplifier power - one of the most expensive components of a feedback system - and define the limits of the closed loop system performance. Our design technique alternates between analytic computation of single bunch optimal controllers and verification on a multibunch numerical simulator. The simulator uses PEP-II parameters and identifies unstable coupled bunch modes, their growth rates and their damping rates with feedback. The results from the simulator are shown to be in reasonable agreement with analytical calculations based on the single bunch model. The technique is then used to evaluate the performance of a variety of controllers proposed for PEP-II.

43 PARTICLE ACCELERATORS↗

Parallel DTFE Surface Density Field Reconstruction

We improve the interpolation accuracy and efficiency of the Delaunay tessellation field estimator (DTFE) for surface density field reconstruction by proposing an algorithm that takes advantage of the adaptive triangular mesh for line-of-sight integration. The costly computation of an intermediate 3D grid is completely avoided by our method and only optimally chosen interpolation points are computed, thus, the overall computational cost is significantly reduced. The algorithm is implemented as a parallel shared-memory kernel for large-scale grid rendered field reconstructions in our distributed-memory framework designed for N-body gravitational lensing simulations in large volumes. We also introduce a load balancing scheme to optimize the efficiency of processing a large number of field reconstructions. Our results show our kernel outperforms existing software packages for volume weighted density field reconstruction, achieving ~ 10x speedup, and our load balancing algorithm gains an additional ~ 3.6x speedup at scales with ~ 16k processes.

97 MATHEMATICS AND COMPUTING↗

Image processing and reconstruction [Slides]

This talk will examine some mathematical methods for image processing and the solution of underdetermined, linear inverse problems. The talk will have a tutorial flavor, mostly accessible to undergraduates, while still presenting research results. The primary approach is the use of optimization problems. We will find that relaxing the usual assumption of convexity will give us much better results.

97 MATHEMATICS AND COMPUTING↗

Optimization Algorithms for Hierarchical Problems, with Applications to Nanoporous Materials

The aim of the overall project was research to formulate and solve multi-scale optimization problems for energy storage applications. More specifically, we formulated multi-scale models for optimizing the internal structure of nanoporous materials, with the goal of developing models for related energy applications associated with sustainable sources of energy. The applications include supercapacitors, hydrogen storage, catalytic beds, and filters. The optimization algorithms we have developed can be applied to general hierarchical design problems arising from complex systems.

97 MATHEMATICS AND COMPUTING↗

Modeling Time-Dependent Surrogates of Additive-Manufactured Nuclear Fuels Processes

Additive manufacturing (AM) technology is being increasingly adopted in a wide variety of application areas for its ability to rapidly produce, prototype, and customize designs. Recently, a hybrid AM technique was successfully developed at Idaho National Laboratory (INL) to manufacture nuclear fuels [1]. Despite the advantages, this AM technique needs optimization due to defects from a highly complex melting and sintering process. The complex metallurgical phenomena during AM processes are strongly related to parameters such as applied laser power, traveling speed, and scan style, which could lead to differences in density, residual stress, crystallographic texture, and mechanical properties. In addition, stochastic variations in laser energy interaction and associated multiscale/multiphysics phenomena cause variations in microstructure evolution and mechanical properties. Currently, researchers at INL are focusing on developing a comprehensive modeling framework, leveraging INL’s simulation tools MOOSE/MARMOT/BISON/RAVEN [2-4] to describe all steps of this AM process across multiple length scales. Although this advanced framework plays a critical role in enabling enhancements to traditional trial and error approaches for design and optimization of nuclear fuel materials, it remains computationally intense, limiting its use in sensitivity and optimization analysis. In this case, an accurate and inexpensive surrogate becomes an effective tool for providing a tractable approximation of the underlying underline physics. Surrogate models generally not based on the physics of a system are purely mathematical models used to capture the relationships between specific system inputs and outputs. Popular approaches, including neural networks [5], response surfaces [6], and subspace-based reduced order models [7], have been applied to a wide range of disciplines, such as nuclear reactor design, aerospace design and automotive design. In this summary, we employ advanced time-dependent surrogate models such as high-dimensional model representation (HDMR) [8] and physics-informed deep neural network (PINNs) [9] to accelerate the design and optimization of AM process.

42 ENGINEERING↗

SU-D-BRD-01: Cloud-Based Radiation Treatment Planning: Performance Evaluation of Dose Calculation and Plan Optimization

Purpose: To report the first experience on the development of a cloud-based treatment planning system and investigate the performance improvement of dose calculation and treatment plan optimization of the cloud computing platform. Methods: A cloud computing-based radiation treatment planning system (cc-TPS) was developed for clinical treatment planning. Three de-identified clinical head and neck, lung, and prostate cases were used to evaluate the cloud computing platform. The de-identified clinical data were encrypted with 256-bit Advanced Encryption Standard (AES) algorithm. VMAT and IMRT plans were generated for the three de-identified clinical cases to determine the quality of the treatment plans and computational efficiency. All plans generated from the cc-TPS were compared to those obtained with the PC-based TPS (pc-TPS). The performance evaluation of the cc-TPS was quantified as the speedup factors for Monte Carlo (MC) dose calculations and large-scale plan optimizations, as well as the performance ratios (PRs) of the amount of performance improvement compared to the pc-TPS. Results: Speedup factors were improved up to 14.0-fold dependent on the clinical cases and plan types. The computation times for VMAT and IMRT plans with the cc-TPS were reduced by 91.1% and 89.4%, respectively, on average of the clinical cases compared to those with pc-TPS. The PRs were mostly better for VMAT plans (1.0 ≤ PRs ≤ 10.6 for the head and neck case, 1.2 ≤ PRs ≤ 13.3 for lung case, and 1.0 ≤ PRs ≤ 10.3 for prostate cancer cases) than for IMRT plans. The isodose curves of plans on both cc-TPS and pc-TPS were identical for each of the clinical cases. Conclusion: A cloud-based treatment planning has been setup and our results demonstrate the computation efficiency of treatment planning with the cc-TPS can be dramatically improved while maintaining the same plan quality to that obtained with the pc-TPS. This work was supported in part by the National Cancer Institute (1R01 CA133474) and by Leading Foreign Research Institute Recruitment Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (MSIP) (Grant No.2009-00420)

60 APPLIED LIFE SCIENCES↗

Efficient Ensemble-Based Stochastic Gradient Methods for Optimization Under Geological Uncertainty

Ensemble-based stochastic gradient methods, such as the ensemble optimization (EnOpt) method, the simplex gradient (SG) method, and the stochastic simplex approximate gradient (StoSAG) method, approximate the gradient of an objective function using an ensemble of perturbed control vectors. These methods are increasingly used in solving reservoir optimization problems because they are not only easy to parallelize and couple with any simulator but also computationally more efficient than the conventional finite-difference method for gradient calculations. In this work, we show that EnOpt may fail to achieve sufficient improvement of the objective function when the differences between the objective function values of perturbed control variables and their ensemble mean are large. On the basis of the comparison of EnOpt and SG, we propose a hybrid gradient of EnOpt and SG to save on the computational cost of SG. We also suggest practical ways to reduce the computational cost of EnOpt and StoSAG by approximating the objective function values of unperturbed control variables using the values of perturbed ones. We first demonstrate the performance of our improved ensemble schemes using a benchmark problem. Results show that the proposed gradients saved about 30–50% of the computational cost of the same optimization by using EnOpt, SG, and StoSAG. As a real application, we consider pressure management in carbon storage reservoirs, for which brine extraction wells need to be optimally placed to reduce reservoir pressure buildup while maximizing the net present value. Results show that our improved schemes reduce the computational cost significantly.

58 GEOSCIENCES↗

Assessment of Model-Based Schemes for Accelerating Optimization by RAVEN

Nuclear-Renewable Hybrid Energy Systems (N-R HES) combine different energy technologies in a synergistic way with the objective of achieving a more economical energy production. In this report the particular hybrid system dealt with includes a PWR nuclear reactor, the associated Rankine-based energy conversion cycle (Balance of Plant, BOP), an Industrial Process (IP) for hydrogen production, a gas turbine (Second Energy Source, SES), and a battery (Energy Storage, ES). The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the N-R HES. HYBRID solves the coupled capacity planning-economic and dispatch optimization problem with the objective of minimizing the Levelized Cost of Electricity (LCOE). In the optimization of the power dispatch strategy, the HYBRID framework takes into account the time-dependent dynamics of each subsystem by including a Dymola object-oriented model of the process dynamics. To ease the computational burden of the optimization process, an initial guess for the dispatch optimization problem is provided by a preconditioner. The solution guess is calculated by means of a least-marginal cost approach which applies the same criterion behind the screening curve method. Though this algorithm allows evaluating an economically adapted generation mix for a target load duration curve within a few seconds, it neglects the constraints due to the single component dynamics, and it is not able to adequately represent the ES. An improved treatment of the pre-conditioner problem was addressed by introducing a Monte Carlo based optimization algorithm. The new approach takes into account limits on power rates for the system subcomponents, which was not previously done. Additionally, this new Monte-Carlo based preconditioner addresses the problem with the ES component through improved modeling of that component. The new algorithm has been implemented in the HYBRID framework and tested to assess its performance. The results obtained with the new Monte Carlobased preconditioner were benchmarked against those obtained through the reference deterministic approach. The comparison shows that the Monte-Carlo based approach provides improved solution accuracy to the power dispatch optimization problem. Also in this report, the treatment of the penalty function on LCOE is discussed, and an improved penalty function for missed demand is suggested and tested.

Maronati, Giovanni↗

SU-E-T-175: Clinical Evaluations of Monte Carlo-Based Inverse Treatment Plan Optimization for Intensity Modulated Radiotherapy

Purpose: Pencil-beam or superposition-convolution type dose calculation algorithms are routinely used in inverse plan optimization for intensity modulated radiation therapy (IMRT). However, due to their limited accuracy in some challenging cases, e.g. lung, the resulting dose may lose its optimality after being recomputed using an accurate algorithm, e.g. Monte Carlo (MC). It is the objective of this study to evaluate the feasibility and advantages of a new method to include MC in the treatment planning process. Methods: We developed a scheme to iteratively perform MC-based beamlet dose calculations and plan optimization. In the MC stage, a GPU-based dose engine was used and the particle number sampled from a beamlet was proportional to its optimized fluence from the previous step. We tested this scheme in four lung cancer IMRT cases. For each case, the original plan dose, plan dose re-computed by MC, and dose optimized by our scheme were obtained. Clinically relevant dosimetric quantities in these three plans were compared. Results: Although the original plan achieved a satisfactory PDV dose coverage, after re-computing doses using MC method, it was found that the PTV D95% were reduced by 4.60%–6.67%. After re-optimizing these cases with our scheme, the PTV coverage was improved to the same level as in the original plan, while the critical OAR coverages were maintained to clinically acceptable levels. Regarding the computation time, it took on average 144 sec per case using only one GPU card, including both MC-based beamlet dose calculation and treatment plan optimization. Conclusion: The achieved dosimetric gains and high computational efficiency indicate the feasibility and advantages of the proposed MC-based IMRT optimization method. Comprehensive validations in more patient cases are in progress.

60 APPLIED LIFE SCIENCES↗