Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational optimization”

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

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

At least 1,801 records · Page 100

Solving the Unit Commitment Problem: Polyhedral Theory, Symmetry, and Power Flow

In this talk, I will give an overview of mixed integer linear programming (MILP) formulations and extensions thereof which enable the effective solution of the unit commitment problem (UC) when paired with a commercial MILP solver. First, we will place UC in context, stressing the importance of achieving a (near) optimal solution. Then we will discuss the importance of perfect and "good-enough" formulations for individual generators / market participants. Some of these formulations enable symmetry-aware reformulations for identical market participants, which can be critical when symmetry is present. Finally, we will discuss approximations of AC power flow currently used in practice, and the challenges with including these approximations within the UC formulation.

MATHEMATICS AND COMPUTING↗

Unlocking the magic in mycelium: Using synthetic biology to optimize filamentous fungi for biomanufacturing and sustainability

Filamentous fungi drive carbon and nutrient cycling across our global ecosystems, through its interactions with growing and decaying flora and their constituent microbiomes. The remarkable metabolic diversity, secretion ability, and fiber-like mycelial structure that have evolved in filamentous fungi have been increasingly exploited in commercial operations. The industrial potential of mycelial fermentation ranges from the discovery and bioproduction of enzymes and bioactive compounds, the decarbonization of food and material production, to environmental remediation and enhanced agricultural production. Despite its fundamental impact in ecology and biotechnology, molds and mushrooms have not, to-date, significantly intersected with synthetic biology in ways comparable to other industrial cell factories (e.g. Escherichia coli,Saccharomyces cerevisiae, and Komagataella phaffii). In this review, we summarize a suite of synthetic biology and computational tools for the mining, engineering and optimization of filamentous fungi as a bioproduction chassis. A combination of methods across genetic engineering, mutagenesis, experimental evolution, and computational modeling can be used to address strain development bottlenecks in established and emerging industries. These include slow mycelium growth rate, low production yields, non-optimal growth in alternative feedstocks, and difficulties in downstream purification. In the scope of biomanufacturing, we then detail previous efforts in improving key bottlenecks by targeting protein processing and secretion pathways, hyphae morphogenesis, and transcriptional control. Bringing synthetic biology practices into the hidden world of molds and mushrooms will serve to expand the limited panel of host organisms that allow for commercially-feasible and environmentally-sustainable bioproduction of enzymes, chemicals, therapeutics, foods, and materials of the future.

59 BASIC BIOLOGICAL SCIENCES↗

Risk-averse optimal control of semilinear elliptic PDEs

In this paper, we consider the optimal control of semilinear elliptic PDEs with random inputs. These problems are often nonconvex, infinite-dimensional stochastic optimization problems for which we employ risk measures to quantify the implicit uncertainty in the objective function. In contrast to previous works in uncertainty quantification and stochastic optimization, we provide a rigorous mathematical analysis demonstrating higher solution regularity (in stochastic state space), continuity and differentiability of the control-to-state map, and existence, regularity and continuity properties of the control-to-adjoint map. Our proofs make use of existing techniques from PDE-constrained optimization as well as concepts from the theory of measurable multifunctions. We illustrate our theoretical results with two numerical examples motivated by the optimal doping of semiconductor devices.

97 MATHEMATICS AND COMPUTING↗

Optimization of Integrated Energy Systems

Integrated energy systems that couple nuclear power plants with additional products including hydrogen, storage, or synthetic fuels provide a more flexible energy source that can be more economical than generating electricity alone. Determining the size and shape of these systems and optimizing their operation is challenging. INL, through the IES program, has developed optimization software to help solve these challenges. Holistic Energy Resource Optimization Network (HERON) is a software tool to optimize the size and capacity of integrated energy systems using stochastic optimization. Optimization of Real-time Capacity Allocation (ORCA) is a software tool under development to perform real-time economic optimization of these systems using economic model predictive control. An overview of these tools and a discussion of their optimization methods will be presented in this talk.

97 MATHEMATICS AND COMPUTING↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

IPIP: A new approach to inverse planning for HDR brachytherapy by directly optimizing dosimetric indices

