Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,531 records · Page 85

Xopt and Badger: a machine learning ecosystem for real-time accelerator control and optimization

Machine learning (ML)-based black-box optimization algorithms have demonstrated significant improvements in accelerator optimization speed, often by orders of magnitude. However, deploying these algorithms in real-time facility control remains challenging due to the specialized expertise and infrastructure required. To bridge this gap, we introduce the Xopt ecosystem, a versatile suite of tools designed to make advanced ML-based optimization accessible to the broader accelerator community. This ecosystem includes Xopt, a modular Python framework that facilitates the integration of ML-based optimization algorithms with arbitrary control problems, and Badger, a graphical user interface built on top of Xopt, which enables seamless deployment of ML algorithms in real-time control systems. The Xopt ecosystem has been successfully applied towards solving challenging real-time control problems at leading international accelerator facilities, including SLAC, LBNL, Argonne, Fermilab, BNL, DESY, and ESRF, demonstrating its effectiveness in real-world optimization tasks. In this presentation, we provide an overview of Xopt’s capabilities and illustrate its impact through case studies from SLAC accelerator facilities including LCLS, LCLS-II, and FACET-II.

Roussel, Ryan [SLAC]↗

Bayesian optimization scheme for the design of a nanofibrous high power target

High Power Targetry (HPT) R&D is critical in the context of increasing beam intensity and energy for next generation accelerators. Many target concepts and novel materials are being developed and tested for their ability to withstand extreme beam environments; the HPT R&D Group at Fermilab is developing an electrospun nanofiber material for this purpose. The performance of these nanofiber targets is sensitive to their construction parameters, such as the packing density of the fibers. Lowering the density improves the survival of the target, but reduces the secondary particle yield. Optimizing the lifetime and production efficiency of the target poses an interesting design problem, and in this paper we study the applicability of Bayesian optimization to its solution. We first describe how to encode the nanofiber target design problem as the optimization of an objective function, and how to evaluate that function with computer simulations. We then explain the optimization loop setup. Thereafter, we present the optimal design parameters suggested by the algorithm, and close with discussions of limitations and future refinements.

43 PARTICLE ACCELERATORS↗

Large-scale Stochastic Optimization for Unit Commitment and Economic Dispatch

Our FY 2012 LDRD research on stochastic optimization with its application in power grid planning and operations has advanced the state-of-the-art of this area in the following aspects: (1) Deploying stochastic unit commitment on large real-world applications, (2) Stochastic optimization coupled with real-time production cost simulation (interleaved), and (3) Real-time stochastic optimization with rolling-horizon look-ahead. In conjunction, a number of computational experiments have been performed to evaluate the capability of the latest stochastic optimization software and explore opportunities for future research. In what follows, we discuss each of these contribution areas, including the results of our computational experiments and their implications on the scalability and solvability of large-scale stochastic optimization models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Incorporating the Min-Max Mesh Optimization Method within the Target-Matrix Paradigm

The Target-Matrix Optimization Paradigm (TMOP) is a method for improving mesh quality via node movement. Through the use of appropriate pre-defined quality metrics and Target-matrices, TMOP provides the ability to define mesh quality in terms of element shape, volume, and edge orientation as a function of position within the mesh, thus facilitating high-level goals such as size-adapted meshing. The Paradigm is developed further in this paper by showing how it can be applied to the problem of improving the mesh in locations where the quality is the worst. Improving the worst quality portions of a mesh was investigated by Freitag, Amenta, and others, who showed that the problem can be formulated as a min-max optimization problem. The Target-paradigm is used to extend the previous work in two important respects. First, by using quality metrics from the Target-paradigm, quality can be user-specified via Target-matrices instead of the quality definition being hard-wired into the quality metric. Second, by making use of the sample point concept in TMOP, one can extend min-max mesh optimization to non-simplicial element types such as quadrilaterals. Numerical experiments were performed to illustrate these extensions and to investigate their utility. A non-gradient solver known as the amoeba was used to numerically compute the optimal solutions. This derivative-free method, in conjunction with the use of barrier metrics from TMOP, enables the solution of the min-max problem without the use of explicit constraints to guarantee that the optimal mesh is non-inverted. The experiments showed that the use of Target-metrics in min-max with triangle (or tetrahedral) element meshes is able to effectively improve the worst quality elements in terms of shape or in terms of size+shape. The experiments also showed that the mesh min-max extension to quadrilateral element meshes can lead to acceptable meshes using barrier metrics from the Target-paradigm, provided that inter-element mesh smoothness is not important. Poor behavior was observed when using non-barrier Target-metrics in min-max with quadrilateral element meshes. For both simplicial and quadrilateral meshes, the min-sum method can be competitive with min-max, however.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Stochastic Optimization for Unit Commitment and Economic Dispatch

