Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization algorithm”

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

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

At least 865 records · Page 48

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↗

An Adaptive Unified Differential Evolution Algorithm for Global Optimization

In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

43 PARTICLE ACCELERATORS↗

Sensitivity study of voxel-based PET image comparison to image registration algorithms

Purpose: Accurate deformable registration is essential for voxel-based comparison of sequential positron emission tomography (PET) images for proper adaptation of treatment plan and treatment response assessment. The comparison may be sensitive to the method of deformable registration as the optimal algorithm is unknown. This study investigated the impact of registration algorithm choice on therapy response evaluation. Methods: Sixteen patients with 20 lung tumors underwent a pre- and post-treatment computed tomography (CT) and 4D FDG-PET scans before and after chemoradiotherapy. All CT images were coregistered using a rigid and ten deformable registration algorithms. The resulting transformations were then applied to the respective PET images. Moreover, the tumor region defined by a physician on the registered PET images was classified into progressor, stable-disease, and responder subvolumes. Particularly, voxels with standardized uptake value (SUV) decreases >30% were classified as responder, while voxels with SUV increases >30% were progressor. All other voxels were considered stable-disease. The agreement of the subvolumes resulting from difference registration algorithms was assessed by Dice similarity index (DSI). Coefficient of variation (CV) was computed to assess variability of DSI between individual tumors. Root mean square difference (RMS{sub rigid}) of the rigidly registered CT images was used to measure the degree of tumor deformation. RMS{sub rigid} and DSI were correlated by Spearman correlation coefficient (R) to investigate the effect of tumor deformation on DSI. Results: Median DSI{sub rigid} was found to be 72%, 66%, and 80%, for progressor, stable-disease, and responder, respectively. Median DSI{sub deformable} was 63%–84%, 65%–81%, and 82%–89%. Variability of DSI was substantial and similar for both rigid and deformable algorithms with CV > 10% for all subvolumes. Tumor deformation had moderate to significant impact on DSI for progressor subvolume with R{sub rigid} = − 0.60 (p = 0.01) and R{sub deformable} = − 0.46 (p = 0.01–0.20) averaging over all deformable algorithms. For stable-disease subvolumes, the correlations were significant (p < 0.001) for all registration algorithms with R{sub rigid} = − 0.71 and R{sub deformable} = − 0.72. Progressor and stable-disease subvolumes resulting from rigid registration were in excellent agreement (DSI > 70%) for RMS{sub rigid} < 150 HU. However, tumor deformation was observed to have negligible effect on DSI for responder subvolumes with insignificant |R| < 0.26, p > 0.27. Conclusions: This study demonstrated that deformable algorithms cannot be arbitrarily chosen; different deformable algorithms can result in large differences of voxel-based PET image comparison. For low tumor deformation (RMS{sub rigid} < 150 HU), rigid and deformable algorithms yield similar results, suggesting deformable registration is not required for these cases.

60 APPLIED LIFE SCIENCES↗

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↗

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↗

Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling--based theoretical analysis for a regularized $\ell^1$ minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors) and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter and empirically produces superior results. Lastly, our numerical results test our framework on several medium to high dimensional examples of solutions to parameterized differential equations and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Matlab Code for Multiscale Topology Optimization

This Matlab script implements a simple topology optimization algorithm that minimizes the compliance of a structure within a 3D prismatic design domain. It uses a simple linear elastic finite element solver to solve the equilibrium equations, and the optimality criterion (00) method to update the design iteratively. This functionality is identical to, or the simplest possible extension from 2D to 3D of, a 99-line Matlab code released in 2001 in a journal article by Sigmund. What is new in this code is our implementation of simple surrogate models for several truss micro-architectures, which converts this code to a multiscale design tool, whereas the original code is single-scale. The development of these surrogate models and their implementation is described in a journal article we intend to submit. We plan to include the full source code in an Appendix in this paper. The code’s primary function is as a pedagogical tool rather than as a finished software product. Sigmund’s 2001 paper describes the implementation line-by-line. We are including this updated version of the code to allow the reader to understand exactly what changes must be made to a “standard” topology optimization code to implement the surrogate models and thus multiscale design optimization.

Watts, Seth↗

Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations

