Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization Under Uncertainty”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

ARC-DPA 1-MeV Neutron Fluence Equivalence Model for GaAs

Here, the legacy data used in the production of the American Society for Testing and Materials (ASTM) E722 standard for gallium arsenide (GaAs) were fit with the athermal recombination corrected-displacements per atom (ARC-DPA) model for the development of a novel 1-MeV neutron equivalent fluence metric. Improving on previous work, the coefficients for the ARC-DPA model were optimized using a conjugate gradient method, and the uncertainties in the observed damage in different benchmark neutron fields were sampled to quantify their contribution to the damage metric. The optimized parameters of −0.474 ± 0.03 for b arcdpa and 0.016 ± 0.002 for c arcdpa provided good agreement and indicated that the solution is not sensitive to the corresponding fluence uncertainties. Compared to the current 1-MeV neutron fluence equivalence standard for displacement damage in GaAs, our results indicate that for a thermal reactor neutron environment, displacement damage has been underestimated by around 25% and that the saturation value for the damage efficiency had been higher than previously modeled.

1-MeV equivalent fluence↗
DOE OSTI2025

Multistage economic MPC for systems with a cyclic steady state: A gas network case study

Multistage model predictive control (MPC) provides a robust control strategy for dynamic systems with uncertainties and a setpoint tracking objective. Moreover, extending MPC to minimize an economic cost instead of tracking a pre-calculated optimal setpoint improves controller performance. This paper presents a novel multistage economic nonlinear model predictive control (E-NMPC) framework for dynamic systems operating under uncertainty, with specific application to natural gas transmission networks. A key innovation lies in the integration of cyclic steady-state (CSS) constraints within the multistage MPC formulation, enabling the controller to manage periodic operating conditions commonly observed in energy systems. A Lyapunov-based descent condition is enforced to ensure robust stability of the controller. The multistage economic MPC framework is validated on two gas pipeline case studies, where it successfully minimizes net energy consumption, respects operational constraints under uncertain demand profiles, and guides the network to optimal cyclic operation. The Lyapunov function remains bounded in both case studies, validating the robust stability of multistage E-NMPC.

03 NATURAL GAS↗
DOE OSTI2026

Uncertainty quantification for inverse problems with application to ptychographic reconstruction

Inverse problems in imaging are commonly solved by optimization or learned surrogates that return a single reconstruction, while uncertainty information is often unavailable. In many experimental settings, however, uncertainty is required to assess reliability, guide downstream analysis, and prioritize additional measurements. In this note, we present a compact uncertainty-quantification framework based on local objective curvature, and then specialize it to ptychographic reconstruction. We further show how repeated reconstructions can be aggregated in a statistically principled way, including a practical implementation path for PtychoNN.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗
DOE OSTI2023

Pragmatic Uncertainty Quantification and Propagation in Inverse Estimation of Structural Dynamics Parameters given Material Property Uncertainties and Limited Sensor Data

In this report we demonstrate some relatively simple and inexpensive methods to effectively account for various sources of epistemic lack-of-knowledge type uncertainty in inverse problems. The demonstration problem involves inverse estimation of six parameters of a bolted joint that attaches a kettlebell shaped object to a thick plate. The parameters are efficiently inverted in a modal-based model calibration using gradient-based optimization. Two material properties of the kettlebell are treated as uncertain to within given epistemic uncertainty bounds. We apply and test interval and sparse-sample probabilistic approaches to account for uncertainty in the estimated parameters (and various scalar functionals of the parameters as generic quantities of interest, QOIs) due to uncertainties in the material properties. We also investigate the error effects of limited numbers of vibration sensors (accelerometers) on the kettlebell and plate, and therefore abbreviated excitation/response information in the parameter inversions. We propose and demonstrate a Leave-K-Sensors-Out “cross-prediction” UQ approach to estimate related uncertainties on the parameters and QOI functionals. We indicate how uncertainties from material properties and limited sensors are treated in a combined manner. The economical combined UQ approach involves just three to five samples (i.e. three to five inverse simulations), with no added complication or error/uncertainty from use of surrogate models for affordability. Finally, we describe a related economical UQ approach for handling potential parameter solution non-uniqueness and numerical optimization related precision uncertainties in the estimated parameter values. Indicated further research is identified.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Optimization Through Multi-Fidelity Modeling

We present a novel method for optimizing parameter selection for simulations with an evaluation budget. We start with an existing method for building a multi-fidelity model out of many low-fidelity simulations and few high-fidelity simulations. We propose a novel method to simplify parameter selection without sacrificing performance. We verify these results and compare with existing literature. Next, we propose a novel algorithm which uses this difference model to suggest new points in the parameter design space to simulate. We add each point we simulate to the model to improve its quality for the next iteration. The algorithm trades off reducing the uncertainty of the existing model with optimization of the objective. The first is more useful when a large fraction of the computation budget remains. The second is more useful when a small fraction of the computation budget remains. Our method converges to the optimum by using a high-fidelity evaluation for just 16 of the 427 points. Our method is general enough to work if there is no low-fidelity model. Furthermore, it is agnostic to the underlying physics of the problem. Therefore, both the low-fidelity and high-fidelity models can be generated by any arbitrary function, including simulations and physical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Measurement of the muon neutrino charged-current mesonless cross section in the NOvA near detector

