Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimality”

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

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

At least 1,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

EMOS (Energy Management Optimization System) [SWR-21-46]

EMOS software performs a real-time hierarchal optimal control for energy systems like multi-port electric vehicles charging site with distributed energy resources (DERs) and energy storage systems (ESSs). It gathers information in real-time from electric vehicles, power grid, and DERs, solves a multi-objective energy management optimization problem, and output setpoint for chargers, ESS converters, DERs converters, and grid converters. The software incorporates a novel integration of two control tasks: a) An Energy Management Optimization (EMO), which is the brain of EMOS controller that gathers information in real-time from EVs [e.g., battery size, state-of-charge (SOC), desired SOC, and charge acceptance curve], grid (e.g., electricity price, allowed feeder capacity, ramp rate limit, and reactive power), and DERs (e.g., prediction for solar generation for PV systems). It solves a control optimization problem in real-time to find optimal setpoint for ESSs power dispatch, EVs charging rate, and grid inverters. The objectives are to (1) minimize the charging cost considering grid energy, demand charges, and battery energy, (2) minimize charging time to meet fast charging criterion, (3) keep high energy level on ESSs at the end of an operating period, while satisfying constraints related to grid, EVs, and power converters. b) Real-Time Energy Management System (RT-EMS) is a rule-based algorithm that has faster response than EMO. It receives optimal setpoint from EMO and actual measurements from the system and modify the setpoint to compensate for any fast disturbance in the system, until a new optimum solution is received. Fast disturbances may include vehicle connect/disconnect, unpredicted variation in DERs profiles, variation in grid voltage, errors in PV generation prediction, and others. In addition, RT-EMS regulates voltage at point of common coupling (PCC) by managing reactive power of grid converters.

Mohamed, Ahmed↗
DOE OSTI2025

Microreactor Optimization Using Simulation And Economics (mouse)

Microreactor Optimization Using Simulation and Economics (MOUSE) is a tool that integrates both nuclear microreactor design and reactor economics to provide comprehensive evaluations and optimizations. This tool enables stakeholders to explore the interplay between technical and economic variables, guiding them towards effective and competitive microreactor solutions. For the reactor core simulations, MOUSE leverages the OpenMC Monte Carlo Particle Transport Code to perform detailed core simulations for various microreactor designs. The included OpenMC models are 2D core designs of a Liquid Metal Thermal Microreactor (LMTR), a Gas-Cooled TRISO-Fueled Microreactor (GCMR), and a Heat Pipe Microreactor. Beyond core design, MOUSE includes simplified calculations for: - Calculating the masses of heat exchangers within the system. - Mechanical power of pumps. - Estimating the area occupied by various buildings within the nuclear plant. For the economic analysis, MOUSE provides detailed bottom-up cost estimates, encompassing a wide range of costs including preconstruction costs, direct costs, indirect costs, training costs, financial costs, operation & maintenance (O&M) costs, and fuel costs. These cost estimations are developed using data from the MARVEL project and additional literature sources, enabling the calculation of total capital costs and levelized cost of energy for both first-of-a-kind and nth-of-a-kind microreactors. MOUSE also enables analysis of the cost drivers and competitiveness in the electricity market. MOUSE allows users to modify a wide array of technical and economic parameters to evaluate different scenarios and their impacts. Examples of these parameters include: Fuels, coolants, or reflector materials Enrichment levels Control drum materials and geometry Fuel pin geometry and materials Moderator pin geometry and materials Reactor core and reflector dimensions Packing factor for the TRISO particles Nuclear reactor power and reactor burnup Number of sensors Shielding thickness Reactor vessel and guard vessel dimensions Operational staff requirements Number of emergency shutdowns Levelization period Interest rate Construction duration Since MOUSE is powered by the WATTS toolkit, it supports optimization studies, parametric analyses, and uncertainty calculations/propagation. The optimization techniques enable users to identify optimal design and economic configurations. The parametric analysis tools allow users to explore the sensitivity of various parameters, while uncertainty propagation helps quantify the impact of uncertainties on overall performance and cost. User Interface and Workflow: Currently, MOUSE is a command-line-based tool. Users can input various reactor design or economic parameters, modify the designs, run simulations, and visualize results through comprehensive data visualization and reporting capabilities. The typical workflow involves setting up the reactor model, defining economic parameters, running simulations, and analyzing the results to make informed decisions. By combining advanced design calculations with detailed economic modeling, MOUSE provides a robust framework for optimizing nuclear microreactor technologies, enhancing their competitiveness, and guiding stakeholders towards innovative and cost-effective solutions.

