Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization problem”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗
DOE OSTI2024

Dynamically Learning Incentives for Load Control

As electrical generation becomes more distributed and volatile, and loads become more uncertain, controllability of distributed energy resources (DERs), regardless of their ownership status, will be necessary for grid reliability. Grid operators lack direct control over end-users' grid interactions, such as energy usage, but incentives can influence behavior -- for example, an end-user that receives a grid-driven incentive may adjust their consumption or expose relevant control variables in response. A key challenge in studying such incentives is the lack of data about human behavior, which usually motivates strong assumptions, such as distributional assumptions on compliance or rational utility-maximization. In this paper, we propose a general incentive mechanism in the form of a constrained optimization problem -- our approach is distinguished from prior work by modeling human behavior (e.g., reactions to an incentive) as an arbitrary unknown function. We propose feedback-based optimization algorithms to solve this problem that each leverage different amounts of information and/or measurements. We show that each converges to an asymptotically stable incentive with (near)-optimality guarantees given mild assumptions on the problem. Finally, we evaluate our proposed techniques in voltage regulation simulations on standard test beds. We test a variety of settings, including those that break assumptions required for theoretical convergence (e.g., convexity, smoothness) to capture realistic settings. In this evaluation, our proposed algorithms are able to find near-optimal incentives even when the reaction to an incentive is modeled by a theoretically difficult (yet realistic) function.

demand response↗
DOE OSTI2024

Analysis of Control Behavior in Eco-Driving Speed Optimization Using Pontryagin’s Minimum Principle

The energy efficiency of autonomous vehicles can be improved by selecting an optimized speed profile. Energy savings can be maximized by performing control optimization with knowledge of the powertrain characteristics and future driving conditions. Previous studies have shown that Pontryagin’s minimum principle (PMP) performs well in vehicle speed optimization problems. Building on the methods proposed in previous studies, the contribution of this study is to derive meaningful observations from the concepts and results of PMP to enhance the understanding of the control problem. In particular, the switching behavior of the control mode is analyzed with supportive variables, such as ξ and mv, which dictates the changes in the control modes. Additionally, the existence of the singular control is analyzed, which helps in understanding the cruise driving in the control problem. Finally, we obtain several solutions that satisfy various boundary conditions along with a map of the reachable states, and discuss the impact of cruise driving. This is helpful for designing practical control concepts for real-world applications based on this map. Previous studies have contributed significantly to this control problem; however, this study provides a better understanding of the issue and offers guidance and inspiration for future real-world applications based on these meaningful observations.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

Noise-Directed Adaptive Remapping for Integer Optimization: from qubits to (encoded) qudits

We extend Noise-Directed Adaptive Remapping (NDAR), a recently proposed heuristic meta-algorithm that leverages device noise as a computational resource, to optimization problems over discrete (integer) domains. While originally introduced for unconstrained binary optimization, the proposed generalization introduces additional gauge degrees of freedom at the logical level, such that the gauge transformation applied at each iteration is no longer unique, allowing tailoring to particular encodings or quantum hardware. We identify encoding-dependent requirements for NDAR beyond binary domains: feasibility of the noise attractor, existence of compatible gauge transformations that preserve an efficiently implementable circuit family, and a systematic way to select the transform to apply at each step. We analyze these criteria for qudit-native and for binary, one-hot, and domain-wall qubit encodings, using the Max-k-colorable subgraph problem as a running example. We demonstrate that these encodings can exhibit distinct advantages and tradeoffs when integrated within the NDAR framework, particularly in how noise-induced dynamics interact with the solution landscape and choice of encoding. Our results indicate that NDAR-guided noise considerations provide a new criterion for comparing device-level encoding choices for quantum optimization. Finally, we outline directions toward experimental realization in superconducting qudit devices and further algorithmic improvements.

