SEARCH · Search NASA

Results for “Constraining”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2022

Constrained Reference Star Differential Imaging: Enabling High-fidelity Imagery of Highly Structured Circumstellar Disks

High-contrast imaging presents us with the opportunity to study circumstellar disks and the planets still embedded within them, providing key insights into the formation and evolution of planetary systems. However, the postprocessing techniques that are often needed to suppress stellar halo light typically result in significant and variable loss of circumstellar light, even when using relatively conservative approaches like reference star differential imaging (RDI). We introduce “constrained reference star differential imaging” (constrained RDI), a new class of RDI point-spread-function (PSF) subtraction techniques for systems with circumstellar disks. Constrained RDI utilizes either high-resolution polarized-intensity (PI) images or disk models to severely limit or even eliminate the signal loss due to oversubtraction that is common to RDI. We demonstrate the ability of constrained RDI utilizing polarimetric data to yield an oversubtraction-free detection of the AB Aurigae protoplanetary disk in total intensity. PI-constrained RDI allows us to decisively recover the spectral signature of the confirmed, recently discovered protoplanet, AB Aurigae b. We further demonstrate that constrained RDI can be a powerful analysis tool for soon-to-be-acquired James Webb Space Telescope coronagraphic imaging of disks. In both cases, constrained RDI provides analysis-ready products that enable more detailed studies of disks and more robust verification of embedded exoplanets.

Kellen Lawson↗

DOE OSTI2021

Probing the Capability of Future Direct-imaging Missions to Spectrally Constrain the Frequency of Earth-like Planets

A critical question in astrobiology is whether exo-Earth candidates (EECs) are Earth-like, in that they originate life that progressively oxygenates their atmospheres similarly to Earth. We propose answering this question statistically by searching for O{sub 2} and O{sub 3} on EECs with missions such as HabEx or LUVOIR. We explore the ability of these missions to constrain the fraction, f {sub E}, of EECs that are Earth-like in the event of a null detection of O{sub 2} or O{sub 3} on all observed EECs. We use the Planetary Spectrum Generator to simulate observations of EECs with O{sub 2} and O{sub 3} levels based on Earth’s history. We consider four instrument designs—LUVOIR-A (15 m), LUVOIR-B (8 m), HabEx with a starshade (4 m, “HabEx/SS”), and HabEx without a starshade (4 m, “HabEx/no-SS”)—as well as three estimates of the occurrence rate of EECs (η {sub earth}): 24%, 5%, and 0.5%. In the case of a null detection, we find that for η {sub earth} = 24%, LUVOIR-A, LUVOIR-B, and HabEx/SS would constrain f {sub E} to ≤0.094, ≤0.18, and ≤0.56, respectively. This also indicates that if f {sub E} is greater than these upper limits, we are likely to detect O{sub 3} on at least one EEC. Conversely, we find that HabEx/no-SS cannot constrain f {sub E}, due to the lack of a coronagraph ultraviolet channel. For η {sub earth} = 5%, only LUVOIR-A and LUVOIR-B would be able to constrain f {sub E}, to ≤0.45 and ≤0.85, respectively. For η {sub earth} = 0.5%, none of the missions would allow us to constrain f {sub E}, due to the low number of detectable EECs. We conclude that the ability to constrain f {sub E} is more robust to uncertainties in η {sub earth} for missions with larger aperture mirrors. However, all missions are susceptible to an inconclusive null detection if η {sub earth} is sufficiently low.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2025

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

DOE OSTI2025

Constraining primordial non-Gaussianity from the large scale structure two-point and three-point correlation functions

Surveys of cosmological large-scale structure (LSS) are sensitive to the presence of local primordial non-Gaussianity (PNG), and may be used to constrain models of inflation. Local PNG, characterized by f NL ⁠, the amplitude of the quadratic correction to the potential of a Gaussian random field, is traditionally measured from LSS two-point and three-point clustering via the power spectrum and bi-spectrum. We propose a framework to measure f NL using the configuration space two-point correlation function (2pcf) monopole and three-point correlation function (3pcf) monopole of survey tracers. Our model estimates the effect of the scale-dependent bias induced by the presence of PNG on the 2pcf and 3pcf from the clustering of simulated dark matter haloes. We describe how this effect may be scaled to an arbitrary tracer of the cosmological matter density. The 2pcf and 3pcf of this tracer are measured to constrain the value of f NL ⁠. In LSS surveys, the effect of imaging systematics on two-point statistics is often degenerate with the PNG signal. Our proposed model employs three-point statistics primarily to break this degeneracy. Using simulations of luminous red galaxies observed by the Dark Energy Spectroscopic Instrument (DESI), we demonstrate the accuracy and constraining power of our method. Our forecast indicates the ability to constrain f NL to a precision of σf NL ≈ 22 with one year of DESI survey data, as well as the ability to constrain the imaging systematic weights in situ.

