Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 901 records · Page 50

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗

Optimal control system design of an acid gas removal unit for an IGCC power plants with CO2 capture

Future IGCC plants with CO{sub 2} capture should be operated optimally in the face of disturbances without violating operational and environmental constraints. To achieve this goal, a systematic approach is taken in this work to design the control system of a selective, dual-stage Selexol-based acid gas removal (AGR) unit for a commercial-scale integrated gasification combined cycle (IGCC) power plant with pre-combustion CO{sub 2} capture. The control system design is performed in two stages with the objective of minimizing the auxiliary power while satisfying operational and environmental constraints in the presence of measured and unmeasured disturbances. In the first stage of the control system design, a top-down analysis is used to analyze degrees of freedom, define an operational objective, identify important disturbances and operational/environmental constraints, and select the control variables. With the degrees of freedom, the process is optimized with relation to the operational objective at nominal operation as well as under the disturbances identified. Operational and environmental constraints active at all operations are chosen as control variables. From the results of the optimization studies, self-optimizing control variables are identified for further examination. Several methods are explored in this work for the selection of these self-optimizing control variables. Modifications made to the existing methods will be discussed in this presentation. Due to the very large number of candidate sets available for control variables and due to the complexity of the underlying optimization problem, solution of this problem is computationally expensive. For reducing the computation time, parallel computing is performed using the Distributed Computing Server (DCS®) and the Parallel Computing® toolbox from Mathworks®. The second stage is a bottom-up design of the control layers used for the operation of the process. First, the regulatory control layer is designed followed by the supervisory control layer. Finally, an optimization layer is designed. In this paper, the proposed two-stage control system design approach is applied to the AGR unit for an IGCC power plant with CO{sub 2} capture. Aspen Plus Dynamics® is used to develop the dynamic AGR process model while MATLAB is used to perform the control system design and for implementation of model predictive control (MPC).

97 MATHEMATICS AND COMPUTING↗

Optimization of processor allocation for domain decomposed Monte Carlo calculations

Load imbalance plagues domain decomposed Monte Carlo calculations when sources are not uniform. Parallel efficiency for domain decomposed Monte Carlo transport calculations improves through a nonuniform allocation of processors over subdomains. In this work, we optimize the allocation with runtime diagnostics collected during a calibration step, then complete the full calculation. The diagnostic-based approach is compared to implicit filtering, an optimization algorithm for bound constrained noisy optimization problems. Finally, we consider both forward and hybrid radiation transport calculations to measure performance.

97 MATHEMATICS AND COMPUTING↗

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗

Improved stellarator permanent magnet designs through combined discrete and continuous optimizations

A common optimization problem in the areas of magnetized plasmas and fusion energy is the design of magnets to produce a given three-dimensional magnetic field distribution to high precision. When designing arrays of permanent magnets for stellarator plasma confinement, such problems have tens of thousands of degrees of freedom whose solutions, for practical reasons, should be constrained to discrete spaces. We perform a direct comparison between two algorithms that have been developed previously for this purpose, and demonstrate that composite procedures that apply both algorithms in sequence can produce substantially improved results. One approach uses a continuous, quasi-Newton procedure to optimize the dipole moments of a set of magnets and then projects the solution onto a discrete space. The second uses an inherently discrete greedy optimization procedure that has been enhanced and generalized for this work. Further, the approaches are both applied to design arrays cubic rare-Earth permanent magnets to confine a quasi-axisymmetric plasma with a magnetic field on axis of 0.5 T. The first approach tends to find solutions with higher field accuracy, whereas the second can find solutions with substantially (up to 30%) fewer magnets. When the approaches are combined, they can obtain solutions with magnet quantities comparable to the second approach while matching the field accuracy of the first.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

WE-AB-BRA-12: Post-Implant Dosimetry in Prostate Brachytherapy by X-Ray and MRI Fusion

Purpose: For post-implant dosimetric assessment after prostate brachytherapy, CT-MR fusion approach has been advocated due to the superior accuracy on both seeds localization and soft tissue delineation. However, CT deposits additional radiation to the patient, and seed identification in CT requires manual review and correction. In this study, we propose an accurate, low-dose, and cost-effective post-implant dosimetry approach based on X-ray and MRI. Methods: Implanted seeds are reconstructed using only three X-ray fluoroscopy images by solving a combinatorial optimization problem. The reconstructed seeds are then registered to MR images using an intensity-based points-to-volume registration. MR images are first pre-processed by geometric and Gaussian filtering, yielding smooth candidate seed-only images. To accommodate potential soft tissue deformation, our registration is performed in two steps, an initial affine followed by local deformable registrations. An evolutionary optimizer in conjunction with a points-to-volume similarity metric is used for the affine registration. Local prostate deformation and seed migration are then adjusted by the deformable registration step with external and internal force constraints. Results: We tested our algorithm on twenty patient data sets. For quantitative evaluation, we obtained ground truth seed positions by fusing the post-implant CT-MR images. Seeds were semi-automatically extracted from CT and manually corrected and then registered to the MR images. Target registration error (TRE) was computed by measuring the Euclidean distances from the ground truth to the closest registered X-ray seeds. The overall TREs (mean±standard deviation in mm) are 1.6±1.1 (affine) and 1.3±0.8 (affine+deformable). The overall computation takes less than 1 minute. Conclusion: It has been reported that the CT-based seed localization error is ∼1.6mm and the seed localization uncertainty of 2mm results in less than 5% deviation of prostate D90. The average error of 1.3mm with our system outperforms the CT-based approach and is considered well within the clinically acceptable limit. Supported in part by NIH/NCI grant 5R01CA151395. The X-ray-based implant reconstruction method (US patent No. 8,233,686) was licensed to Acoustic MedSystems Inc.