The recovery of approximately sparse or compressible coefficients in a polynomial chaos expansion is a common goal in many modern parametric uncertainty quantification (UQ) problems. However, relatively little effort in UQ has been directed toward theoretical and computational strategies for addressing the sparse corruptions problem, where a small number of measurements are highly corrupted. Such a situation has become pertinent today since modern computational frameworks are sufficiently complex with many interdependent components that may introduce hardware and software failures, some of which can be difficult to detect and result in a highly polluted simulation result. In this paper we present a novel compressive sampling-based theoretical analysis for a regularized t1 minimization algorithm that aims to recover sparse expansion coefficients in the presence of measurement corruptions. Our recovery results are uniform (the theoretical guarantees hold for all compressible signals and compressible corruptions vectors), and prescribe algorithmic regularization parameters in terms of a user-defined a priori estimate on the ratio of measurements that are believed to be corrupted. We also propose an iteratively reweighted optimization algorithm that automatically refines the value of the regularization parameter, and empirically produces superior results. Our numerical results test our framework on several medium-to-high dimensional examples of solutions to parameterized differential equations, and demonstrate the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Transport Analysis & Optimization in a MW-Scale CO2 Electrolyzer (Final Report)

As Twelve continues to scale up their CO2 electrolyzers, both in the size of a single cell and in the number of cells used in a stack, thermal management becomes a growing concern, since excess heat can affect reaction yield and accelerate degradation. In this project, we aim to computationally explore how the anode flow fields used in Twelve’s CO2 electrolyzers function as heat exchangers. In particular, using a homogenized model of a CO2 electrolyzer, we first estimate the amount of heat generated in a cell. Then, we develop a computational fluid dynamics (CFD) model of the so-called “flow field”, i.e. a flow manifold, based on Twelve’s CAD drawings, to evaluate how these flow fields perform as a heat exchanger for the generated heat. We explore both a single cell and a 3-cell stack operating in parallel, where heat generated in one cell can now be transferred to another cell. We evaluate how performance is affected when environmental heat losses are taken into account. Finally, we leverage topology optimization to explore the types of design features a computational optimization algorithm would suggest to supplement our intuition. Overall, our work aims to provide design recommendations for CO2 electrolyzer flow fields and provides a foundation for future studies of flow field optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Dual structural-control optimization of large space structures

A new approach is proposed for solving dual structural-control optimization problems for high-order flexible space structures where reduced-order structural models are employed. For a given initial structural dessign, a quadratic control cost is minimized subject to a constant-mass constraint. The sensitivity of the optimal control cost with respect to the stuctural design variables is then determined and used to obtain successive structural redesigns using a contrained gradient optimization algorithm. This process is repeated until the constrained control cost sensitivity becomes negligible. A numerical example is presented which demonstrates that this new approach effectively addresses the problem of dual optimization for potentially very high-order structures.

Messac, A.↗

Three-Dimensional Trajectory Design for Reducing Climate Impact of Trans-Atlantic Flights

The impact of aircraft emissions and contrails on the environment adds an additional aspect to aircraft trajectory optimization. This study developed a three-dimensional trajectory optimization algorithm for trans-Atlantic flights in cruise to generate aircraft trajectories that minimize environmental impacts due to CO2 emissions and contrails in the presence of winds. The climate-optimal trajectory is developed using dynamic programming that adjusts a wind-optimal aircraft heading while determining the optimal locations, altitudes and times for en-route step climbs. Flying wind-optimal routes minimize aircraft travel time, fuel burn and associated emissions during cruise while adjusting aircraft heading and en-route step climbs at the optimal locations and times minimize climate impact of contrails. This capability integrates an air traffic management simulation with aircraft fuel burn and emissions models, contrail formation and dispersion models, simplified climate response models, and a common climate metric. A study was conducted to evaluate the potential cost and benefits of flying climate-optimal routes in North Atlantic Airspace and their impacts to the Organized Track System design based on the trans-Atlantic air traffic during a day, July 12, 2012. Results show eastbound flights achieved a larger environmental benefit with less additional fuel burn than westbound flights that operated in strong headwinds that caused more additional fuel burn and aircraft emissions to avoid traversing contrails favorable regions.

climate impact of aviation↗