Purpose: Many planning methods for high dose rate (HDR) brachytherapy require an iterative approach. A set of computational parameters are hypothesized that will give a dose plan that meets dosimetric criteria. A dose plan is computed using these parameters, and if any dosimetric criteria are not met, the process is iterated until a suitable dose plan is found. In this way, the dose distribution is controlled by abstract parameters. The purpose of this study is to develop a new approach for HDR brachytherapy by directly optimizing the dose distribution based on dosimetric criteria. Methods: The authors developed inverse planning by integer program (IPIP), an optimization model for computing HDR brachytherapy dose plans and a fast heuristic for it. They used their heuristic to compute dose plans for 20 anonymized prostate cancer image data sets from patients previously treated at their clinic database. Dosimetry was evaluated and compared to dosimetric criteria. Results: Dose plans computed from IPIP satisfied all given dosimetric criteria for the target and healthy tissue after a single iteration. The average target coverage was 95%. The average computation time for IPIP was 30.1 s on an Intel(R) Core{sup TM}2 Duo CPU 1.67 GHz processor with 3 Gib RAM. Conclusions: IPIP is an HDR brachytherapy planning system that directly incorporates dosimetric criteria. The authors have demonstrated that IPIP has clinically acceptable performance for the prostate cases and dosimetric criteria used in this study, in both dosimetry and runtime. Further study is required to determine if IPIP performs well for a more general group of patients and dosimetric criteria, including other cancer sites such as GYN.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers

The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite, and they become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL T decompositions. Here, we benchmark five well known direct linear solver packages on CPU- and GPU-based hardware, using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases. For completeness of the comparison we include results for MA57, which is one of the most efficient and reliable CPU solvers for this class of problem.

97 MATHEMATICS AND COMPUTING↗

Reliability‐based layout optimization in offshore wind energy systems

Abstract Existing methods for optimizing wind array layouts typically use power or cost objectives and rarely consider reliability‐based objectives. Component and system failure rates, however, are dependent on location‐specific wind conditions, are influenced by array layout and wake interactions, and have a direct and significant impact on capital costs, operational costs, and power production. Although wind power plant models exist that calculate wind loads with sufficient resolution to capture component loading dynamics from wind conditions, they are computationally expensive and thus not suitable for research applications requiring many evaluations, particularly optimization. This study describes the development of computationally efficient, reliability‐based layout optimization methods, enabling us to explore the relationship between component reliability and layout optimization. These methods include the surrogate modeling of the planet bearing life based on varying wind conditions simulated in FAST.Farm and the formulation of reliability‐based objectives based on failure cost and power production models. Through demonstration of this method, we explore how wind conditions, objective functions, and capacity density influence reliability‐based layout optimization. Results indicate that considering reliability alongside power production can reduce failure costs associated with replacement costs and downtime while maintaining or improving power production. Our conclusions highlight the opportunity for wind power plant developers to integrate reliability and operational expenditures alongside performance and capital expenditure objectives in plant design and development to improve plant performance and costs.

17 WIND ENERGY↗

Approximate Synthesis of Distributed Optimal Control for Hyperbolic Equations with Rapidly Oscillating Coefficients

We study the problem of finding approximations to the optimal control with respect to a quadratic-type quality criterion in the form of feedback (synthesis) for a linear-quadratic problem in the from of a hyperbolic equation with rapidly oscillating coefficients and distributed control on the right-hand side. On the basis of the exact formula of synthesis, its approximate version (based on the replacement of the rapidly oscillating variables by averaged quantities) is substantiated.

97 MATHEMATICS AND COMPUTING↗

Efficient Parallelization of Irregular Applications on GPU Architectures

With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.

Wang, Qihan↗

RayStation: External beam treatment planning system

RaySearch Laboratories is a world leader in the field of advanced software and creator of the RayStation treatment planning system for radiation therapy. The aim with RayStation is to deliver an unmatched user experience and leading functionality. Unique features described here include multiatlas based autosegmentation for contouring, deformable registration with 2 different algorithms, multicriteria optimization, Plan Explorer, fallback planning, ultrafast computation speed, and 4-dimensional (4D) adaptive radiation therapy. RayStation can be used to plan for electrons and photons on traditional linacs, for protons on various delivery systems, and for Accuray's helical TomoTherapy system. This paper describes some of these modalities, with reference to clinical cases and including descriptions of the impact on workflow.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Quantum logic gates from time-dependent global magnetic field in a system with constant exchange

We propose a method that implements a universal set of one- and two-quantum-bit gates for quantum computation in a system of coupled electron pairs with constant non-diagonal exchange interaction. In our proposal, suppression of the exchange interaction is performed by the continual repetition of single-spin rotations. A small g-factor difference between the electrons allows for addressing qubits and avoiding strong magnetic field pulses. Numerical experiments were performed to show that, to implement the one- and two-qubit operations, it is sufficient to change the strength of the magnetic field by a few Gauss. This introduces one and then the other electron in a resonance. To determine the evolution of the two-qubit system, we use the algorithms of optimal control theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Toward an optimal online checkpoint solution under a two-level HPC checkpoint model

