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 1,783 records · Page 99

Accelerating error correction in tomographic reconstruction

Abstract Spurred by recent advances in detector technology and X-ray optics, upgrades to scanning-probe-based tomographic imaging have led to an exponential growth in the amount and complexity of experimental data and have created a clear opportunity for tomographic imaging to approach single-atom sensitivity. The improved spatial resolution, however, is highly susceptible to systematic and random experimental errors, such as center of rotation drifts, which may lead to imaging artifacts and prevent reliable data extraction. Here, we present a model-based approach that simultaneously optimizes the reconstructed specimen and sinogram alignment as a single optimization problem for tomographic reconstruction with center of rotation error correction. Our algorithm utilizes an adaptive regularizer that is dynamically adjusted at each alternating iteration step. Furthermore, we describe its implementation in a software package targeting high-throughput workflows for execution on distributed-memory clusters. We demonstrate the performance of our solver on large-scale synthetic problems and show that it is robust to a wide range of noise and experimental drifts with near-ideal throughput.

Ali, Sajid (ORCID:0000000321864636)↗

Lignin valorization process control under feedstock uncertainty through a dynamic stochastic programming approach

The randomness introduced by reactants is an issue when processing renewable bioresources. In this paper, we apply tools from dynamic stochastic programming theory to the biochemical process. Instead of introducing extra preprocessing units, we consider the inherent randomness of the process and optimize in expectation the performance of the system. In a general setting, this is a multistage stochastic optimization problem and we investigate its approximate solution via two approaches, namely stochastic dual dynamic programming (SDDP) and the finite state, finite action Markov decision process (MDP) framework. These two methods are implemented to a case study of lignin valorization that is crucial to a cost-effective biorefinery process using biomass as the feedstock.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Mixed integer linear programming‐based distributed energy management for networked microgrids considering network operational objectives and constraints

Abstract Mixed integer linear programming (MILP)–based distributed energy management for networked microgrids embedded modern distribution systems is proposed. Considering the diverse ownership of microgrids, distributed energy resources (DERs) that interface directly with utilities and responsive loads, an alternating direction method of multipliers–based distributed framework was formulated for the scheduling of networked microgrids embedded modern distribution systems by adjusting nodal price signals iteratively. In addition, to make the formulated optimization problems resolvable through more accessible and popular MILP solvers, different linearisation techniques were employed to transform the nonlinear terms into linear or mixed integer linear formats. The proposed MILP‐based distributed method preserves all participants' autonomy (e.g., microgrids, DERs that interface directly with utilities and responsive loads), while incentivising them to actively participate in the distribution system operation with price signals. The proposed method is validated with results of numerical simulation using a modern distribution system consisting of multiple networked microgrids, DERs that interface directly with utilities, as well as responsive loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-driven based coordinated smart inverter control for distributed energy resources

Smart inverters (SI) for distributed energy resources (DER) are becoming popular since they have the ability to stabilize as well as restore the voltage and frequency of power systems. Aiming at establishing the mathematical models combined with SI control methods, multiple optimization methods are developed. However, the computational complexity of solving such a mathematical model with various uncertainties limits the real-time application of the SI control. To conquer this challenge, a data-driven-based SI control approach is developed to achieve coordinated control in the high penetration DER system. First, an optimization problem for maximizing the active power generation and minimizing the power loss is designed using the Volt/VAR control. To reduce the time consumption, the recurrent neural network (RNN) is proposed to model the relationship between the uncertainties and control actions during the offline site. The RNN with different sub-structures such as the long short-term memory cell and gated recurrent unit cell are included to enrich the diversity of features. In the last stage, different experiment comparisons, including multiple uncertainties maps and stateof- art machine learning methods, are conducted to verify the effectiveness of the proposed method based on the IEEE 123 bus power system. The results demonstrate that the proposed method can effectively achieve a rapid and coordinated control with a lower error rate.

Qiu, Wei↗

Coordinative Real-time Sub-Transmission Volt-VAr Control for Reactive Power Regulation between Transmission and Distribution Systems