early Universe↗

NASA NTRS2012

Current-State Constrained Filter Bank for Wald Testing of Spacecraft Conjunctions

We propose a filter bank consisting of an ordinary current-state extended Kalman filter, and two similar but constrained filters: one is constrained by a null hypothesis that the miss distance between two conjuncting spacecraft is inside their combined hard body radius at the predicted time of closest approach, and one is constrained by an alternative complementary hypothesis. The unconstrained filter is the basis of an initial screening for close approaches of interest. Once the initial screening detects a possibly risky conjunction, the unconstrained filter also governs measurement editing for all three filters, and predicts the time of closest approach. The constrained filters operate only when conjunctions of interest occur. The computed likelihoods of the innovations of the two constrained filters form a ratio for a Wald sequential probability ratio test. The Wald test guides risk mitigation maneuver decisions based on explicit false alarm and missed detection criteria. Since only current-state Kalman filtering is required to compute the innovations for the likelihood ratio, the present approach does not require the mapping of probability density forward to the time of closest approach. Instead, the hard-body constraint manifold is mapped to the filter update time by applying a sigma-point transformation to a projection function. Although many projectors are available, we choose one based on Lambert-style differential correction of the current-state velocity. We have tested our method using a scenario based on the Magnetospheric Multi-Scale mission, scheduled for launch in late 2014. This mission involves formation flight in highly elliptical orbits of four spinning spacecraft equipped with antennas extending 120 meters tip-to-tip. Eccentricities range from 0.82 to 0.91, and close approaches generally occur in the vicinity of perigee, where rapid changes in geometry may occur. Testing the method using two 12,000-case Monte Carlo simulations, we found the method achieved a missed detection rate of 0.1%, and a false alarm rate of 2%.

Carpenter, J. Russell↗

DOE OSTI2023

Constraining neutrino oscillation and interaction parameters with the NOvA Near Detector and Far Detector data using Markov Chain Monte Carlo

This thesis reports a constraint of the neutrino oscillation parameters $\Delta m^{2}_{32}$, $\sin^2 \theta_{23}$, and $\delta_{CP}$ using the NuMI Off-Axis $\nu$ Appearance (NOvA) experiment's Near Detector (ND) data and Far Detector (FD) fake data set simultaneously. This thesis also reports a constraint on NOvA's systematic uncertainty model solely with its Near Detector data. The Hamiltonian Monte Carlo algorithm is used to estimate Bayesian Credible Intervals for the oscillation and interaction parameters. The $1\sigma$ Credible Intervals for $\sin^2 \theta_{23}$ are $(0.44, 0.512)$ $\cup$ $(0.536, 0.56)$, for $\Delta m^{2}_{32}$ $(2.41 \times 10^{-3}$ eV$^2,\ 2.52 \times 10^{-3}$ eV$^2)$, and for $\delta_{CP}$ $(0.74\pi,\ 1.1\pi)$ $\cup$ $(1.38\pi,\ 1.58\pi)$. The statistical power of the ND data constrains NOvA's interaction parameters, while the FD fake data constrains the oscillation parameters. This is the first analysis within NOvA to constrain the ND and FD prediction sim ultaneously, and to investigate the neutrino interaction modeling in the context of constraining the oscillation parameters. To constrain the ND data requires a sophisticated understanding of the neutrino interaction modeling and its uncertainties. The interested reader is advised to focus on Chapters 4 and 6, which discuss the ND selection, uncertainties, and ND-only fits to data. The reader interested in oscillation parameter constraints will find this in Chapter 7.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

DOE OSTI2020

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

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↗

DOE OSTI2020

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs

A lower bound for a finite-scenario-based chance-constrained program is the quantile value corresponding to the sorted optimal objective values of scenario subproblems. This quantile bound can be improved by grouping subsets of scenarios at the expense of solving larger subproblems. The quality of the bound depends on how the scenarios are grouped. In this paper, we formulate a mixed-integer bilevel program that optimally groups scenarios to tighten the quantile bounds. For general chance-constrained programs, we propose a branch-and-cut algorithm to optimize the bilevel program, and for chance-constrained linear programs, a mixed-integer linear-programming reformulation is derived. Here, we also propose several heuristics for grouping similar or dissimilar scenarios. Our computational results demonstrate that optimal grouping bounds are much tighter than heuristic bounds, resulting in smaller root-node gaps and better performance of scenario decomposition for solving chance-constrained 0-1 programs. Also, the optimal grouping bounds can be greatly strengthened using larger group size.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Physics-constrained Gaussian process model for prediction of hydrodynamic interactions between wave energy converters in an array