OPTIMIZATION-BASED CONSTITUTIVE PARAMETER IDENTIFICATION FROM SPARSE TAYLOR CYLINDER DATA

The classic Taylor impact test imparts temporally and spatially varying fields of strain, strain rate, and temperature through the specimen. It is possible to exploit this complexity to directly identify constitutive model parameters from the deformed shape of the specimen. Where prior investigators have employed various mathematical fitting methods to identify or improve strength model parameters from Taylor cylinder profiles, we extend the method to employ a multi-objective genetic optimization algorithm to minimize the cylinder profile errors simultaneously on three cylinders impacted at different velocities. No experimental data other than the three Taylor cylinders is employed in developing the constitutive model parameter set, and generic starting coefficients are employed. To validate the accuracy of the resulting coefficients, both split Hopkinson pressure bar and axisymmetric expanding ring tests were conducted and compared to the resultant Johnson-Cook strength model. The derived strength model agreed well with experimental data available to date. Further work is necessary to evaluate the range of rates and temperatures over which parameters derived by this method may be applied.

97 MATHEMATICS AND COMPUTING↗

A unified statistical framework for material decomposition using multienergy photon counting x-ray detectors

Purpose: Material decomposition using multienergy photon counting x-ray detectors (PCXD) has been an active research area over the past few years. Even with some success, the problem of optimal energy selection and three material decomposition including malignant tissue is still on going research topic, and more systematic studies are required. This paper aims to address this in a unified statistical framework in a mammographic environment.Methods: A unified statistical framework for energy level optimization and decomposition of three materials is proposed. In particular, an energy level optimization algorithm is derived using the theory of the minimum variance unbiased estimator, and an iterative algorithm is proposed for material composition as well as system parameter estimation under the unified statistical estimation framework. To verify the performance of the proposed algorithm, the authors performed simulation studies as well as real experiments using physical breast phantom and ex vivo breast specimen. Quantitative comparisons using various performance measures were conducted, and qualitative performance evaluations for ex vivo breast specimen were also performed by comparing the ground-truth malignant tissue areas identified by radiologists.Results: Both simulation and real experiments confirmed that the optimized energy bins by the proposed method allow better material decomposition quality. Moreover, for the specimen thickness estimation errors up to 2 mm, the proposed method provides good reconstruction results in both simulation and real ex vivo breast phantom experiments compared to existing methods.Conclusions: The proposed statistical framework of PCXD has been successfully applied for the energy optimization and decomposition of three material in a mammographic environment. Experimental results using the physical breast phantom and ex vivo specimen support the practicality of the proposed algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DEPRECATED HARP_Opt: Horizontal Axis Rotor Performance Optimization [SWR-13-00]

DEPRECATED This repository was archived by the owner on Jun 30, 2026. It is now read-only. HARP_Opt (Horizontal Axis Rotor Performance Optimization) utilizes MATLAB's optimization algorithms and the National Renewable Energy Laboratory's (NREL) WT-Perf blade element momentum (BEM) code to design axial-flow wind and water (i.e. hydrokinetic) turbine rotors. The code optimizes a rotor's performance for steady and uniform flows (no sheared or yawed flows). A variety of rotor control configurations can be designed using HARP_Opt, including fixed or variable rotor speed and fixed or variable blade pitch configuration. Blades with circular or non-circular roots are also supported.

Lawson, Michael↗

Technical Note: SPEKTR 3.0—A computational tool for x-ray spectrum modeling and analysis

Purpose: A computational toolkit (SPEKTR 3.0) has been developed to calculate x-ray spectra based on the tungsten anode spectral model using interpolating cubic splines (TASMICS) algorithm, updating previous work based on the tungsten anode spectral model using interpolating polynomials (TASMIP) spectral model. The toolkit includes a MATLAB (The Mathworks, Natick, MA) function library and improved user interface (UI) along with an optimization algorithm to match calculated beam quality with measurements. Methods: The SPEKTR code generates x-ray spectra (photons/mm{sup 2}/mAs at 100 cm from the source) using TASMICS as default (with TASMIP as an option) in 1 keV energy bins over beam energies 20–150 kV, extensible to 640 kV using the TASMICS spectra. An optimization tool was implemented to compute the added filtration (Al and W) that provides a best match between calculated and measured x-ray tube output (mGy/mAs or mR/mAs) for individual x-ray tubes that may differ from that assumed in TASMICS or TASMIP and to account for factors such as anode angle. Results: The median percent difference in photon counts for a TASMICS and TASMIP spectrum was 4.15% for tube potentials in the range 30–140 kV with the largest percentage difference arising in the low and high energy bins due to measurement errors in the empirically based TASMIP model and inaccurate polynomial fitting. The optimization tool reported a close agreement between measured and calculated spectra with a Pearson coefficient of 0.98. Conclusions: The computational toolkit, SPEKTR, has been updated to version 3.0, validated against measurements and existing models, and made available as open source code. Video tutorials for the SPEKTR function library, UI, and optimization tool are available.