The traditional single-level checkpointing method suffers from significant overhead on large-scale platforms. Hence, multilevel checkpointing protocols have been studied extensively in recent years. The multilevel checkpoint approach allows different levels of checkpoints to be set (each with different checkpoint overheads and recovery abilities), in order to further improve the fault tolerance performance of extreme-scale HPC applications. How to optimize the checkpoint intervals for each level, however, is an extremely difficult problem. In this paper, we construct an easy-to-use two-level checkpoint model. Checkpoint level 1 deals with errors with low checkpoint/recovery overheads such as transient memory errors, while checkpoint level 2 deals with hardware crashes such as node failures. Compared with previous optimization work, our new optimal checkpoint solution offers two improvements: (1) it is an online solution without requiring knowledge of the job length in advance, and (2) it shows that periodic patterns are optimal and determines the best pattern. We evaluate the proposed solution and compare it with the most up-to-date related approaches on an extreme-scale simulation testbed constructed based on a real HPC application execution. Simulation results show that our proposed solution outperforms other optimized solutions and can improve the performance significantly in some cases. Specifically, with the new solution the wall-clock time can be reduced by up to 25.3% over that of other state-of-the-art approaches. Lastly, a brute-force comparison with all possible patterns shows that our solution is always within 1% of the best pattern in the experiments.

97 MATHEMATICS AND COMPUTING↗

Three-dimensional traction microscopy accounting for cell-induced matrix degradation

Tractions exerted by cells on the extracellular matrix (ECM) are critical in many important physiological and pathological processes such as embryonic morphogenesis, wound healing, and cancer metastasis. Three-dimensional Traction Microscopy (3DTM) is a tool to quantify cellular tractions by first measuring the displacement field in the ECM in response to these tractions, and then using this measurement to infer tractions. Most applications of 3DTM have assumed that the ECM has spatially-uniform mechanical properties, but cells secrete enzymes that can locally degrade the ECM. In this work, a novel computational method is developed to quantify both cellular tractions and ECM degradation. In particular, the ECM is modeled as a hyperelastic, Neo-Hookean solid, whose material parameters are corrupted by a single degradation parameter. The feasibility of determining both the traction and the degradation parameter is first demonstrated by showing the existence and uniqueness of the solution. An inverse problem is then formulated to determine the nodal values of the traction vector and the degradation parameter, with the objective of minimizing the difference between a predicted and measured displacement field, under the constraint that the predicted displacement field satisfies the equation of equilibrium. The inverse problem is solved by means of a gradient-based optimization approach, and the gradient is computed efficiently using appropriately derived adjoint fields. The computational method is validated in-silico using a geometrically realistic neuronal cell model and synthetic traction and degradation fields. It is found that the method accurately recovers both the traction and degradation fields. Moreover, it is found that neglecting ECM degradation can yield significant errors in traction measurements. Finally, our method can extend the range of context where tractions can be appropriately measured.

42 ENGINEERING↗

Stochastic DC optimal power flow with reserve saturation

We propose an optimization framework for stochastic optimal power flow with uncertain loads and renewable generator capacity. Our model follows previous work in assuming that generator outputs respond to load imbalances according to an affine control policy, but introduces a model of saturation of generator reserves by assuming that when a generator’s target level hits its limit, it abandons the affine policy and produces at that limit. This is a particularly interesting feature in models where wind power plants, which have uncertain upper generation limits, are scheduled to provide reserves to balance load fluctuations. Here, the resulting model is a nonsmooth nonconvex two-stage stochastic program, and we use a stochastic approximation method to find stationary solutions to a smooth approximation. Computational results on 6-bus and 118-bus test instances demonstrate that by considering the effects of saturation, our model can yield solutions with lower expected generation costs (at the same target line violation probability level) than those obtained from a model that enforces the affine policy to stay within generator limits with high probability.

17 WIND ENERGY↗

FOILPOLARS (Grassmannian Foil Shape Sweeps for Polar Generation) [SWR-26-095]

FOILPOLARS (Grassmannian Foil Shape Sweeps for Polar Generation): Multifidelity aerodynamic polar data generation for hydrofoil/tidal-turbine airfoil sections. Foilpolars ties together three pieces: *AeroSandbox supplies the baseline airfoil coordinates (UIUC database). *G2Aero parameterizes those shapes on a Grassmannian manifold (Karcher mean + PGA basis) and samples new perturbed shapes around that basis. *XFoil (panel method) and NeuralFoil (neural-network surrogate, shipped with AeroSandbox) each solve the resulting shapes for lift, drag, moment, and pressure at the swept angles of attack, Reynolds numbers, and n_crit values. Design optimization of foil shapes in a computationally efficient way requires polars data across many candidate shapes, not just a handful of baseline foils. However, high-fidelity CFD at that scale is too costly, and naive shape perturbation strays from realistic geometries. FOILPOLARS addresses this by loading baseline airfoils (via AeroSandbox) and mapping them onto a Grassmannian manifold (via G2Aero), computing a Karcher mean and principal geodesic analysis (PGA) basis. New shapes are sampled by perturbing PGA coefficients, keeping them close to the manifold of realistic foils. Each sampled shape is evaluated across a configurable sweep of angle of attack, Reynolds number, and critical amplification factor using two solvers: XFoil (panel method) and NeuralFoil (neural-network surrogate), producing a paired dataset of lift, drag, moment, pressure, convergence, and confidence, indexed alongside each shape's PGA coefficients and shared Grassmannian basis in a single xarray dataset. From this, FOILPOLARS produces convergence summaries and comparison plots per shape, Reynolds number, and n_crit. A command-line interface exposes each pipeline stage independently, supporting data-driven design, optimization, and machine-learning workflows for foils.