To improve the efficiency of wave farms and achieve maximum power generation, the layout of wave energy converters (WECs) in an array needs to be carefully designed so that the hydrodynamic interactions can be positively exploited. For this, the hydrodynamic characteristics of the WEC array in different layouts need to be calculated. However, such calculations using numerical models usually entail significant computational cost, especially for large arrays of WECs. To address the computational challenge, a physics-constrained Gaussian process (GP) model is proposed to replace the original expensive numerical model and predict the hydrodynamic characteristics of the WECs for any array layout. By exploring the relationship between the WEC array (i.e., the input) and different hydrodynamic characteristics (i.e., the output), here we summarize a set of physical constraints/features, including invariance, symmetry, and additivity. This prior knowledge about the input-output relationship is then directly embedded in the constructed GP model through the design of physics-constrained kernels. In particular, a double-sum invariant kernel is first developed to incorporate the invariance and symmetry features, and then an additive kernel is developed to incorporate the additive feature of the problem. The invariant kernel and the additive kernel are then integrated to construct the physics-constrained GP model. Compared to the standard GP model, the proposed physics-constrained GP models require less training data to achieve the desired accuracy in predicting the hydrodynamic characteristics and are also less vulnerable to the curse of dimensionality (i.e., good scalability for large arrays) due to the use of an additive kernel. The efficiency, accuracy, and scalability of the proposed approach are demonstrated through an application to predict the hydrodynamic characteristics for WEC arrays of different sizes and layouts.

16 TIDAL AND WAVE POWER↗

DOE OSTI2024

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Constrained non-negative matrix factorization enabling real-time insights of in situ and high-throughput experiments

Non-negative matrix factorization (NMF) is an appealing class of methods for performing unsupervised learning on streaming spectral data, particularly in time-sensitive applications such as in situ characterization of materials. These methods seek to decompose a dataset into a small number of components and weights that can compactly represent the underlying signal while effectively reconstructing the observations with minimal error. However, canonical NMF methods have no underlying requirement that the reconstruction uses components or weights that are representative of the true physical processes. In this work, we demonstrate how constraining a subset of the NMF weights or components as rigid priors, provided as known or assumed values, can provide significant improvement in revealing true underlying phenomena. We present a PyTorch-based method for efficiently applying constrained NMF and demonstrate its application to several synthetic examples. Our implementation allows an expert researcher-in-the-loop to provide and dynamically adjust the constraints during a live experiment involving streaming spectral data. Such interactive priors allow researchers to specify known or identified independent components, as well as functional expectations about the mixing or transitions between the components. We further demonstrate the application of this method to measured synchrotron x-ray total scattering data from in situ beamline experiments. In such a context, constrained NMF can result in a more interpretive and scientifically relevant decomposition than canonical NMF or other decomposition techniques. As a result, the details of the method are provided, along with general guidance for employing constrained NMF in the extraction of critical information and insights during time-sensitive experimental applications.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Quantum-inspired weight-constrained neural network: Reducing variable numbers by 100× compared to standard neural networks

Although quantum machine learning has shown great promise, the practical application of quantum computers remains constrained in the noisy intermediate-scale quantum era. To take advantage of quantum machine learning, we investigate the underlying mathematical principles of these quantum models and find that the quantum neural network with amplitude encoding is equivalent to a weight-constrained neural network. Motivated by this discovery, we develop a classical weight-constrained neural network. We find that this approach can reduce the number of variables in a classical neural network by a factor of 135 while preserving its accuracy. In addition, we develop a dropout method to enhance the robustness of quantum machine learning models, which are highly susceptible to adversarial attacks. This technique can also be applied to improve the adversarial robustness of the classical weight-constrained neural network, which is essential for industry applications, such as self-driving vehicles. Our work offers an approach to reduce the complexity of large classical neural networks, addressing a critical challenge in machine learning.

quantum algorithms & computation↗

DOE OSTI2024

Electric Vehicles Charging Time Constrained Deliverable Provision of Secondary Frequency Regulation

