Search NASA⌕ Search

SEARCH · Search NASA

Results for “program optimizations”

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,153 records · Page 64
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Resistive Network Optimal Power Flow: Uniqueness and Algorithms

The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

Tan, CW↗
DOE OSTI2019

One- and Two-Qubit Gates: Rabi Technique and Single Unipolar Pulses

Methods for controlling states of interacting superconducting flux qubits using power-efficient devices of fast single-quantum logic (Josephson nonlinearity cavities) are studied. One- and two-qubit quantum logical operations performed within the conventional control technique using Rabi pulses and using picosecond single unipolar magnetic field pulses are comparatively analyzed. It is shown that all main operations can be implemented with an accuracy of better than 97% due to optimization of the shape and parameters of unipolar control pulses (associated with, e.g., propagation of fluxons in transmission lines). The efficiency of the developed technique for programming a two-qubit quantum processor implementing the simplest Deutsch–Jozsa algorithm is demonstrated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Advanced Natural Gas Reciprocating Engine(s)

The objective of the Cummins ARES program, in partnership with the US Department of Energy (DOE), is to develop advanced natural gas engine technologies that increase engine system efficiency at lower emissions levels while attaining lower cost of ownership. The goals of the project are to demonstrate engine system achieving 50% Brake Thermal Efficiency (BTE) in three phases, 44%, 47% and 50% (starting baseline efficiency at 36% BTE) and 0.1 g/bhp-hr NOx system out emissions (starting baseline NOx emissions at 2 – 4 g/bhp-hr NOx). Primary path towards above goals include high Brake Mean Effective Pressure (BMEP), improved closed cycle efficiency, increased air handling efficiency and optimized engine subsystems. Cummins has successfully demonstrated each of the phases of this program. All targets have been achieved through application of a combined set of advanced base engine technologies and Waste Heat Recovery from Charge Air and Exhaust streams, optimized and validated on the demonstration engine and other large engines. The following architectures were selected for each Phase: Phase 1: Lean Burn Spark Ignited (SI) Key Technologies: High Efficiency Turbocharging, Higher Efficiency Combustion System. In production on the 60/91L engines. Over 500MW of ARES Phase 1 technology has been sold. Phase 2: Lean Burn Technology with Exhaust Waste Heat Recovery (WHR) System Key Technologies: Advanced Ignition System, Combustion Improvement, Integrated Waste Heat Recovery System. Base engine technologies intended for production within 2 to 3 years Phase 3: Lean Burn Technology with Exhaust and Charge Air Waste Heat Recovery System Key Technologies: Lower Friction, New Cylinder Head Designs, Improved Integrated Waste Heat Recovery System. Intended for production within 5 to 6 years Cummins is committed to the launch of next generation of large advanced NG engines based on ARES technology to be commercialized worldwide.

Pike, Edward↗
DOE OSTI2021

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗
DOE OSTI2020

Summer Proceedings 2019

The Computer Science Research Institute (CSRI) brings university faculty and students to Sandia for focused collaborative research on Department of Energy (DOE) computer and computational science problems. The institute provides an opportunity for university researchers to learn about problems in computer and computational science at DOE laboratories. Participants conduct leading-edge research, interact with scientists and engineers at the laboratories, and help transfer results of their research to programs at the labs. Some specific CSRI research interest areas are: scalable solvers, optimization, adaptivity and mesh refinement, graph-based, discrete, and combinatorial algorithms, uncertainty estimation, mesh generation, dynamic load-balancing, virus and other malicious-code defense, visualization, scalable cluster computers and heterogeneous computers, data-intensive computing, environments for scalable computing, parallel input/output, advanced architectures, and theoretical computer science. The CSRI Summer Program includes the organization of a weekly seminar series and the publication of this summer proceedings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Conditions for the Solvability of the Linear Programming Formulation for Constrained Discounted Markov Decision Processes

We consider a discrete-time constrained discounted Markov decision process (MDP) with Borel state and action spaces, compact action sets, and lower semi-continuous cost functions. We introduce a set of hypotheses related to a positive weight function which allow us to consider cost functions that might not be bounded below by a constant, and which imply the solvability of the linear programming formulation of the constrained MDP. In particular, we establish the existence of a constrained optimal stationary policy. Our results are illustrated with an application to a fishery management problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗
DOE OSTI2022

A shared-mobility-based framework for evacuation planning and operations under forecast uncertainty