Hadfield, Stuart [RIACS, Mtn. View] (ORCID:0000000↗
DOE OSTI2026

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗
DOE OSTI2026

Machine Learning for Fairness-Aware Load Shedding: A Real-Time Solution via Identifying Binding Constraints: Preprint

Timely and effective load shedding in power systems is critical for maintaining supply-demand balance and preventing cascading blackouts. To eliminate load shedding bias against specific regions in the system, optimization-based methods are uniquely positioned to help balance between economic and fairness considerations. However, the resulting optimization problem involves complex constraints, which can be time-consuming to solve and thus cannot meet the real-time requirements of load shedding. To tackle this challenge, in this paper we present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm for delivering fairness-aware and real-time load shedding decisions.

97 MATHEMATICS AND COMPUTING↗
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↗
DOE OSTI2024

Unconventional Quantum Advantages for Computation (U-QuAC)

While quantum computing offers the promise of exponential advantages, limited quantum speedups are known, especially for practical applications. To open new avenues for quantum advantages, we propose Unconventional Quantum Advantages for Computation (U-QuACs), with respect to unconventional resources such as space (number of bits or quantum bits of memory required to solve a problem), accuracy of solution, communication, or energy consumption. We focus on space-efficient quantum algorithms, where we seek to design algorithms that solve a problem using much less space than the total size of the input. A natural setting in which space is critical is the streaming model of computation, where the input data arrives sequentially in pieces that must each be processed individually. Streaming is motivated by a variety of problems including analysis of internet traffic or social networks. We design the first exponential quantum space advantage for a natural streaming problem, which also constitutes the first quantum advantage for approximating a discrete optimization problem, albeit with respect to space.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

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. (↗
DOE OSTI2025

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Distributed Quantum-Enhanced Optimization: A Topographical Preconditioning Approach for High-Dimensional Search

Optimization problems become fundamentally challenging as the number of variables increases. Because the volume of the search space grows exponentially, classical algorithms frequently fail to locate the global minimum of non-convex functions. While quantum optimization offers a potential alternative, mapping continuous problems onto near-term quantum hardware introduces severe scaling limits and barren plateaus. To bridge this gap, we propose the Distributed Quantum-Enhanced Optimization (D-QEO) framework. Instead of forcing the quantum processor to find the exact minimum, we use it simply as a topographical preconditioner. The QPU maps the landscape to locate the most promising basin of attraction, generating high-quality seed points for a classical GPU-accelerated solver to refine. To make this approach viable for utility-scale problems, we exploit the mathematical structure of separable functions. This allows us to cut a 50-qubit (i.e., $2^{50}$) global search space into independent and manageable sub-spaces using 5-qubit subcircuits. By executing these fragments concurrently with CUDA-Q, we completely bypass the overhead of cross-register entanglement and classical tensor knitting for separable functions. Benchmarks on the 10-dimensional Rastrigin and Ackley functions show that D-QEO prevents the exponential failure rates observed in purely classical algorithms. Furthermore, this quantum warm-start significantly reduces the number of classical BFGS iterations required to converge, providing a highly practical blueprint for utilizing near-term quantum resources in complex global search.

Soos, Dominik [Old Dominion U.]↗
DOE OSTI2025

Decision-Dependent Uncertainty-Aware Distribution System Planning Under Wildfire Risk

The interaction between power systems and wildfires can be dangerous and costly. Distribution grids can be liable for the outbreak of wildfires during extreme weather. In wildfire-prone areas, investment planning should consider the impact of operational actions on wildfire-related uncertainties affecting line failure likelihood. Here, in this case, endogenous-based uncertainty modeling should comprise the backbone of the investment planning model viz-a-viz the inability of standard exogenous-based uncertainty modeling. Therefore, we propose a decision-dependent uncertainty (DDU) aware methodology to optimize investment portfolios for distribution systems, considering that high power-flow levels in high-threat areas can ignite wildfires and increase line failure probability. The methodology identifies the best combination of upgrades (new lines, hardening existing lines, and placing switching devices). Methodologically, we propose a two-stage distributionally robust planning optimization problem with DDU that considers the distribution system's multiperiod operation. The first stage determines optimal switching actions and line investments, and the second stage evaluates the worst-case expected operational cost under a DDU framework designed to account for the endogenous impact of power-flow levels and hardening investment decisions in the line failure probabilities. An iterative method is tailored to handle the problem and numerical experiments demonstrate a more prepared grid to deal with wildfire risk.

Power systems investment planning↗
DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗
DOE OSTI2025

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Optimization Layers for Pyomo [SWR-25-132]

Optimization Layers for Pyomo solves an optimization problem using Pyomo and IPOPT during the forward pass. It computes the gradient of the optimal solution with respect to the parameters based on the KKT conditions in the backward pass. It is a Python library for constructing differentiable optimization layers in PyTorch from Pyomo optimization models.

Chen, Kejun [National Laboratory of the Rockies (N↗
DOE OSTI2025

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