60 APPLIED LIFE SCIENCES↗

AI-assisted optimization of the ECCE tracking system at the Electron Ion Collider

The Electron-Ion Collider (EIC) is a cutting-edge accelerator facility that will study the nature of the “glue” that binds the building blocks of the visible matter in the universe. The proposed experiment will be realized at Brookhaven National Laboratory in approximately 10 years from now, with detector design and R&D currently ongoing. Notably, EIC is one of the first large-scale facilities to leverage Artificial Intelligence (AI) already starting from the design and R&D phases. The EIC Comprehensive Chromodynamics Experiment (ECCE) is a consortium that proposed a detector design based on a 1.5 T solenoid. The EIC detector proposal review concluded that the ECCE design will serve as the reference design for an EIC detector. Herein we describe a comprehensive optimization of the ECCE tracker using AI. The work required a complex parametrization of the simulated detector system. Herein our approach dealt with an optimization problem in a multidimensional design space driven by multiple objectives that encode the detector performance, while satisfying several mechanical constraints. We describe our strategy and show results obtained for the ECCE tracking system. The AI-assisted design is agnostic to the simulation framework and can be extended to other sub-detectors or to a system of sub-detectors to further optimize the performance of the EIC detector.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis

This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonlinear, non-convex optimization problem, and is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 N – k scenarios on seven power networks ranging in size from 70 to 6000 buses. Furthermore, the most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Novel Modular, Reconfigurable Battery Energy Storage System: Design, Control, and Experimentation

This paper presents a novel modular, reconfigurable battery energy storage system. The proposed design is characterized by a tight integration of reconfigurable power switches and DC/DC converters. This characteristic enables isolation of faulty cells from the system and allows fine power control for individual cells toward optimal system-level performance. An optimal power management approach is developed to extensively exploit the merits of the proposed design. Based on receding-horizon convex optimization, this approach aims to minimize the total power losses in charging/discharging while allocating the power in line with each cell’s condition to achieve state of-charge (SoC) and temperature balancing. By appropriate design, the approach manages to regulate the power of a cell across its full SoC range and guarantee the feasibility of the optimization problem. Here, we perform extensive simulations and further develop a lab-scale prototype to validate the proposed system design and power management approach.

25 ENERGY STORAGE↗

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗

Bounds for nonlocality distillation protocols

Nonlocality can be quantified by the violation of a Bell inequality. Since this violation may be amplified by local operations, an alternative measure has been proposed--distillable nonlocality. The alternative measure is difficult to calculate exactly due to the double exponential growth of the parameter space. In this paper, we give a way to bound the distillable nonlocality of a resource by the solutions to a related optimization problem. Our upper bounds are exponentially easier to compute than the exact value and are shown to be meaningful in general and tight in some cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A trilevel model against false gas-supply information attacks in electricity systems

The interdependence between natural gas and electricity systems is increasing rapidly due to the growing reliance on natural gas-fired generating units. Availability of natural gas for gas-fired generating units can impact the secure operation of electricity systems. Fuel supply shortage for gas-fired units can be caused by uncertain interruptible supply contracts and incorrect supply information. This article proposes a trilevel min-max-min defender-attacker-operator optimization problem to provide the power system operator a screening methodology that allocates a limited budget for best protecting critical fuel supply information, and also the strategies to sign firm supply contract to reduce natural gas supply uncertainties. We utilize a column and constraint generation (C&CG) algorithm to solve the proposed problem. We illustrate the effectiveness of this trilevel formulation using a case study based on IEEE 24-node test system.

42 ENGINEERING↗

Chance-constrained Service Restoration for Distribution Networks with Renewables