To meet evacuation needs from carless populations who need personalized assistance to evacuate safely, in this article we propose a ridesharing-based evacuation program that recruits volunteer drivers before a disaster strikes, and then matches volunteer drivers with evacuees once demand is realized. Here we optimize resource planning and evacuation operations under uncertain spatiotemporal demand, and construct a two-stage stochastic mixed-integer program to ensure high demand fulfillment rates. We consider three formulations to improve the number of evacuees served, by minimizing an expected penalty cost, imposing a probabilistic constraint, and enforcing a constraint on the conditional value at risk of the total number of unserved evacuees, respectively. We discuss the benefits and disadvantages of the different risk measures used in the three formulations, given certain carless population sizes and the variety of evacuation modes available. We also develop a heuristic approach to provide quick, dynamic and conservative solutions. We demonstrate the performance of our approaches using five different networks of varying sizes based on regions of Charleston County, South Carolina, an area that experienced a mandatory evacuation order during Hurricane Florence, and utilize real demographic data and hourly traffic count data to estimate the demand distribution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Generating moment matching scenarios using optimization techniques

An optimization based method is proposed to generate moment matching scenarios for numerical integration and its use in stochastic programming. The main advantage of the method is its flexibility: it can generate scenarios matching any prescribed set of moments of the underlying distribution rather than matching all moments up to a certain order, and the distribution can be defined over an arbitrary set. This allows for a reduction in the number of scenarios and allows the scenarios to be better tailored to the problem at hand. The method is based on a semi-infinite linear programming formulation of the problem that is shown to be solvable with polynomial iteration complexity. A practical column generation method is implemented. The column generation subproblems are polynomial optimization problems; however, they need not be solved to optimality. It is found that the columns in the column generation approach can be efficiently generated by random sampling. The number of scenarios generated matches a lower bound of Tchakaloff's. The rate of convergence of the approximation error is established for continuous integrands, and an improved bound is given for smooth integrands. Extensive numerical experiments are presented in which variants of the proposed method are compared to Monte Carlo and quasi-Monte Carlo methods on both numerical integration problems and stochastic optimization problems. The benefits of being able to match any prescribed set of moments, rather than all moments up to a certain order, is also demonstrated using optimization problems with 100-dimensional random vectors. Here, empirical results show that the proposed approach outperforms Monte Carlo and quasi-Monte Carlo based approaches on the tested problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Stochastic Programming Approach for Resource Selection under Demand Uncertainty

Cost-efficient selection and scheduling of a subset of geographically distributed resources to meet the demands of a scientific workflow is a challenging problem. The problem is exacerbated by uncertainties in demand and availability of resources. In this paper, we present a stochastic optimization based framework for robust decision making in the selection of distributed resources over a planning horizon under demand uncertainty. We present a novel two-stage stochastic programming model for resource selection, and implement an L-shaped decomposition algorithm to solve this model. A Sample Average Approximation algorithm is integrated to enable stochastic optimization to solve problems with a large number of scenarios. Using the metric of stochastic solution, we demonstrate up to 30% cost reduction relative to solutions without explicit consideration of demand uncertainty for a 24-month problem. We also demonstrate up to 54% cost reduction relative to a previously developed solution for a 36-month problem. We further argue that the composition of resources selected is superior to solutions computed without explicit consideration of uncertainties. Given the importance of resource selection and scheduling of complex scientific workflows, especially in the context of commercial cloud computing, we believe that our novel stochastic programming framework will benefit many researchers as well as users of distributed computing resources.

scientific workflows, task scheduling, optimizatio↗
DOE OSTI2018

Spatial and Spin Symmetry Breaking in Semidefinite-Programming-Based Hartree–Fock Theory

The Hartree–Fock problem was recently recast as a semidefinite optimization over the space of rank-constrained two-body reduced-density matrices (RDMs) [ Phys. Rev. A 2014, 89, 010502(R)]. This formulation of the problem transfers the nonconvexity of the Hartree–Fock energy functional to the rank constraint on the two-body RDM. We consider an equivalent optimization over the space of positive semidefinite one-electron RDMs (1-RDMs) that retains the nonconvexity of the Hartree–Fock energy expression. The optimized 1-RDM satisfies ensemble N-representability conditions, and ensemble spin-state conditions may be imposed as well. The spin-state conditions place additional linear and nonlinear constraints on the 1-RDM. We apply this RDM-based approach to several molecular systems and explore its spatial (point group) and spin (Ŝ 2 and Ŝ 3 ) symmetry breaking properties. When imposing Ŝ 2 and Ŝ 3 symmetry but relaxing point group symmetry, the procedure often locates spatial-symmetry-broken solutions that are difficult to identify using standard algorithms. For example, the RDM-based approach yields a smooth, spatial-symmetry-broken potential energy curve for the well-known Be–H 2 insertion pathway. We also demonstrate numerically that, upon relaxation of Ŝ 2 and Ŝ 3 symmetry constraints, the RDM-based approach is equivalent to real-valued generalized Hartree–Fock theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Optimization of the light detection system of the ICARUS detector