Our FY 2012 LDRD research on stochastic optimization with its application in power grid planning and operations has advanced the state-of-the-art of this area in the following aspects: (1) Deploying stochastic unit commitment on large real-world applications, (2) Stochastic optimization coupled with real-time production costsimulation (interleaved), and (3) Real-time stochastic optimization with rolling-horizon look-ahead. In conjunction, a number of computational experiments have been performed to evaluate the capability of the latest stochastic optimization software and explore opportunities for future research. In what follows, we discuss each of these contribution areas, including the results of our computational experiments and their implications on the scalability and solvability of large-scale stochastic optimization models.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Optimization and Annual Average Power Predictions of a Backward Bent Duct Buoy Oscillating Water Column Device Using the Wells Turbine.

This Technical Report presents work completed by The Applied Research Laboratory at The Pennsylvania State University, in conjunction with Sandia National Labs, on the optimization of the power conversion chain (PCC) design to maximize the Average Annual Electric Power (AAEP) output of an Oscillating Water Column (OWC) device. The design consists of two independent stages. First, the design of a floating OWC, a Backward Bent Duct Buoy (BBDB), and second the design of the PCC. The pneumatic power output of the BBDB in random waves is optimized through the use of a hydrodynamically coupled, linear, frequency-domain, performance model that links the oscillating structure to internal air-pressure fluctuations. The PCC optimization is centered on the selection and sizing of a Wells Turbine and electric power generation equipment. The optimization of the PCC involves the following variables: the type of Wells Turbine (fixed or variable pitched, with and without guide vanes), the radius of the turbine, the optimal vent pressure, the sizing of the power electronics, and number of turbines. Also included in this Technical Report are further details on how rotor thrust and torque are estimated, along with further details on the type of variable frequency drive selected.

13 HYDRO ENERGY↗

Next-generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience

This report summarizes the work performed under the project project Next-Generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for infrastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years of Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasible region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality constraints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.

97 MATHEMATICS AND COMPUTING↗

Design Optimization Toolkit: Users' Manual

The Design Optimization Toolkit (DOTk) is a stand-alone C++ software package intended to solve complex design optimization problems. DOTk software package provides a range of solution methods that are suited for gradient/nongradient-based optimization, large scale constrained optimization, and topology optimization. DOTk was design to have a flexible user interface to allow easy access to DOTk solution methods from external engineering software packages. This inherent flexibility makes DOTk barely intrusive to other engineering software packages. As part of this inherent flexibility, DOTk software package provides an easy-to-use MATLAB interface that enables users to call DOTk solution methods directly from the MATLAB command window.

97 MATHEMATICS AND COMPUTING↗

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗

Quantum Optimization and Approximation Algorithms

Shor's groundbreaking quantum algorithm for integer factoring provides an exponential speedup over the best-known classical algorithms. In the 20 years since Shor's algorithm was conceived, only a handful of fundamental quantum algorithmic kernels, generally providing modest polynomial speedups over classical algorithms, have been invented. To better understand the potential advantage quantum resources provide over their classical counterparts, one may consider other resources than execution time of algorithms. Quantum Approximation Algorithms direct the power of quantum computing towards optimization problems where quantum resources provide higher-quality solutions instead of faster execution times. We provide a new rigorous analysis of the recent Quantum Approximate Optimization Algorithm, demonstrating that it provably outperforms the best known classical approximation algorithm for special hard cases of the fundamental Maximum Cut graph-partitioning problem. We also develop new types of classical approximation algorithms for finding near-optimal low-energy states of physical systems arising in condensed matter by extending seminal discrete optimization techniques. Our interdisciplinary work seeks to unearth new connections between discrete optimization and quantum information science.

97 MATHEMATICS AND COMPUTING↗

Thermomechanical design optimization for low metal footprint in hybrid metal-polymer heat exchanger