NOvA is a long-baseline accelerator neutrino experiment at Fermilab. Its physics goals include precision neutrino oscillation measurements, neutrino interaction cross-section measurements and beyond Standard Model explorations. We present a measurement of muon neutrino charged-current cross section with zero mesons in the final state at the NOvA near detector. This measurement is performed as a function of the kinematics of the final state muon. Our chosen interaction channel is especially sensitive to quasielastic and meson exchange current interactions and it provides handles for constraining the cross section systematic uncertainties in oscillation analyses in present and future experiments. For particle identification, we use a convolutional neural network (CNN) trained on individual particles simulated in the NOvA Near detector. This allows us to select the desired signal while reducing the potential bias from neutrino interaction modeling. We study strategies for constraining the remaining charged-pion background via Michel electron information in a template fitting approach. The main experimental result is a two-dimensional differential cross section as a function of final-state muon kinetic energy and polar angle. The parameters of this measurement, including binning and unfolding, were optimized to reduce the expected systematic uncertainty in the total cross section. The final result shows good agreement with the main GENIE-based simulation framework that was independently fine-tuned in NOvA. We finally propose improvements and subsequent steps that build on this analysis and further dissect the final states of neutrino interactions. This work has been supported by US DOE grant DE-SC0015684.

Sánchez Falero, Sebastián Jesús [Iowa State U.]↗
DOE OSTI2023

GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis

Integrating renewable resources within the transmission grid at a wide scale poses significant challenges for economic dispatch as it requires analysis with more optimization parameters, constraints, and sources of uncertainty. This motivates the investigation of more efficient computational methods, especially those for solving the underlying linear systems, which typically take more than half of the overall computation time. In this paper, we present our work on sparse linear solvers that take advantage of hardware accelerators, such as graphical processing units (GPUs), and improve the overall performance when used within economic dispatch computations. We treat the problems as sparse, which allows for faster execution but also makes the implementation of numerical methods more challenging. We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements when using high-performance linear solvers within alternating current optimal power flow (ACOPF) analysis. Furthermore, we demonstrate the feasibility of getting significant performance improvements by executing the entire computation on GPU-based hardware. Finally, we identify outstanding research issues and opportunities for even better utilization of heterogeneous systems, including those equipped with GPUs.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Sizing battery energy storage and PV system in an extreme fast charging station considering uncertainties and battery degradation

In this paper, we present mixed integer linear programming (MILP) formulations to obtain optimal sizing for a battery energy storage system (BESS) and solar generation system in an extreme fast charging station (XFCS) to reduce the annualized total cost. The proposed model characterizes a typical year with eight representative scenarios and obtains the optimal energy management for the station and BESS operation to exploit the energy arbitrage for each scenario. Contrasting extant literature, this paper proposes a constant power constant voltage (CPCV) based improved probabilistic approach to model the XFCS charging demand for weekdays and weekends. This paper also accounts for the monthly and annual demand charges based on realistic utility tariffs. Furthermore, BESS life degradation is considered in the model to ensure no replacement is needed during the considered planning horizon. Different from the literature, this paper offers pragmatic MILP formulations to tally BESS charge/discharge cycles using the cumulative charge/discharge energy concept. McCormick relaxations and the Big-M method are utilized to relax the bi-linear terms in the BESS operational constraints. Finally, a robust optimization-based MILP model is proposed and leveraged to account for uncertainties in electricity price, solar generation, and XFCS demand. Case studies were performed to signify the efficacy of the proposed formulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

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

Uncertainties Induced by Processing Parameter Variation in Selective Laser Melting of Ti6Al4V Revealed by In-Situ X-ray Imaging

Selective laser melting (SLM) additive manufacturing (AM) exhibits uncertainties, where variations in build quality are present despite utilizing the same optimized processing parameters. In this work, we identify the sources of uncertainty in SLM process by in-situ characterization of SLM dynamics induced by small variations in processing parameters. We show that variations in the laser beam size, laser power, laser scan speed, and powder layer thickness result in significant variations in the depression zone, melt pool, and spatter behavior. On average, a small deviation of only ~5% from the optimized/reference laser processing parameter resulted in a ~10% or greater change in the depression zone and melt pool geometries. For spatter dynamics, small variation (10 μm, 11%) of the laser beam size could lead to over 40% change in the overall volume of the spatter generated. The responses of the SLM dynamics to small variations of processing parameters revealed in this work are useful for understanding the process uncertainties in the SLM process.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Genetic algorithm optimization of nuclear criticality experiment for reduction of intermediate-energy 239 Pu nuclear data uncertainties