The Short Baseline Neutrino (SBN) Program at Fermilab is designed to investigate short-baseline neutrino oscillations and test the hypothesis of sterile neutrinos, motivated by several experimental anomalies observed over the past decades. Within this program, the ICARUS experiment plays a key role. It employs the world’s largest Liquid Argon Time Projection Chamber (LArTPC) and serves as the farthest and most sensitive SBN detector for studying muon and electron neutrino oscillations. A crucial subsystem of the ICARUS detector is the Light Detection System (LDS), which captures the prompt scintillation light produced by neutrino interactions in the 600-ton active liquid Argon volume. This system provides precise timing information that is essential for event reconstruction, the trigger system, and cosmic background rejection. The LDS is composed of 360 Hamamatsu R5912-MOD 8-inch photomultiplier tubes (PMTs), operating under cryogenic conditions ($\sim 87 \ K$) inside the detector’s cryostats. During the detector’s operation at FNAL, a degradation in PMT gain has been observed, attributed to aging under low-temperature conditions. In collaboration with ICARUS teams from INFN Pavia and Catania, I developed an experimental setup to study the temperature-dependent behavior of the PMTs, performing gain measurements both at room temperature and down to $-70°C$ using a climatic chamber at INFN Catania. The results indicate that while the PMTs maintain stable gain at room temperature, a significant and permanent gain reduction occurs at low temperatures. Although $-70°C$ is still warmer than liquid Argon temperatures, the findings clearly demonstrate a gain-dependent performance degradation. The thesis also discusses mitigation strategies implemented in the ICARUS detector to address this issue and presents a simplified model to describe and simulate the observed behavior.

Saia, Clara [Catania U.] (ORCID:0009000464102417)↗
DOE OSTI2018

Strategic Offering for Wind Power Producers Considering Energy and Flexible Ramping Products

The increasing deployments of renewable generation methods, such as wind, affects the flexibility of electric power system operating due to their inherent variability and uncertainty. To mitigate this, power systems need flexible resources. This paper investigates the potential for wind power to provide flexible ramping products in the real-time market, an additional value stream to the energy it provides. The proposed model for wind power’s strategic offering is formulated as a bi-level optimization problem with wind profit maximization at the upper level and the independent system operator’s economic dispatch—considering both the energy balance and the flexible ramping requirement to counter uncertainty—at the lower level. This bi-level model is converted to a mathematical program with equilibrium constraints (MPEC) by recasting the lower level problem with its Karush–Kuhn–Tucker optimality conditions. Then, through strong duality theory and the big-M method, the MPEC model is converted to a mixed-integer linear programming model. The opportunity cost and the price for wind power-providing ramping products are analyzed. Numerical examples based on a 5-bus network are presented to verify the proposed model and concept.

17 WIND ENERGY↗
DOE OSTI2015

SU-E-T-294: Dosimetric Analysis of Planning Phase Using Overlap Volume Histogram for Respiratory Gated Radiotherapy

Purpose: End-of-exhale (EOE) phase is generally preferred for gating window because tumor position is more reproducible. However, other gating windows might be more appropriate for dose distribution perspective. In this pilot study, we proposed to utilize overlap volume histogram (OVH) to search optimized gating window and demonstrated its feasibility. Methods: We acquired 4DCT of 10 phases for 3 lung patients (2 with a target at right middle lobe and 1 at right upper lobe). After structures were defined in every phase, the OVH of each OAR was generated to quantify the three dimensional spatial relationship between the PTV and OARs (bronchus, esophagus, heart and cord etc.) at each phase. OVH tells the overlap volume of an OAR according to outward distance from the PTV. Relative overlap volume at 20 mm outward distance from the PTV (ROV-20) was also defined as a metric for measuring overlap volume and obtained. For dose calculation, 3D CRT plans were made for all phases under the same beam angles and objectives (e.g., 95% of the PTV coverage with at least 100% of the prescription dose of 50 Gy). The gating window phase was ranked according to ROV-20, and the relationship between the OVH and dose distribution at each phase was evaluated by comparing the maximum dose, mean dose, and equivalent uniform dose of OAR. Results: OVHs showed noticeable difference from phase to phase, implying it is possible to find optimal phases for gating window. For 2 out of 3 patients (both with a target at RML), maximum dose, mean dose, and EUD increased as ROV-20 increased. Conclusion: It is demonstrated that optimal phases (in dose distribution perspective) for gating window could exist and OVH can be a useful tool for determining such phases without performing dose optimization calculations in all phases. This work was supported by the Radiation Technology R&D program (No. 2013M2A2A7043498) and the Mid-career Researcher Program (2012-007883) through the National Research Foundation (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) of Korea.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Just-in-Time Compilation and Link-Time Optimization for OpenMP Target Offloading