60 APPLIED LIFE SCIENCES↗

Validation and Demonstration of Control System Functional Capabilities within the IES Plug-and-Play Simulation Environment

The concept of an integrated energy system (IES) is meant to combine different energy technologies in synergistic ways to achieve a more secure and economical energy supply. The RAVEN-based HYBRID framework is used to find the optimal installed capacity and the optimal economical dispatch of each component of the IES. The new RAVEN plugin for grid and capacity optimization (HERON) only addresses the limits that affect the production variables and the corresponding rates of variation (explicit constraints). However, other variables are subject to constraints, and the associated limits should be accounted for (implicit constraints). In particular, for the power dispatch problem, the optimization algorithm takes into account the limits on the electrical power output and the corresponding hourly power variations but does not consider other constraints on process variables whose response affects the service life of the IES. This report describes a scheme that allows accounting for implicit constraints without increasing the size of the optimization problem. To obtain a more accurate approximation of the nonlinear dynamic behavior, a parametric version of the dynamic mode decomposition with control (DMDc) algorithm was developed to derive the state-space representation matrices of the IES components at different scheduling parameter. Thanks to this approach, a more accurate approximation of the system response can be obtained, the limits imposed by thermal mechanical implicit constraints can be translated into power dispatch limits, and the feedbacks to HERON power dispatcher can be provided. To assess the developed methodology, a power dispatching test case composed of three power generating and storage units (Balance of Plant, Secondary Energy Source, Thermal Energy Storage) was developed. The power output of each one of the three units was optimized to meet the imposed time-dependent load demand trajectory and to maximize the IES profitability by meeting both the explicit and implicit constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗

SU-F-J-178: A Computer Simulation Model Observer for Task-Based Image Quality Assessment in Radiation Therapy

Purpose: Traditionally, image quality in radiation therapy is assessed subjectively or by utilizing physically-based metrics. Some model observers exist for task-based medical image quality assessment, but almost exclusively for diagnostic imaging tasks. As opposed to disease diagnosis, the task for image observers in radiation therapy is to utilize the available images to design and deliver a radiation dose which maximizes patient disease control while minimizing normal tissue damage. The purpose of this study was to design and implement a new computer simulation model observer to enable task-based image quality assessment in radiation therapy. Methods: A modular computer simulation framework was developed to resemble the radiotherapy observer by simulating an end-to-end radiation therapy treatment. Given images and the ground-truth organ boundaries from a numerical phantom as inputs, the framework simulates an external beam radiation therapy treatment and quantifies patient treatment outcomes using the previously defined therapeutic operating characteristic (TOC) curve. As a preliminary demonstration, TOC curves were calculated for various CT acquisition and reconstruction parameters, with the goal of assessing and optimizing simulation CT image quality for radiation therapy. Sources of randomness and bias within the system were analyzed. Results: The relationship between CT imaging dose and patient treatment outcome was objectively quantified in terms of a singular value, the area under the TOC (AUTOC) curve. The AUTOC decreases more rapidly for low-dose imaging protocols. AUTOC variation introduced by the dose optimization algorithm was approximately 0.02%, at the 95% confidence interval. Conclusion: A model observer has been developed and implemented to assess image quality based on radiation therapy treatment efficacy. It enables objective determination of appropriate imaging parameter values (e.g. imaging dose). Framework flexibility allows for incorporation of additional modules to include any aspect of the treatment process, and therefore has great potential for both assessment and optimization within radiation therapy.

60 APPLIED LIFE SCIENCES↗