This paper introduces an integrated voltage regulation approach to coordinate the Volt-VAr control between transmission and distribution systems. Distributed photovoltaic (PV) systems are aggregated as a virtual power plant (VPP). At the sub-transmission level, a Coordinated Real-time Sub-Transmission Volt-VAr Control Tool (CReST-VCT) is introduced to coordinate the operation of the shunt devices and the reactive power provided by the VPPs. The CReST-VCT uses an enhanced Volt-VAr control algorithm with weighted voltage control objects that include minimizing losses, maintaining the voltage within desirable levels, and minimizing the number of mechanical switching of shunt elements. The algorithm runs every 5 minutes and is solved using AC optimal power flow (OPF) solution technique. The outputs include the settings for each sub-transmission-level Volt-VAr control devices and the reactive power generation requirements for each VPP. Then, each VPP will run a distribution Volt-VAr control algorithm to select the PV inverters that provide the Volt-VAr control services considering the distribution network topology. The goal of the VPP reactive power control is to meet the transmission level service requirements while maintaining the voltage and line flow in the distribution system within limits. Each VPP will update its voltage regulation capacity every 5 minutes to allow the CReST-VCT to formulate the optimization problem for the next dispatch interval. The proposed tool is simulated on Duke Energy Carolina system to demonstrate the capability of providing voltage support service by dispatching of reactive power of distributed PV as VPP.

Ke, Xinda↗

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Goal-oriented sensitivity analysis for lattice kinetic Monte Carlo simulations

In this paper we propose a new class of coupling methods for the sensitivity analysis of high dimensional stochastic systems and in particular for lattice Kinetic Monte Carlo (KMC). Sensitivity analysis for stochastic systems is typically based on approximating continuous derivatives with respect to model parameters by the mean value of samples from a finite difference scheme. Instead of using independent samples the proposed algorithm reduces the variance of the estimator by developing a strongly correlated-“coupled”- stochastic process for both the perturbed and unperturbed stochastic processes, defined in a common state space. The novelty of our construction is that the new coupled process depends on the targeted observables, e.g., coverage, Hamiltonian, spatial correlations, surface roughness, etc., hence we refer to the proposed method as goal-oriented sensitivity analysis. In particular, the rates of the coupled Continuous Time Markov Chain are obtained as solutions to a goal-oriented optimization problem, depending on the observable of interest, by considering the minimization functional of the corresponding variance. We show that this functional can be used as a diagnostic tool for the design and evaluation of different classes of couplings. Furthermore, the resulting KMC sensitivity algorithm has an easy implementation that is based on the Bortz–Kalos–Lebowitz algorithm's philosophy, where events are divided in classes depending on level sets of the observable of interest. Finally, we demonstrate in several examples including adsorption, desorption, and diffusion Kinetic Monte Carlo that for the same confidence interval and observable, the proposed goal-oriented algorithm can be two orders of magnitude faster than existing coupling algorithms for spatial KMC such as the Common Random Number approach. We also provide a complete implementation of the proposed sensitivity analysis algorithms, including various spatial KMC examples, in a supplementary MATLAB source code.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Genetic algorithm-based geometry calibration for dynamic compression x-ray diffraction experiments

An important component of dynamic compression x-ray diffraction (XRD) experiment analysis is geometry calibration: proper data interpretation requires knowledge of the precise detector position and orientation and, if the experiment involves a single-crystal sample, knowledge of the lattice orientation. The determination of these parameters in the arbitrary three-dimensional (3D) scattering geometries often present in dynamic compression facilities is challenging, as the associated optimization problem can be highly nonlinear, nonsmooth, and discontinuous. We present a genetic algorithm-based approach for performing dynamic compression XRD calibrations that overcomes these obstacles. We provide details regarding the image processing, algorithm implementation, and open-source software deployment and demonstrate the capability of the approach to calibrate the detector and crystal parameters in 3D geometries. Notably, we demonstrate the solver’s capacity to find the crystal orientation without a priori rotation constraints.