Nuclear criticality experiments are conducted to investigate specific nuclear data important for safe handling and storage of fissile materials, reactor design and operation, and the validation of radiation transport codes. Incorrect or uncertain nuclear data can prohibitively impact operational safety limits, reactor licensing, and predictive simulation capability; therefore, integral measurements from criticality experiments are necessary and should be performed frequently. To maximize the impact of the integral measurements, it is important to consider experiment geometry, material selection, and component dimensions. When taking these considerations into account, the experiment design process becomes iterative and very time intensive. This work utilizes a genetic algorithm to efficiently explore potential nuclear criticality experiment designs for the Laboratory Directed Research & Development project PARADIGM (PARallel Approach of Differential and InteGral Measurements) at Los Alamos National Laboratory. In this paper, the building blocks of the genetic algorithm are discussed in detail, the genetic algorithm methodology is verified, and the genetic algorithm is used to produce three candidate experiment models for the final PARADIGM design. The three candidate models produced by the genetic algorithm consist of copper-reflected assemblies containing 14 repeating units of alumina, graphite, boron, and plutonium plates. Furthermore, in addition to the optimization results, final design considerations are also discussed for designs with a height and/or weight very close to or slightly above assembly machine operational limits.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗
DOE OSTI2023

An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints

The primary goal of this paper is to provide an efficient solution algorithm based on the augmented Lagrangian framework for optimization problems with a stochastic objective function and deterministic constraints. Our main contribution is combining the augmented Lagrangian framework with adaptive sampling, resulting in an efficient optimization methodology validated with practical examples. To achieve the presented efficiency, here we consider inexact solutions for the augmented Lagrangian subproblems, and through an adaptive sampling mechanism, we control the variance in the gradient estimates. Furthermore, we analyze the theoretical performance of the proposed scheme by showing equivalence to a gradient descent algorithm on a Moreau envelope function, and we prove sublinear convergence for convex objectives and linear convergence for strongly convex objectives with affine equality constraints. The worst-case sample complexity of the resulting algorithm, for an arbitrary choice of penalty parameter in the augmented Lagrangian function, is $\mathscr{O}$(ϵ -3-δ ) , where ϵ > 0 is the expected error of the solution and δ > 0 is a user-defined parameter. If the penalty parameter is chosen to be $\mathscr{O}$(ϵ -1 ), we demonstrate that the result can be improved to $\mathscr{O}$(ϵ -2 ) , which is competitive with the other methods employed in the literature. Moreover, if the objective function is strongly convex with affine equality constraints, we obtain $\mathscr{O}$(ϵ -1 log(1/ϵ)) complexity. Finally, we empirically verify the performance of our adaptive sampling augmented Lagrangian framework in machine learning optimization and engineering design problems, including topology optimization of a heat sink with environmental uncertainty.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Trust-Region Approximation of Extreme Trajectories in Power System Dynamics

In this work we present a novel technique, based on a trust-region optimization algorithm and second-order trajectory sensitivities, to compute the extreme trajectories of power system dynamic simulations given a bounded set that represents parametric uncertainty. Furthermore, we show how this method, while remaining computationally efficient compared with sampling-based techniques, overcomes the limitations of previous sensitivity-based techniques to approximate the bounds of the trajectories when the local approximation loses validity because of the nonlinearity. We present several numerical experiments that showcase the accuracy and scalability of the technique, including a demonstration on the IEEE New England test system.

42 ENGINEERING↗
DOE OSTI2022

Robust Optimization for the Day-Ahead Scheduling of Cascaded Hydroelectric Systems

Uncertain electricity prices resulting from the re-structuring of electricity market have brought new opportu-nities and challenges for hydroelectric producers. This paper presents a data-driven robust optimization approach for the day-ahead scheduling of cascaded hydroelectric systems (CHS) with electricity price uncertainty. In this paper, a minimum volume enclosing ellipsoid (MVEE) is adopted to construct an ellipsoidal uncertainty set that fully identifies and exploits the historical characteristics data. Here, a second-order conic optimization formulation of the robust counterpart is derived for efficient computation. A real-world case study is conducted to demonstrate the capability of the proposed optimization approach compared with the traditional robust optimization approach.

13 HYDRO ENERGY↗
DOE OSTI2021

Distribution System State Estimation With High Penetration of Demand Response Enabled Loads

Demand-side operations incentivize utility customers to take part in various grid services. A demand response enabled load (DREL) is a flexible grid asset that schedules electricity consumption in response to a time-of-use (TOU) energy price. Consequently, its energy profile differs from that of a conventional load that is insensitive to price. This difference may cause new challenges for distribution system state estimation (DSSE). It is well known that DSSE often needs to use pseudo-measurements based on historic load profiles to increase system observability. However, historic profiles of conventional loads are not representative of DREL behaviors. Additionally, the inaccuracy impacts DSSE results and other DSSE-dependent operations. In this paper, we propose an online pseudo-measurement generation approach for DSSE with DRELs. We formulate an optimization model to represent DRELs self-adjusting actions. Sampling-based stochastic optimization techniques are proposed to account for uncertainties in DRELs. A set of representative DREL behavior data corresponding to the samples are used to characterize DREL pseudo-measurements. Case studies with modified IEEE 123-bus test system verify the validity of the proposed work.

24 POWER TRANSMISSION AND DISTRIBUTION↗