Search NASASearch

SEARCH · Search NASA

Results for “constrained optimization”

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

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

At least 91 records · Page 5

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING

Incorporating civilian radioxenon background estimates in anomaly detection

A nuclear explosion screening exercise in 2023 (Maurer et al., 2023) found challenges with discerning anomalous radioxenon activity concentrations relative to elevated background concentrations. Research has continued into methods to detect anomalous radioxenon concentrations by comparing samples to estimates of atmospheric radioxenon background concentrations caused by releases at nuclear reactors or medical isotope production facilities. A new approach estimates the sample concentrations using time-varying radioxenon release rates obtained using optimization techniques that constrain the facility release rates to plausible amounts based on historical data or facility knowledge. The purpose of the optimization is to determine whether any combination of plausible release rates from emitting facilities can explain a series of radioxenon measurements at one or more sampling stations. A case study uses radioxenon data collected at three locations in western Europe for a month in 2021 and considers releases from 77 locations. Fewer samples are identified as being anomalous using a simplistic flagging rule than from an application of the current International Monitoring System (IMS) activity concentration-level rule.

Environmental sciences

A multi-objective optimization model for cropland design considering profit, biodiversity, and ecosystem services

More sustainable agricultural methods are needed to alleviate the decreases in biodiversity and ecosystem services that have occurred because of industrial agriculture. One such method is the inclusion of alternative crops into croplands that can support biodiversity, reduce erosion and chemical runoff, and sequester carbon in the soil. However, the question of where such crops should be planted to balance competing economic and environmental objectives remains open. To this end, we develop a mixed-integer quadratically constrained program to optimize the layout of a cropland considering economic, biodiversity, greenhouse gas emissions, and water quality objectives. We include spatially varying fertilization as a decision variable in addition to crop establishment location. We further include the effect of core area and edges between different crops on biodiversity. To demonstrate the applicability of the model, we apply it to an example field, showing how the optimal cropland design changes as a decision-maker prioritizes different objectives and as edges have different impacts on biodiversity.

54 ENVIRONMENTAL SCIENCES

Exploring the fusion power plant design space: comparative analysis of positive and negative triangularity tokamaks through optimization

The optimal configuration choice between positive triangularity (PT) and negative triangularity (NT) tokamaks for fusion power plants hinges on navigating different operational constraints rather than achieving specific plasma performance metrics. This study presents a systematic comparison using constrained multi-objective optimization with the integrated FUsion Synthesis Engine (FUSE) framework. Over 200 000 integrated design evaluations were performed exploring the trade-offs between capital cost minimization and operational reliability (maximizing q 95 ) while satisfying engineering constraints including 250 ± 50 MW net electric power, tritium breeding ratio > 1.1, power exhaust limits and an hour flattop time. Both configurations achieve similar cost-performance Pareto fronts through contrasting design philosophies. PT, while demonstrating resilience to pedestal degradation (compensating for up to 40% reduction), are constrained to larger machines (R 0 > 6.5 m) by the narrow operational window between L–H threshold requirements and the research-established power exhaust limit (P sol /R < 15 MW m –1 ). This forces optimization through comparatively reduced magnetic field (∼8 T). NT configurations exploit their freedom from these constraints to access compact, high-field designs (R 0 ~ 5.5 m, B 0 >12 T), creating natural synergy with advancing HTS technology. Sensitivity analyses reveal that PT’s economic viability depends critically on uncertainties in L–H threshold scaling and power handling limits. Notably, a 50% variation in either could eliminate viable designs or enable access to the compact design space. These results suggest configuration selection should be risk-informed: PT offers the lowest-cost path when operational constraints can be confidently predicted, while NT is robust to large variations in constraints and physics uncertainties.

FUSE framework

Multi-Factor-Coupled, Ahead-of-Time Aggregation of Power Flexibility Under Forecast Uncertainty

The increasing penetration of distributed energy resources (DERs) is significantly reshaping the role of distribution systems under active energy management. To aggregate the active-reactive power flexibility of DERs dispersed at the feeder and provide capacity support to the transmission system, it is essential to efficiently identify feasible substation power injection trajectories. This paper introduces a novel ahead-of-time flexibility characterization method to address it. First, a polyhedral non-feeder-level power flexibility region (PFR) is constructed, accounting for various time-dependent, power-coupled, and forecast error uncertainties. Then, a polyhedral feeder-level PFR is analytically derived through a coordinate transformation, which can reveal the uncertainty propagation path, i.e., how uncertainty applies to the feeder-level PFR. To facilitate the high-level application, a tractable chance-constrained Chebyshev centering optimization model is further developed to find a ball-shaped inner approximation of the feeder-level PFR. Finally, the proposed method is validated on a modified IEEE 123-bus test system. Here, both theoretical and experimental results show that, with appropriate robustness parameter settings, the proposed method can make the approximated PFR less conservative with abundant robustness against forecast error uncertainty.