Sandhu, Rimple [National Laboratory of the Rockies↗

Quantum-Inspired Power System Reliability Assessment

To enable an in-depth study of power system operation and planning, the assessment of standard reliability indices is inevitable. The Monte Carlo Simulation (MCS) approach is a broadly used method in replacing the analytical methods in reliability indices assessment. The accuracy of MCS, however, highly depends on the sampling size, and hence, a complicated system with large number of components requires a large sampling size and daunting computational effort. To address this shortcoming, we, in this paper attempt to take advantage of potentials of the quantum computing (QC) for power system reliability assessment by realizing the following contributions: 1) an innovative quantum model designed for reliability assessment; 2) a quantum circuit that achieves the quadratic speed up compared to the classical MCS method; 3) an efficient quantum amplitude estimation (QAE) algorithm to accurately evaluate the reliability indices. The accuracy and efficacy of the quantum reliability method are extensively verified and demonstrated on both radial and mesh distribution systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

WISP: Watching grid Infrastructure Stealthily through Proxies (Final Technical Report)

The complex interdependencies of cyber systems (sensors and communications), physical grids and associated electricity market operations make protecting electric power grids a significant challenge. The energy sector is constantly under new, targeted, advanced and dangerous cyber-attacks that have the potential to result in the loss of human life. These threats are further exacerbated by our need to modernize the grid. One focus of cyber security research in smart grids is the securing of the SCADA system through advanced intrusion detection systems (IDS) and bad data detection algorithms in state estimation. These methods either require full knowledge of the system topology and parameters or fail to understand the physical behaviors under attack. WISP (Watching grid Infrastructure Stealthily through Proxies) is designed to provide additional protection to the power grid using only publicly available data. In particular, WISP exploits the spatio-temporal nature of the real time locational marginal prices (LMPs), in conjunction with other information such as bids, weather, outages and load data to analyze anomalous power pricing behaviors and then correlate those observations to localize regions of interest and identify potential cyber events. WISP is non-intrusive as the tool is deployed as a service in the Cloud or on premise and provides reliable information to system operators for enhanced situational awareness, without impeding energy delivery functions. The WISP technology comprises three modules: the data-driven anomaly detection core, the vulnerability and risk analysis and the root cause analysis. The data-driven anomaly detection core performs the tasks of feature selection, anomaly detection and attack region localization. The vulnerability and risk analysis module provides system level information of the vulnerable variables and times, assisting the operators in selecting monitoring and protection nodes. The root cause analysis module takes the detection results and identifies potential operational conditions that contribute to the detected anomalies. In Phase I, we have demonstrated the feasibility and effectiveness of WISP. We developed a realistic electricity market simulator capable of generating normal and attack market data under various operational conditions. We developed a series of cyber-attack detection and analysis algorithms and evaluated them under multiple data sources. Finally, we integrated all modules into an end-to-end software, providing functions for data management, data analytics and visualization. Specifically, we have achieved: (i) real-time data acceptance from external utility interfaces with >99% acceptance rate; (ii) high performance anomaly detection algorithms with >98% detection accuracy and <0.1% false alarm rate; and (iii) ultra-low computing delay <50 milliseconds. Additionally, our team developed algorithms to identify the vulnerable variables in electricity market operations and root cause analysis functions to identify major contributors to the price spikes. These ancillary modules are necessary when deploying WISP in real world industry environment. In Phase II, we have demonstrated the effectiveness of WISP software on realistic largescale power systems. We performed red team testing for the Phase I WISP software and identified software vulnerabilities and implemented corresponding mitigation solutions. We adapted the electricity market simulator for the Texas synthetic 2000-bus system and generated datasets for the false data injection attacks. We created database and visualization interfaces for the Texas system and the ISO New England system. We performed software optimization in terms of operation efficiency, computing speed and detection accuracy. Finally, we tested the software on the Texas system and the ISO New England system and evaluated the detection performance. Overall, we achieved above 89% detection rate, below 3% false alarm rate and below 37 seconds of end-to-end detection delay.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Refine your search to explore more results.