Following the mass adoption of external accelerators for high performance computing, the overall performance of many applications has become increasingly dependent on relatively small accelerated kernels. As static analysis is fundamentally limited by dynamic values and external definitions, standard ahead-of-time compilation is not always sufficient to achieve the best performance. Furthermore, many users looking to port an existing application to run on an external accelerator will not want to fundamentally restructure their programs. These and other problems can be addressed through both link-time optimization (LTO) and just-in-time (JIT) compilation, but until now had sparse and inconsistent support from the compiler. In this work, we present a new compilation method that enables device-side LTO as well as a transparent JIT compilation tool-chain for OpenMP target offloading. Our contributions include an entirely new device linking and embedding scheme to enable LTO as well as a novel JIT engine to efficiently optimize OpenMP offloading regions at run-time. We also introduce a persistent caching system to improve end-to-end runtime using the JIT engine and minimize kernel launching overheads. We measure the performance of our LTO and JIT implementation via several real-world scientific applications. With our optimizations we observe significant improvements through LTO on large applications as well as significant end-to-end execution time improvement using JIT.

Tian, Shilei↗
DOE OSTI2022

OPTIMIZATION OF A NUCLEAR VESSEL OUTLET FOR INCIDENT MONITORING

Classical nuclear core fluidic design techniques require improvement to better align with modern technological innovations. The US Department of Energy’s Office of Nuclear Energy (DOE-NE) Transformational Challenge Reactor (TCR) program is deploying additive manufacturing and advanced modeling and simulation to reimagine these designs. With the aid of modern computing power, computerized design optimization can be implemented to remove unwanted pressure drop while simultaneously optimizing flow structures, resulting in new opportunities to enable advanced instrumentation and monitoring capabilities.Previous development of geometric specifications for the TCR pressure vessel’s outlet plenum used design optimization to (1) limit pressure losses below 3.5 kPa (~0.5 psi) and (2) create a fluidic plane in which the temperature variation would not exceed ±5°C. This significant limit of the allowable pressure drop stems from the overarching goal of the TCR program to apply cutting edge techniques and unconventional thinking to demonstrate potential opportunities in additive manufacturing (AM).This paper expands the previous work by optimizing thermowell locations for robust measurements by explicitly modeling them and the resulting flow impacts. Additionally, a single core coolant channel was chosen to represent an event that causes an increased bulk flow temperature increase of 100°C.High fidelity unsteady Reynolds-averaged Navier-Stokes (URANS) simulations of the conjugate heat transfer problem were run in Siemen’s Star-CCM+ for this study. Next, the bulk flow temperature of a single coolant channel was increased by 100°C and was allowed to converge again. Finally, statistical analysis using a sequential probability ratio test (SPRT) was used to determine the elapsed time the thermocouples took to discover the increased bulk flow temperature.

See, Nate↗
DOE OSTI2016

Economic Analysis and Optimal Sizing for behind-the-meter Battery Storage

This paper proposes methods to estimate the potential benefits and determine the optimal energy and power capacity for behind-the-meter BSS. In the proposed method, a linear programming is first formulated only using typical load profiles, energy/demand charge rates, and a set of battery parameters to determine the maximum saving in electric energy cost. The optimization formulation is then adapted to include battery cost as a function of its power and energy capacity in order to capture the trade-off between benefits and cost, and therefore to determine the most economic battery size. Using the proposed methods, economic analysis and optimal sizing have been performed for a few commercial buildings and utility rate structures that are representative of those found in the various regions of the Continental United States. The key factors that affect the economic benefits and optimal size have been identified. The proposed methods and case study results cannot only help commercial and industrial customers or battery vendors to evaluate and size the storage system for behind-the-meter application, but can also assist utilities and policy makers to design electricity rate or subsidies to promote the development of energy storage.

Wu, Di↗