24 POWER TRANSMISSION AND DISTRIBUTION

Dark Energy Survey Year 6 Results: MagLim++ Lens Sample Selection and Measurements of Galaxy Clustering

Galaxy clustering is a sensitive probe of the expansion history and growth of structure of the universe, and key degeneracies can be broken by combining these data with measurements of cosmic shear and galaxy-galaxy lensing (a so-called 3$\times$2pt analysis). The largest and least biased statistical samples of galaxies for use in clustering analyses can be collected photometrically through large imaging surveys. However, selecting clean photometric subsamples for cosmology are crucial for avoiding contamination that can bias cosmological constraints. Here we present the MagLim++ galaxy sample, selected to optimize for cosmological constraining power and incorporating an array of novel quality cuts to identify and remove residual contamination. This sample comes from the full six years of observations from the Dark Energy Survey. We present measurements of the two-point angular clustering ($w(θ)$) of 9,186,205 galaxies distributed over 4031 sq. degrees and in six tomographic redshift bins centered at $\bar{z}\approx$ [0.31, 0.44, 0.62, 0.78, 0.90, 1.01]. These measurements are used as part of the 3$\times$2pt and other DES Y6 legacy cosmological analyses in companion works. We describe the battery of null tests and mitigation schemes implemented to address observational, astrophysical, and methodological systematics in the analysis. The resulting $w(θ)$ measurements have a S/N = 149 (90.2 for linear scales only), which we use to place galaxy-clustering-only constraints on the matter density of the Universe, $Ω_m=0.311^{+0.023}_{-0.035}$, and amplitude of galaxy clustering in each redshift bin, $b_iσ_8=[1.16^{+0.04}_{-0.06},\ 1.40^{+0.04}_{-0.06},\ 1.57^{+0.04}_{-0.06},\ 1.59^{+0.04}_{-0.05},\ 1.50^{+0.04}_{-0.05},\ 1.74^{+0.06}_{-0.08}]$.