Hanna, Botros [Idaho National Laboratory (INL), Id↗
DOE OSTI2023

CFL Optimized Forward–Backward Runge–Kutta Schemes for the Shallow-Water Equations

Abstract We present the formulation and optimization of a Runge–Kutta-type time-stepping scheme for solving the shallow-water equations, aimed at substantially increasing the effective allowable time step over that of comparable methods. This scheme, called FB-RK(3,2), uses weighted forward–backward averaging of thickness data to advance the momentum equation. The weights for this averaging are chosen with an optimization process that employs a von Neumann–type analysis, ensuring that the weights maximize the admittable Courant number. Through a simplified local truncation error analysis and numerical experiments, we show that the method is at least second-order in time for any choice of weights and exhibits low dispersion and dissipation errors for well-resolved waves. Further, we show that an optimized FB-RK(3,2) can take time steps up to 2.8 times as large as a popular three-stage, third-order strong stability-preserving Runge–Kutta method in a quasi-linear test case. In fully nonlinear shallow-water test cases relevant to oceanic and atmospheric flows, FB-RK(3,2) outperforms SSPRK3 in admittable time step by factors roughly between 1.6 and 2.2, making the scheme approximately twice as computationally efficient with little to no effect on solution quality. Significance Statement The purpose of this work is to develop and optimize time-stepping schemes for models relevant to oceanic and atmospheric flows. Specifically, for the shallow-water equations we optimize for schemes that can take time steps as large as possible while retaining solution quality. We find that our optimized schemes can take time steps between 1.6 and 2.2 times larger than schemes that cost the same number of floating point operations, translating directly to a corresponding speedup. Our ultimate goal is to use these schemes in climate-scale simulations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2012

Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Data-driven analysis to understand GPU hardware resource usage of optimizations

With heterogeneous systems, the number of GPUs per chip increases to provide computational capabilities for solving science at a nanoscopic scale. However, low utilization for single GPUs defies the need to invest more money in expensive accelerators. Although related work develops optimizations to improve application performance, none studies how these optimizations impact hardware resource usage or average GPU utilization. Here, this paper takes a data-driven analysis approach in addressing this gap by (1) characterizing how hardware resource usage affects device utilization, execution time, or both, (2) presenting a multiobjective metric to identify important application-device interactions that can be optimized to improve device utilization and application performance jointly, (3) studying hardware resource usage behaviors of several optimizations for a benchmark application, and finally (4) identifying optimization opportunities for several scientific proxy applications based on their hardware resource usage behaviors. Furthermore, we demonstrate the applicability of our methodology by applying the identified optimizations to a proxy application, which improves the execution time, device utilization, and power consumption by up to 29.6%, 5.3% and 26.5% respectively.

Computer science↗
DOE OSTI2017

Model-based optimization of near-field binary-pixelated beam shapers

The optimization of components that rely on spatially dithered distributions of transparent or opaque pixels and an imaging system with far-field filtering for transmission control is demonstrated. The binary-pixel distribution can be iteratively optimized to lower an error function that takes into account the design transmission and the characteristics of the required far-field filter. Simulations using a design transmission chosen in the context of high-energy lasers show that the beam-fluence modulation at an image plane can be reduced by a factor of 2, leading to performance similar to using a non-optimized spatial-dithering algorithm with pixels of size reduced by a factor of 2 without the additional fabrication complexity or cost. The optimization process preserves the pixel distribution statistical properties. Analysis shows that the optimized pixel distribution starting from a high-noise distribution defined by a random-draw algorithm should be more resilient to fabrication errors than the optimized pixel distributions starting from a low-noise, error-diffusion algorithm, while leading to similar beamshaping performance. Furthermore, this is confirmed by experimental results obtained with various pixel distributions and induced fabrication errors.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Manufacturability-based optical design optimization for advanced Kirkpatrick–Baez X-ray focusing mirrors

The advanced Kirkpatrick–Baez (AKB) mirror setup is an effective and compelling solution to provide stable X-ray nano-focusing for synchrotron radiation or free-electron laser beamlines. We propose an AKB mirror design optimization approach to mitigate the difficulties associated with mirror fabrication by minimizing the total slope ranges of the four curved mirrors while achieving the expected focusing performance. In the optimization, we have considered geometry constraints to ensure the beam acceptance with the required clear aperture, the diffraction-limited focal size with the adequate numerical aperture, and the desired mirror gaps for adjustment and the necessary working distance for the sample stage. Additionally, practical constraints linked to mirror metrology and fabrication, such as mirror length limits and curvature uncertainty in measurement, are taken into account. Furthermore, progressive objective optimization eliminates the need for any initial guess, fully automating the AKB optimization process. This approach facilitates the development of an elegant Wolter-I or Wolter-III type AKB design solution that satisfies these multiple constraints. In cases where constraints cannot be simultaneously satisfied, the optimization results provide valuable insights into areas where trade-offs need to be considered. Simulations with ray tracing and wavefront propagation validate the optimized AKB design showing high tolerance to the beam incident angle.

36 MATERIALS SCIENCE↗
DOE OSTI2025

AutoFocus: AI/ML-driven real-time wavefront diagnostics to autonomously align and optimize X-ray optics

We present an integrated system that combines advanced wavefront diagnostics with artificial intelligence (AI) to automate and optimize X-ray optics at synchrotron beamlines. This system couples real-time wavefront sensing with AI-driven control algorithms to achieve precise beam alignment, stabilization, and performance optimization. A key feature is the use of multi-fidelity transfer learning, which enables knowledge gained from both real-world beamline optimizations and ultra-realistic digital twin simulations to be effectively applied to in situ optimization. By leveraging multi-objective bayesian optimization, the system continuously refines its performance, reducing optimization time and minimizing the need for manual adjustments. Designed for seamless deployment, it operates with existing beamline hardware and provides an intuitive graphical interface. Initial deployments at the advanced photon source beamlines have demonstrated its ability to enhance beam stability, improve reproducibility, and significantly streamline alignment procedures. This AI-enhanced control framework represents a significant step toward fully autonomous beamline operation in next-generation synchrotron facilities.

Rebuffi, Luca [Argonne National Laboratory (ANL), ↗
DOE OSTI2018

Optimizing colormaps with consideration for color vision deficiency to enable accurate interpretation of scientific data

Color vision deficiency (CVD) affects more than 4% of the population and leads to a different visual perception of colors. Though this has been known for decades, colormaps with many colors across the visual spectra are often used to represent data, leading to the potential for misinterpretation or difficulty with interpretation by someone with this deficiency. Until the creation of the module presented here, there were no colormaps mathematically optimized for CVD using modern color appearance models. While there have been some attempts to make aesthetically pleasing or subjectively tolerable colormaps for those with CVD, our goal was to make optimized colormaps for the most accurate perception of scientific data by as many viewers as possible. We developed a Python module, cmaputil , to create CVD-optimized colormaps, which imports colormaps and modifies them to be perceptually uniform in CVD-safe colorspace while linearizing and maximizing the brightness range. The module is made available to the science community to enable others to easily create their own CVD-optimized colormaps. In this paper, we present an example CVD-optimized colormap created with this module that is optimized for viewing by those without a CVD as well as those with red-green colorblindness. This colormap, cividis, enables nearly-identical visual-data interpretation to both groups, is perceptually uniform in hue and brightness, and increases in brightness linearly.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2013

Automated Cache Performance Analysis And Optimization

While there is no lack of performance counter tools for coarse-grained measurement of cache activity, there is a critical lack of tools for relating data layout to cache behavior to application performance. Generally, any nontrivial optimizations are either not done at all, or are done ”by hand” requiring significant time and expertise. To the best of our knowledge no tool available to users measures the latency of memory reference instructions for particular addresses and makes this information available to users in an easy-to-use and intuitive way. In this project, we worked to enable the Open|SpeedShop performance analysis tool to gather memory reference latency information for specific instructions and memory addresses, and to gather and display this information in an easy-to-use and intuitive way to aid performance analysts in identifying problematic data structures in their codes. This tool was primarily designed for use in the supercomputer domain as well as grid, cluster, cloud-based parallel e-commerce, and engineering systems and middleware. Ultimately, we envision a tool to automate optimization of application cache layout and utilization in the Open|SpeedShop performance analysis tool. To commercialize this software, we worked to develop core capabilities for gathering enhanced memory usage performance data from applications and create and apply novel methods for automatic data structure layout optimizations, tailoring the overall approach to support existing supercomputer and cluster programming models and constraints. In this Phase I project, we focused on infrastructure necessary to gather performance data and present it in an intuitive way to users. With the advent of enhanced Precise Event-Based Sampling (PEBS) counters on recent Intel processor architectures and equivalent technology on AMD processors, we are now in a position to access memory reference information for particular addresses. Prior to the introduction of PEBS counters, cache behavior could only be measured reliably in the aggregate across tens or hundreds of thousands of instructions. With the newest iteration of PEBS technology, cache events can be tied to a tuple of instruction pointer, target address (for both loads and stores), memory hierarchy, and observed latency. With this information we can now begin asking questions regarding the efficiency of not only regions of code, but how these regions interact with particular data structures and how these interactions evolve over time. In the short term, this information will be vital for performance analysts understanding and optimizing the behavior of their codes for the memory hierarchy. In the future, we can begin to ask how data layouts might be changed to improve performance and, for a particular application, what the theoretical optimal performance might be. The overall benefit to be produced by this effort was a commercial quality easy-to- use and scalable performance tool that will allow both beginner and experienced parallel programmers to automatically tune their applications for optimal cache usage. Effective use of such a tool can literally save weeks of performance tuning effort. Easy to use. With the proposed innovations, finding and fixing memory performance issues would be more automated and hide most to all of the performance engineer expertise ”under the hood” of the Open|SpeedShop performance tool. One of the biggest public benefits from the proposed innovations is that it makes performance analysis more usable to a larger group of application developers. Intuitive reporting of results. The Open|SpeedShop performance analysis tool has a rich set of intuitive, yet detailed reports for presenting performance results to application developers. Our goal was to leverage this existing technology to present the results from our memory performance addition to Open|SpeedShop. Suitable for experts as well as novices. Application performance is getting more difficult to measure as the hardware platforms they run on become more complicated. This makes life difficult for the application developer, in that they need to know more about the hardware platform, including the memory system hierarchy, in order to understand the performance of their application. Some application developers are comfortable in that sceario, while others want to do their scientific research and not have to understand all the nuances in the hardware platform they are running their application on. Our proposed innovations were aimed to support both experts and novice performance analysts. Useful in many markets. The enhancement to Open|SpeedShop would appeal to a broader market space, as it will be useful in scientific, commercial, and cloud computing environments. Our goal was to use technology developed initially at the and Lawrence Livermore National Laboratory combined with the development and commercial software experience of the Argo Navis Technologies, LLC (ANT) to form a powerful combination to delivery these objectives.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Evaluation of Missed Energy Saving Opportunity Based on Illinois Home Performance Program Field Data: Homeowner Selected Upgrades Versus Cost-Optimized Solutions

Expanding on previous research by PARR, this study compares measure packages installed during 800 Illinois Home Performance with ENERGY STAR® (IHP) residential retrofits to those recommended as cost-optimal by Building Energy Optimization (BEopt™) modeling software. In previous research, cost-optimal measure packages were identified for fifteen Chicagoland single family housing archetypes, called housing groups. In the present study, 800 IHP homes are first matched to one of these fifteen housing groups, and then the average measures being installed in each housing group are modeled using BEopt to estimate energy savings. For most housing groups, the differences between recommended and installed measure packages is substantial. By comparing actual IHP retrofit measures to BEopt-recommended cost-optimal measures, missed savings opportunities are identified in some housing groups; also, valuable information is obtained regarding housing groups where IHP achieves greater savings than BEopt-modeled, cost-optimal recommendations. Additionally, a measure-level sensitivity analysis conducted for one housing group reveals which measures may be contributing the most to gas and electric savings. Overall, the study finds not only that for some housing groups, the average IHP retrofit results in more energy savings than would result from cost-optimal, BEopt recommended measure packages, but also that linking home categorization to standardized retrofit measure packages provides an opportunity to streamline the process for single family home energy retrofits and maximize both energy savings and cost-effectiveness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2014

Evaluation of Missed Energy Saving Opportunity Based on Illinois Home Performance Program Field Data: Homeowner Selected Upgrades vs. Cost-Optimized Solutions; Chicago, Illinois (Fact Sheet)

Expanding on previous research by PARR, this study compares measure packages installed during 800 Illinois Home Performance with ENERGY STAR (IHP) residential retrofits to those recommended as cost-optimal by Building Energy Optimization (BEopt) modeling software. In previous research, cost-optimal measure packages were identified for fifteen Chicagoland single family housing archetypes, called housing groups. In the present study, 800 IHP homes are first matched to one of these fifteen housing groups, and then the average measures being installed in each housing group are modeled using BEopt to estimate energy savings. For most housing groups, the differences between recommended and installed measure packages is substantial. By comparing actual IHP retrofit measures to BEopt-recommended cost-optimal measures, missed savings opportunities are identified in some housing groups; also, valuable information is obtained regarding housing groups where IHP achieves greater savings than BEopt-modeled, cost-optimal recommendations. Additionally, a measure-level sensitivity analysis conducted for one housing group reveals which measures may be contributing the most to gas and electric savings. Overall, the study finds not only that for some housing groups, the average IHP retrofit results in more energy savings than would result from cost-optimal, BEopt-recommended measure packages, but also that linking home categorization to standardized retrofit measure packages provides an opportunity to streamline the process for single family home energy retrofits and maximize both energy savings and cost-effectiveness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2014

Evaluation of Missed Energy Saving Opportunity Based on Illinois Home Performance Program Field Data: Homeowner Selected Upgrades Versus Cost-Optimized Solutions

Expanding on previous research by PARR, this study compares measure packages installed during 800 Illinois Home Performance with ENERGY STAR® (IHP) residential retrofits to those recommended as cost-optimal by Building Energy Optimization (BEopt) modeling software. In previous research, cost-optimal measure packages were identified for 15 Chicagoland single family housing archetypes. In the present study, 800 IHP homes are first matched to one of these 15 housing groups, and then the average measures being installed in each housing group are modeled using BEopt to estimate energy savings. For most housing groups, the differences between recommended and installed measure packages is substantial. By comparing actual IHP retrofit measures to BEopt-recommended cost-optimal measures, missed savings opportunities are identified in some housing groups; also, valuable information is obtained regarding housing groups where IHP achieves greater savings than BEopt-modeled, cost-optimal recommendations. Additionally, a measure-level sensitivity analysis conducted for one housing group reveals which measures may be contributing the most to gas and electric savings. Overall, the study finds not only that for some housing groups, the average IHP retrofit results in more energy savings than would result from cost-optimal, BEopt recommended measure packages, but also that linking home categorization to standardized retrofit measure packages provides an opportunity to streamline the process for single family home energy retrofits and maximize both energy savings and cost effectiveness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

Schedule Management Optimization (SMO) Domain Model (V.1.2)

Schedule Management Optimization (SMO) is a tool for automatically generating a schedule of project tasks. Project scheduling is traditionally achieved with the use of commercial project management software or case-specific optimization formulations. Commercial software packages are useful tools for managing and visualizing copious amounts of project task data. However, their ability to automatically generate optimized schedules is limited. Furthermore, there are many real-world constraints and decision variables that commercial packages ignore. Case-specific optimization formulations effectively identify schedules that optimize one or more objectives for a specific problem, but they are unable to handle a diverse selection of scheduling problems. SMO enables practitioners to generate optimal project schedules automatically while considering a broad range of real-world problem characteristics. SMO has been designed to handle some of the most difficult scheduling problems – those with resource constraints, multiple objectives, multiple inventories, and diverse ways of performing tasks. This report contains descriptions of the SMO modeling concepts and explains how they map to real-world scheduling considerations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Validation and optimization of batch and continuous particle separation processes

Recent advances in simulation capabilities coupled with advanced manufacturing can be leveraged to create highly efficient compact reactors with low emissions, low cost, high reliability, and high flexibility for energy conversion. This type of reactor is especially important for conversion of bio-mass, a storable, renewable and fast-growing energy source, considering the distributed nature of raw material and cost of biomass collection and transportation. To achieve this goal, it is critical to developing new process technologies that are significantly more efficient than traditional processes for which the added manufacture provides a fast way of realization and evaluation. Based upon the flagship MFiX multiphase computational fluid dynamic software suite, NETL has developed an Optimization Toolset to facilitate the CFD simulation based reactor design and optimization, and process intensification. This technical report presents the recent development and application of the Optimization Toolset and the framework for process optimization of particle separation in batch and continuous processes. In these processes, a fluidized bed reactor under proper operating condition was used to separate particles of different physical properties. MFiX-DEM simulations were conducted for a batch system to simulate the process covering a wide range of superficial gas velocities from which the optimal operational parameter can be determined through analyzing the system response. After successful demonstration of the framework, a continuous system for particle separation was designed based on CFD simulations. Similar optimization exercises were conducted for the continuous particle separation considering multiple operating parameters. The design was then fabricated in the laboratory through 3D printing for testing. The particle separation performance was carefully measured through high-speed video for particle tracking. Quantitative comparison between numerical results and experimental measurements were conducted for confirmation and validation.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2019

Nonlinear Optimization in "Synchrotron Radiation Workshop" Code

"Synchrotron Radiation Workshop" (SRW) is an open source physical optics computer code for calculation of detailed characteristics of Synchrotron Radiation (SR) generated by relativistic electrons in magnetic fields of arbitrary configuration. SRW also supports high-accuracy simulations of fully- and partially-coherent radiation propagation through X-ray optical beamlines, facilitated by so-called “Virtual Beamline” module. In this present tech note, we discuss the nonlinear optimization features of SRW with emphasis on the optimization library in SRW. This optimization library not only can be used to optimize the simulation beamline in SRW, it also can be integrated with real beamline operations and optimize the parameters based on real measurements. We also show some demos of the optimization library recently developed in SRW.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Parallel Solver Framework for Mixed-Integer PDE-Constrained Optimization

ROL-PEBBL is a C++, MPI-based parallel code for mixed-integer PDE-constrained optimization (MIPDECO). In these problems we wish to optimize (control, design, etc.) physical systems, which must obey the laws of physics, when some of the decision variables must take integer values. ROL-PEBBL combines a code to efficiently search over integer choices (PEBBL = Parallel Enumeration Branch-and-Bound Library) and a code for efficient nonlinear optimization, including PDE-constrained optimization (ROL = Rapid Optimization Library). In this report, we summarize the design of ROL-PEBBL and initial applications/results. For an artificial source-inversion problem, finding sources of pollution on a grid from sparse samples, ROL-PEBBLs solution for the nest grid gave the best optimization guarantee for any general solver that gives both a solution and a quality guarantee.

97 MATHEMATICS AND COMPUTING↗