Material and maintenance costs of metal-based heat exchangers surpass profits in waste heat recovery (WHR) from ultra-low temperature (<100C) sources [1]. A low-cost alternative like polymer pipes suffer from poor thermal conductivity (~0.2 W/mK), and a low overall heat transfer coefficient. Polymers’ thermal conductivity have previously been enhanced through systematic molecular alignment by stretching [2], chemical vapor deposition of extended polymers [3], surface grating [4], etc. However, these approaches suffer from scalability issues for WHR heat exchangers in terms of cost [3], and thermomechanical considerations [5]. In this work, we propose novel hybrid metal-polymer heat exchangers that are made from polymer-copper strips. Through finite element method (FEM) simulations, we first optimize the placement of copper around polymer strips to enhance the transverse thermal conductivity of the strips. The copper cladded polymer strips are wound helically in a roll-to-roll system to form the pipes for a heat exchanger. We then optimize the design of helically wound pipes to reduce thermomechanical strains to < 0.2 % at 100C and 40 psi working conditions. At 25 % volume fraction of copper in the pipe, we predict up to 20 % enhancement in overall heat transfer from a base polymer with a thermal conductivity of 0.2 W/mK. We also compare and contrast the thermomechanical performance of the optimized metal-polymer strips to random metal matrix composites. Finally, we experimentally verify the thermal conductivity of the optimized strips through bulk thermal conductivity and thermal interface resistance measurement setup. By systematically improving the design through FEM and experimental measurements, we provide an optimized design of hybrid metal-polymer pipes that provides a low metal footprint and cost-effective means for harvesting waste heat from ultra-low temperature sources. Thekdi, Arvind, and Sachin U. Nimbalkar. Oak Ridge National Lab, 2015 Shen, Sheng, et al. Nature nanotechnology 5.4 (2010): 251. Xu, Yanfei, et al. Science advances 4.3 (2018): 3031. Smith, M. K., Singh, V., Kalaitzidou, K., & Cola, B. A. (2015). ACS nano, 9(2), 1080-1088. Aymonier, C., Bortzmeyer, D., Thomann, R., & M&uuml;lhaupt, R. (2003). Chemistry of Materials, 15(25), 4874-4878.

C Rajagopal, Manjunath↗

Introduction to Mixed Variable Optimization (MVO) [Slides]

Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.

97 MATHEMATICS AND COMPUTING↗

Sustainable Data Evolution Technology (SDET) for Power Grid Optimization (Final Report)

This project develops an innovative sustainable data evolution technology (SDET) to create open-access power grid datasets and facilitate updates to these datasets by the power grid community. The lack of open-access, realistic large-scale datasets significantly limits the ability of researchers, developers and ultimately end users to develop, benchmark and compare new methods and tools for optimizing the operation and planning of the grid, which leads to slow adoption by end users. Available open datasets include the IEEE sponsored 14-300 bus transmission test cases and distribution test feeders, the Edinburgh Power Systems Test Case Archive (39-2224 buses), and the Polish cases (2383-3375 buses) available with MATPOWER. These datasets serve certain purposes, but for power grid optimization, they are insufficient in one or more of these aspects: 1) they are too small; 2) they are incomplete in both models and scenarios for optimization purposes; and 3) they are static and are not keeping up with grid needs. The SDET technology delivers large-scale realistic datasets and data-creation tools capable of generating new datasets. We work closely with the Category-2 data repository project awarded by the same GRID DATA program. The generated datasets and data creation tools are compatible with and available through the data repository. The objective is to make this a sustained effort within and beyond the ARPA-E GRID DATA program so that the datasets can evolve over time and meet the current and future needs for power grid optimization and potentially other applications in power grid operation and planning. The novel and disruptive features of SDET differentiate itself from prior work in the following aspects: 1) SDET derives features and metrics for both transmission and distribution (T&D) systems by analyzing many public and private datasets provided by our industry partners National Rural Electric Cooperative Association (NRECA) and PJM Interconnection (PJM). 2) SDET develops data-creation tools and use these tools to generate large-scale open-access realistic datasets that comply with the metrics for both T&D systems. 3) SDET validates the created datasets using industry tools provided by our vendor partner GE Energy Solution. The data creation tools, as well as the created datasets, are integrated into the data repository (DR. POWER) funded by ARPA-E GRID DATA program in Category 2. Users can use the datasets and access these data creation tools to create and update datasets, thus datasets can evolve per user requirements and power grid development. The SDET is a novel and disruptive technology compared to current ad hoc and static dataset generation. It is expected the SDET technology will fundamentally enhance the development, assessment, and adoption of new methods and tools for power grid optimization and other applications, which in turn would significantly improve the reliability, resiliency, and efficiency of the power grid – a major ARPA-E mission objective.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗

Application of a machine learning algorithm (XGBoost) to offline RHIC luminosity optimization

The operation parameter optimization in 2020 RHIC low energy run is difficult. First, the RHIC luminosity is affected by many RHIC operation parameters, as well as affected by many Low Energy RHIC electron Cooling (LEReC) operation parameters. Second, the luminosity signal in this run is noisy and not sensitive to these parameter changes, especially when these parameters are very close to their optimized values. It is not easy to distinguish the effects of one parameter from all other operation parameters separately. Therefore, it is difficult to optimize the luminosity by varying these parameters one by one. To find a way for luminosity optimization, we analyze some operation parameters via a machine learning algorithm - XGBoost. After constructing a black-box surrogate model from XGBoost and plotting their partial dependency plots (PDF) and SHAP value plots for different operation parameters, we can find the effects of an individual parameter on the RHIC luminosity and optimize it accordingly.

43 PARTICLE ACCELERATORS↗

Concurrent Shape and Topology Optimization

The typical topology optimization workflow uses a design domain that does not change during the optimization process. Consequently, features of the design domain, such as the location of loads and constraints, must be determined in advance and are not optimizable. A method is proposed herein that allows the design domain to be optimized along with the topology. This approach uses topology and shape derivatives to guide nested optimizers to the optimal topology and design domain. The details of the method are discussed, and examples are provided that demonstrate the utility of this approach.

42 ENGINEERING↗

Multi-Stage and Multi-Timescale Robust Co-Optimization Planning for Reliable and Sustainable Power Systems. Final Report

In this project, Clarkson University, in collaboration with Southern Methodist University and University of Pittsburgh, conducted the research to model, design, and implement a sophisticated generation and transmission co-optimization planning decision tool, called Multi-stage and Multi-timescale robust Co-Optimization Planning (MMCOP). The MMCOP decision tool intends to facilitate generation and transmission co-optimization planning of emerging power systems, while mitigating risks and uncertainties in both short-term operation dynamics and long-term policy and technology changes. Long-term power system planning aims at optimizing asset utilization by investing in a proper mix of various generation technologies and transmission lines to supply the future load growth. In particular, the Clean Power Plan (CPP), which is designed to combat climate change and reduce carbon emissions by setting a national limit on carbon pollution from power plants, may dramatically change the landscape of the power industry by further promoting clean energy and phasing out emissions-intensive generation technologies. In addition, novel non-wire alternatives (e.g., demand response (DR), distributed generation (DG), energy efficiency (EE), and smart grid technologies) and the computational complexity for large-scale systems significantly complicate the system planning procedure even further. However, existing conventional planning approaches neglect short-term variability and uncertainty of renewable energy, hourly chronological operation details, and physical nonlinear characteristics of the alternating current transmission network. As a result, existing conventional planning approaches may not work properly, and power systems reliability could be in jeopardy. In observing the limitations of existing conventional planning approaches and addressing new challenges of emerging power systems, the main scope of this project to develop co-optimization planning models within a multi-stage and multi-timescale framework. In particular, random contingencies, key uncertainty factors, and AC power flows are included to derive expansion plans while considering both long-term reliability and short-term flexibility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization of artificial viscosity in production codes based on Gaussian Regression surrogate models

To accurately model flows with shock waves using staggered-grid Lagrangian hydrodynamics, artificial viscosity has to be introduced to convert kinetic energy into internal energy, thereby increasing the entropy across shocks. Determining the appropriate strength of the artificial viscosity is an art and strongly depends on the particular problem and experience of the researcher. The objective of this study is to pose the problem of finding the appropriate strength of artificial viscosity as an optimization problem and solve this problem using machine learning (ML) tools, specifically using surrogate models based on Gaussian Process regression and Bayesian analysis. We describe the optimization method and discuss various practical details of its implementation. The shock-containing problems for which we apply this method all have been implemented in the LANL code FLAG. First, we apply ML to find optimal values to isolated shock problems of different strengths. Second, we apply ML to optimize viscosity for a 1D propagating detonation problem based on Zel’dovich-von Neumann-Doring (ZND) detonation theory using a reactive burn model. We compare results for default (currently used values in FLAG) and optimized values of artificial viscosity for these problems demonstrating the potential for significant improvement in the accuracy of computations.

42 ENGINEERING↗