Weaverdyck, N. [BCCP, Berkeley; UC, Berkeley; LBL,

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY

HdsaLib

HdsaLib performs hyper-differential sensitivity analysis in optimization problems that are constrained by partial differential equation problems. The software aids researchers in understanding the impact of uncertainties on their optimization models. The tool has been applied for use in ice sheet modeling, fluid flow modeling, atmospheric tracer transport modeling, and subsurface flow modeling. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

van Bloemen Waanders, Bart [Sandia National Lab. (

Optimal Twirling Depth for Classical Shadows in the Presence of Noise

The classical shadows protocol is an efficient strategy for estimating properties of an unknown state p using a small number of state copies and measurements. In its original form, it involves twirling the state with unitaries from some ensemble and measuring the twirled state in a fixed basis. It was recently shown that for computing local properties, optimal sample complexity (copies of the state required) is remarkably achieved for unitaries drawn from shallow depth circuits composed of local entangling gates, as opposed to purely local (zero depth) or global twirling (infinite depth) ensembles. Here, we consider the sample complexity as a function of the depth of the circuit, in the presence of noise. We find that this noise has important implications for determining the optimal twirling ensemble. Under fairly general conditions, we (i) show that any single-site noise can be accounted for using a depolarizing noise channel with an appropriate damping parameter f, (ii) compute thresholds f th at which optimal twirling reduces to local twirling for Pauli operators, (iii) nth order Renyi entropies (n ≥2), and (iv) provide a meaningful upper bound t max on the optimal circuit depth for any finite noise strength f, which applies to observables and entanglement entropy measurements. In conclusion, these thresholds strongly constrain the search for optimal strategies to implement shadow tomography and are easily tailored to the experimental system at hand.

97 MATHEMATICS AND COMPUTING

Multi-objective optimization of PWR core design using NSGA-II in RAVEN’s optimization framework

Designing an PWR loading pattern is a combinatorial problem challenging to solve by brute force or traditional methods due to the sheer amount of possible combination, and constraints. Nature-inspired algorithms, such as the genetic algorithm, have demonstrated the potential to tackle this problem. The goal of this work was to improve and demonstrate the capabilities for constrained, multi-objective optimization (MOO) of loading patterns using NSGA-II in RAVEN’s optimization framework.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS

A generative machine learning model for designing metal hydrides applied to hydrogen storage

Developing new metal hydrides is a critical step toward efficient hydrogen storage in carbon-neutral energy systems. However, existing materials databases, such as the Materials Project, contain a limited number of well-characterized hydrides, which constrains the discovery of optimal candidates. This work presents a framework that integrates causal discovery with a lightweight generative machine learning model to generate novel metal hydride candidates that may not exist in current databases. Using a dataset of 450 samples (270 training, 90 validation, and 90 testing), the model generates 1000 candidates. After ranking and filtering, six previously unreported chemical formulas and crystal structures are identified, four of which are validated by density functional theory simulations and show strong potential for future experimental investigation. Overall, the proposed framework provides a scalable and time-efficient approach for expanding hydrogen storage datasets and accelerating materials discovery.

generative model

Constraining nuclear mass models using 𝑟-process observables with multiobjective optimization

Modeling nuclear masses, particularly for nuclei far from stability, remains a key objective in nuclear physics. One contemporary approach is machine learning (ML), which trains on experimental data, but can suffer large errors when extrapolating toward neutron-rich species. In nature, such masses shape observables for the rapid neutron capture process (𝑟 process), which in principle could inform ML models. Here, we introduce a multiobjective optimization approach using the Pareto front algorithm. We show that this technique, capable of identifying models that generate 𝑟-process abundances aligning with both solar and stellar data, is a promising method to select ML models with reliable extrapolation power.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

EvoDiffMol: evolutionary diffusion framework for 3D molecular design with optimized properties

Designing molecules with specific target properties remains a fundamental challenge in computational chemistry. While existing approaches show promise, most rely on simplified representations like SMILES strings or 2D graphs that lack essential three-dimensional geometric information. We present EvoDiffMol, a computational framework that integrates evolutionary algorithms with three-dimensional diffusion models for property-driven molecular generation. The method operates through adaptive evolutionary optimization, where population-based selection guides the generation process toward desired property landscapes. EvoDiffMol supports both unconstrained molecular design and scaffold-constrained generation that preserves fixed substructures while optimizing complementary regions. Comprehensive evaluation demonstrates exceptional performance, achieving the highest drug-likeness score (0.94) among all compared state-of-the-art methods while maintaining excellent validity, uniqueness, and novelty. Beyond single property optimization, the framework demonstrates flexible multi-property optimization capabilities, simultaneously controlling multiple molecular descriptors including synthetic accessibility, lipophilicity, topological polar surface area, and clinically relevant ADMET properties such as cardiotoxicity (hERG) and intestinal permeability (Caco-2). This adaptability spans from simple descriptors to practical pharmaceutical endpoints without requiring complete model retraining. The framework achieves precise control over target property values, generating molecules with properties closely matching specified targets for both single and multiple descriptors. Scaffold-constrained experiments preserve fixed molecular cores while maintaining effective property optimization. The three-dimensional representation offers advantages in maintaining structural validity during iterative optimization, with potential for geometry-aware applications in materials science and drug discovery.

3D molecular generation

A framework for discrete optimization of stellarator coils

Designing magnets for three-dimensional plasma confinement is a key task for advancing the stellarator as a fusion reactor concept. Stellarator magnets must produce an accurate field while leaving adequate room for other components and being reasonably simple to construct and assemble. In this paper, a framework for coil design and optimization is introduced that enables the attainment of sparse magnet solutions with arbitrary restrictions on where coils may be located. The solution space is formulated as a 'wireframe' consisting of a mesh of interconnected wire segments enclosing the plasma. Two methods are developed for optimizing the current distribution on a wireframe: Regularized Constrained Least Squares, which uses a linear least-squares approach to optimize the currents in each segment, and Greedy Stellarator Coil Optimization, a fully discrete procedure in which loops of current are added to the mesh one by one to achieve the desired magnetic field on the plasma boundary. Examples are presented of solutions obtainable with each method, some of which achieve high field accuracy while obeying spatial constraints that permit easy assembly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY

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

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization

Cost impact of hexose-to-pentose sugar ratios for biomanufacturing

Central to the long-term vision for biomanufacturing is the ability to deconstruct plant cell walls to sugars that microbes can convert to products. Aside from glucose, the most abundant sugar in biomass is xylose, a pentose sugar. Industrially relevant microbes have been engineered to co-ferment xylose and glucose. Most nth plant technoeconomic analyses (TEAs) assume similar consumption rates and product yields for both sugars, but in reality, xylose is consumed more slowly. Feedstocks can be selected, or engineered, to alter the glucan-to-xylan ratio (GXR) but no TEAs have quantified the impact of this strategy systematically. This study explores the cost impacts of varying the glucan-to-xylan ratio (GXR) from 1.9 to 6.7 for co-fermenting glucose and xylose to ethanol and bisabolene. The minimum selling prices (MSPs) for both products decrease as the GXR increases, with the largest reductions at shorter residence times. For instance, with an increase in GXR from 1.9 to 6.7, ethanol’s MSP drops by 16 %, 5 %, and 3 % at 24, 72, and 144 h, respectively, while bisabolene’s MSP declines by 23 %, 20 %, and 15 % at 24, 72, and 120 h. Particularly for early-stage commercialization, the results suggest that altering or selecting for feedstocks with higher GXR can minimize capital costs by reducing optimal residence times. Capital-constrained biorefineries operating with shorter residence times can justify paying up to 1.5X to 2X the price for feedstocks with a higher GXR, based on the expected improvements in their product yield and overall process economics.

Delayed xylose utilization