Aggregation of electric vehicles (EVs) is a promising technique for providing secondary frequency regulation (SFR) in highly renewable energy-penetrated power systems. Equipped with energy storage devices, EV aggregation can provide reliable SFR. However, the main challenge is to guarantee reliable intra-interval SFR capacities and inter-interval delivery following the automatic generation control (AGC) signal. Furthermore, aggregated EV SFR provision will be further complicated by the EV charging time anxiety because SFR provision might extend EV's charging time. This paper proposes a deliverable EV SFR provision with a charging-time-constrained control strategy. First, a charging-time-constrained EV aggregation is proposed to address the uncertainty of EV capacity based on the state-space model considering the charging-time restriction of EV owners. Second, a real-time economic dispatch and time domain simulation (RTED-TDS) cosimulation framework is proposed to verify financial results and the dynamic performance of the EV SFR provision. Last, the proposed charging time-constrained EV aggregation is validated on the IEEE 39-bus system. In conclusion, the results demonstrate that with charging time-constrained EV aggregation, the dynamic performance of the system can be improved with a marginal increase in total cost. More importantly, the charging time constraint can be respected in the proposed SFR provision of the EV aggregation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1989

The divergence characteristics of constrained-sheath optics systems for use with 5-eV atomic oxygen sources

The potential usefulness of the constrained sheath optics concept as a means of controlling the divergence of low energy, high current density ion beams is examined numerically and experimentally. Numerical results demonstrate that some control of the divergence of typical ion beamlets can be achieved at perveance levels of interest by contouring the surface of the constrained sheath properly. Experimental results demonstrate that a sheath can be constrained by a wire mesh attached to the screen plate of the ion optics system. The numerically predicted beamlet divergence characteristics are shown to depart from those measured experimentally, and additional numerical analysis is used to demonstrate that this departure is probably due to distortions of the sheath caused by the fact that it attempts to conform to the individual wires that make up the sheath constraining mesh. The concept is considered potentially useful in controlling the divergence of ion beamlets in applications where low divergence, low energy, high current density beamlets are being sought, but more work is required to demonstrate this for net beam ion energies as low as 5 eV.

Anderson, John R.↗

NASA NTRS2000

Problem Definition and Solution Concept for En Route Constrained Airspace Problems

NASA's AATT Program is investigating potential ground-based decision support tool (DST) development for en route controllers and managers. NASA's previous work in en route DST development has focused on Transition airspace, where aircraft are impacted by constraints associated with the transition of aircraft from en route to terminal airspace. This paper investigates the problems associated with aircraft in non-transitional en route airspace, termed Constrained Airspace. A literature search was performed to catalog previously identified constrained airspace problems. The results of this search were investigated with industry representatives to validate these problems were significant in constrained airspace. Three general problem areas were identified. The first problem area involves negative impacts caused by a loss of airspace (e.g., activation of Special Use Airspace (SUA), weather cell formation, and overloaded sectors). The second problem area is the lack of identifying and taking advantage of gained airspace (e.g., SUA deactivation, weather dissipation, and sector loading reductions). The third problem area is unforeseen negative impacts caused by the acceptance of user routing requests (e.g., a route change into an area of congestion that negated the users intended benefit). Based upon the problems identified, an operational concept was developed for a DST to help handle these problems efficiently. The goal is to strategically identify constrained airspace problems and to provide functionality to support ARTCC TMUs in resolving the identified impacts. The capability lends itself well to TMU and Airline Operations Center (AOC) collaboration.

Green, Steven↗

DOE OSTI2025

Uncertainty propagation and sensitivity analysis for constrained optimization of nuclear waste vitrification

Abstract The vitrification of high‐level waste (HLW) by heating a mixture of glass‐forming chemicals (GFCs) with the waste can be improved using a constrained optimization problem. This study explores how different uncertainty propagation (UP) methods implemented with the optimization process can affect the glass formulation of nuclear waste glasses. UP is the effort of propagating uncertain inputs through a system to understand and quantify output distributions. Uncertainty intervals are crafted from output distributions to inform the optimization algorithm. UP is often implemented with Monte Carlo (MC) sampling for large nonlinear systems, which can be difficult to implement within a constrained optimization algorithm that requires derivative information. Other UP methods often used for optimization under uncertainty (OUU) can be designed to work within an established constrained optimization framework. Methods of UP are evaluated in this study including iterative sampling approaches, first‐order approximations, and surrogate modeling with machine learning (ML). A method of dimensional reduction based on global sensitivity analysis is introduced to support the UP methods for the large dimensionality of the problem. Analytical UP methods able to achieve similar optimums 10 times faster than the baseline MC approach, and produce 93.9% similar output distributions are reported.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