Power systems operation is facing great challenges from natural disasters and cyber-attacks. It is critical but also difficult to enhance the reliability and resilience against extreme events. To better response to inevitable outages or blackouts, service restoration in distribution networks is important to minimize the disastrous impacts of catastrophic events. The increasing penetration of distributed energy resources (DERs) provides new opportunities to expedite the restoration process. However, the coordination with conventional distribution system control devices and the uncertainty and variability of intermittent renewable energy resources requires new operation and control strategies for distribution service restoration (DSR). This paper develops an optimal bottom-up DSR strategy by coordinating DERs with voltage regulators and capacitor banks. The chance-constrained (CC) programming approach is used to model the probabilistic output limit of solar radiation and PV generation. The Markov's inequality and Latin hypercube sampling techniques are applied to convert and incorporate the chance constraints into the DSR optimization problem. The CC-DSR problem is formulated as a mixed integer convex programming problem, considering various operational cost functions and bidirectional three-phase unbalanced load flow. Simulation results on the modified IEEE 13-node test feeder system demonstrate the effectiveness and flexibility of the bottom-up DSR strategy.

Chance constrained optimization, Distribution serv↗

Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization

One of the most complicating factors in decentralized solution methods for a broad range of power system optimization problems is the modeling of power flow equations. Existing formulations for direct current power flows either have limited scalability or are very dense and unstructured, making them unsuitable for large-scale decentralized studies. Here, in this work, we present a novel sparsified variant of the injection shift factors formulation, which has a decomposable block-diagonal structure and scales well for large systems. We also propose a decentralized solution method, based on the alternating direction multiplier method, that efficiently handles transmission line outages in N-1 security requirements. Benchmarks on multizonal security-constrained unit commitment problems show that the proposed formulation and algorithm can reliably and efficiently solve interconnection-level test systems with up to 6,515 buses with no convergence or numerical issues.

Alternating-method of multipliers (ADMM)↗

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.

42 ENGINEERING↗

A Multi-Objective, Hub-and-Spoke Supply Chain Design Model for Densified Biomass

In this paper we propose a model to design the supply chain for densified biomass. Rail is typically used for longhaul, high-volume shipment of densified biomass. This is the reason why a hub-and-spoke network structure is used to model this supply chain. The model is formulated as a multi-objective, mixed-integer programing problem under economic, environmental, and social criteria. The goal is to identify the feasibility of meeting the Renewable Fuel Standard (RFS) by using biomass for production of cellulosic ethanol. The focus is not just on the costs associated with meeting these standards, but also exploring the social and environmental benefits that biomass production and processing offers by creating new jobs and reducing greenhouse gas (GHG) emissions. We develop an augmented ?-constraint method to find the exact Pareto solution to this optimization problem. We develop a case study using data from the Mid-West. The model identifies the number, capacity and location of biorefineries needed to make use of the biomass available in the region. The model estimates the delivery cost of cellulosic ethanol under different scenario, the number new jobs created and the GHG emission reductions in the supply chain.

09 BIOMASS FUELS↗

Deep Sigma Point Processes-Assisted Chance-Constrained Power System Transient Stability Preventive Control

Here this paper proposes a deep sigma point processes (DSPP)-assisted chance-constrained power system transient stability preventive control method to deal with uncertain renewable energy and loads-induced stability risk. The traditional transient stability-constrained preventive control is reformulated as a chance-constrained optimization problem. To deal with the computational bottleneck of the time-domain simulation-based probabilistic transient stability assessment, the DSPP is developed. DSPP is a parametric Bayesian approach that allows us to predict system transient stability with high computational efficiency while accurately quantifying the confidence intervals of the predictions that can be used to inform system instability risk. To this end, with a given preset confidence probability, we embed DSPP into the primal dual interior point method to help solve the chance-constrained preventive control problem, where the corresponding Jacobian and Hessian matrices are derived. Comparison results with other existing methods show that the proposed method can significantly speed up preventive control while maintaining high accuracy and convergence

97 MATHEMATICS AND COMPUTING↗

Mobile Emergency Generator Pre-Positioning and Real-Time Allocation for Resilient Response to Natural Disasters

Truck-mounted mobile emergency generators (MEGs) are critical flexibility resources of distribution systems (DSs) for resilient emergency response to natural disasters. However, they are currently under-utilized. For better utilization, this paper proposes dispatching MEGs as distributed generators in DSs to restore critical loads by forming multiple microgrids (MGs). As the travel time of MEGs on road networks (RNs) can greatly influence the outage duration of critical loads, a two-stage dispatch framework consisting of pre-positioning and real-time allocation is introduced, and the traffic issue is considered via the vehicle routing problem. Pre-positioning places MEGs in staging locations prior to a natural disaster, while real-time allocation sends MEGs from staging locations to restore critical loads by forming MGs in DSs after the natural disaster strikes. Specifically, with the objective of minimizing the expected outage duration of loads considering their priorities and demand sizes, pre-positioning is done via a scenario-based two-stage stochastic optimization problem, in which the first-stage pre-positioning decisions are evaluated by numbers of second-stage real-time allocation problems corresponding to considered scenarios of DS damage and RN damage/congestion. A scenario decomposition algorithm is applied to solve this problem. Illustrative cases demonstrate the effectiveness of the proposed dispatch scheme and algorithm.

Lei, Shunbo (ORCID:0000000181690821)↗