Brown, Nathan P. [Sandia National Laboratories (SN↗

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗

Optimal control and Galois theory

An important role is played in the solution of a class of optimal control problems by a certain special polynomial of degree 2(n−1) with integer coefficients. The linear independence of a family of k roots of this polynomial over the field Q implies the existence of a solution of the original problem with optimal control in the form of an irrational winding of a k-dimensional Clifford torus, which is passed in finite time. In the paper, we prove that for n≤15 one can take an arbitrary positive integer not exceeding [n/2] for k. The apparatus developed in the paper is applied to the systems of Chebyshev-Hermite polynomials and generalized Chebyshev-Laguerre polynomials. It is proved that for such polynomials of degree 2m every subsystem of [(m+1)/2] roots with pairwise distinct squares is linearly independent over the field Q. Bibliography: 11 titles.

97 MATHEMATICS AND COMPUTING↗

Targeted evolution of pinning landscapes for large superconducting critical currents

The ability of type II superconductors to carry large amounts of current at high magnetic fields is a key requirement for future design innovations in high-field magnets for accelerators and compact fusion reactors, and largely depends on the vortex pinning landscape comprised of material defects. The complex interaction of vortices with defects that can be grown chemically, e.g., self-assembled nanoparticles and nanorods, or introduced by postsynthesis particle irradiation precludes a priori prediction of the critical current and can result in highly nontrivial effects on the critical current. Here, we borrow concepts from biological evolution to create a vortex pinning genome based on a genetic algorithm, naturally evolving the pinning landscape to accommodate vortex pinning and determine the best possible configuration of inclusions for two different scenarios: a natural evolution process initiating from a pristine system and one starting with preexisting defects to demonstrate the potential for a postprocessing approach to enhance critical currents. Furthermore, the presented approach is even more general and can be adapted to address various other targeted material optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Mass Optimization of a Multilayered Shield for Transportable Microreactors

The ability to easily transport microreactors is a major selling point for deploying microreactors to remote areas. However, this creates a unique shielding challenge, especially when the microreactor is being shipped after irradiation. A traditional reactor configuration utilizes a separate biological shield and pressure vessel to meet radiological shielding and pressure needs. The limited space available for transportable microreactors for both shielding and pressure vessels requires a revised assessment of separating out the biological shield and pressure vessel. To address these concerns, we examine a nuclear-grade sandwich composite (NGSC) that combines the reactor pressure vessel and biological shielding functions into a single component. Through a series of optimization problems for both transportation and operational use cases, the NGSC is able to minimize dose, minimize the vessel cost, and ensure that weight requirements are met for transportation. Initial results show that using a tungsten-tetraboride cermet in the first two layers of a six-layer NGSC provides adequate shielding for both use cases. These results show promise that an NGSC has enough overlap between operational and transportation cases to help reduce the design space for future analysis and assessment.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

SkyFACT: high-dimensional modeling of gamma-ray emission with adaptive templates and penalized likelihoods

We present SkyFACT (Sky Factorization with Adaptive Constrained Templates), a new approach for studying, modeling and decomposing diffuse gamma-ray emission. Like most previous analyses, the approach relies on predictions from cosmic-ray propagation codes like GALPROP and DRAGON. However, in contrast to previous approaches, we account for the fact that models are not perfect and allow for a very large number (∼> 10{sup 5}) of nuisance parameters to parameterize these imperfections. We combine methods of image reconstruction and adaptive spatio-spectral template regression in one coherent hybrid approach. To this end, we use penalized Poisson likelihood regression, with regularization functions that are motivated by the maximum entropy method. We introduce methods to efficiently handle the high dimensionality of the convex optimization problem as well as the associated semi-sparse covariance matrix, using the L-BFGS-B algorithm and Cholesky factorization. We test the method both on synthetic data as well as on gamma-ray emission from the inner Galaxy, |ℓ|<90{sup o} and | b |<20{sup o}, as observed by the Fermi Large Area Telescope. We finally define a simple reference model that removes most of the residual emission from the inner Galaxy, based on conventional diffuse emission components as well as components for the Fermi bubbles, the Fermi Galactic center excess, and extended sources along the Galactic disk. Variants of this reference model can serve as basis for future studies of diffuse emission in and outside the Galactic disk.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonlinear burn control in ITER using adaptive allocation of actuators with uncertain dynamics

Abstract ITER will be the first tokamak to sustain a fusion-producing, or burning, plasma. If the plasma temperature were to inadvertently rise in this burning regime, the positive correlation between temperature and the fusion reaction rate would establish a destabilizing positive feedback loop. Careful regulation of the plasma’s temperature and density, or burn control, is required to prevent these potentially reactor-damaging thermal excursions, neutralize disturbances and improve performance. In this work, a Lyapunov-based burn controller is designed using a full zero-dimensional nonlinear model. An adaptive estimator manages destabilizing uncertainties in the plasma confinement properties and the particle recycling conditions (caused by plasma–wall interactions). The controller regulates the plasma density with requests for deuterium and tritium particle injections. In ITER-like plasmas, the fusion-born alpha particles will primarily heat the plasma electrons, resulting in different electron and ion temperatures in the core. By considering separate response models for the electron and ion energies, the proposed controller can independently regulate the electron and ion temperatures by requesting that different amounts of auxiliary power be delivered to the electrons and ions. These two commands for a specific control effort (electron and ion heating) are sent to an actuator allocation module that optimally maps them to the heating actuators available to ITER: an electron cyclotron heating system (20 MW), an ion cyclotron heating system (20 MW), and two neutral beam injectors (16.5 MW each). Two different actuator allocators are presented in this work. The first actuator allocator finds the optimal mapping by solving a convex quadratic program that includes actuator saturation and rate limits. It is nonadaptive and assumes that the mapping between the commanded control efforts and the allocated actuators (i.e. the effector model) contains no uncertainties. The second actuator allocation module has an adaptive estimator to handle uncertainties in the effector model. This uncertainty includes actuator efficiencies, the fractions of neutral beam heating that are deposited into the plasma electrons and ions, and the tritium concentration of the fueling pellets. Furthermore, the adaptive allocator considers actuator dynamics (actuation lag) that contain uncertainty. This adaptive allocation algorithm is more computationally efficient than the aforementioned nonadaptive allocator because it is computed using dynamic update laws so that finding the solution to a static optimization problem is not required at every time step. A simulation study assesses the performance of the proposed adaptive burn controller augmented with each of the actuator allocation modules.

Physics↗

Integrated control of individual plasma scalars with simultaneous neoclassical tearing-mode suppression

A novel integrated-control architecture has been tested in nonlinear, one-dimensional simulations using the control-oriented transport simulator (COTSIM©) and in DIII-D experiments. Integrated architectures that can perform continuous-mission control while also handling off-normal events will be vital in future reactor-grade tokamaks. Continuous-mission controllers for individual magnetic and kinetic scalars (thermal stored-energy (W), volume-average toroidal rotation (Ω Φ ), and safety factor profile (q) at different spatial locations) have been integrated in this work with event-triggered neoclassical tearing-mode (NTM) suppression controllers by combining them into an architecture augmented by a supervisory and exception handling (S&EH) system and an actuator management (AM) system. Here, the AM system, which enables the integration of competing controllers, solves in real time a nonlinear optimization problem that takes into account the high-level control priorities dictated by the S&EH system. The resulting architecture offers a high level of integration and some of the functionalities that will be required to fulfill the advanced-control requirements anticipated for ITER. Initial simulations using COTSIM suggest that the plasma performance and its MHD stability may be improved under integrated feedback control. In addition, the integrated-control architecture has been implemented in the DIII-D plasma control system and tested experimentally for the first time ever in DIII-D in a high-q min scenario, which is a candidate for steady-state operation in ITER.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Open-Source Frequency-Domain Model for Floating Wind Turbine Design Optimization

A new frequency-domain dynamics model has been developed that uses open-source components to efficiently represent a complete floating wind turbine system. The model, called RAFT (Response Amplitudes of Floating Turbines), incorporates quasi-static mooring reactions, strip-theory and potential-flow hydrodynamics, blade-element-momentum aerodynamics, and linear turbine control. The formulation is compatible with a wide variety of support structure configurations and no manual or time-domain preprocessing steps are required, making RAFT very practical in design and optimization workflows. The model is applied to three reference floating wind turbine designs and its predictions are compared with results from time-domain OpenFAST simulations. There is good agreement in mean offsets as well the statistics and spectra of the dynamic response, verifying RAFT’s general suitability for floating wind analysis. Follow-on work will include verification of potential-flow and turbine-control features and application to optimization problems.

17 WIND ENERGY↗

Classical versus quantum models in machine learning: insights from a finance application

Although several models have been proposed towards assisting machine learning (ML) tasks with quantum computers, a direct comparison of the expressive power and efficiency of classical versus quantum models for datasets originating from real-world applications is one of the key milestones towards a quantum ready era. Here, we take a first step towards addressing this challenge by performing a comparison of the widely used classical ML models known as restricted Boltzmann machines (RBMs), against a recently proposed quantum model, now known as quantum circuit Born machines (QCBMs). Both models address the same hard tasks in unsupervised generative modeling, with QCBMs exploiting the probabilistic nature of quantum mechanics and a candidate for near-term quantum computers, as experimentally demonstrated in three different quantum hardware architectures to date. To address the question of the performance of the quantum model on real-world classical data sets, we construct scenarios from a probabilistic version out of the well-known portfolio optimization problem in finance, by using time-series pricing data from asset subsets of the S&P500 stock market index. It is remarkable to find that, under the same number of resources in terms of parameters for both classical and quantum models, the quantum models seem to have superior performance on typical instances when compared with the canonical training of the RBMs. Our simulations are grounded on a hardware efficient realization of the QCBMs on ion-trap quantum computers, by using their native gate sets, and therefore readily implementable in near-term quantum devices.

97 MATHEMATICS AND COMPUTING↗