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 307 records · Page 17

Security constrained optimal power shutoff for wildfire risk mitigation

Abstract Electric grid faults are increasingly the source of ignition for major wildfires. To reduce the likelihood of such ignitions in high risk situations, utilities use preemptive de‐energization of power lines, commonly referred to as Public Safety Power Shutoffs (PSPS). Besides raising challenging trade‐offs between power outages and wildfire safety, PSPS removes redundancy from the network at a time when component faults are likely to happen. This may leave the network particularly vulnerable to unexpected line faults that may occur while the PSPS is in place. Previous works have not explicitly considered the impacts of these outages. To address this gap, the Security Constrained Optimal Power Shutoff problem is proposed which uses post‐contingency security constraints to model the impact of unexpected line faults when planning a PSPS. This model enables, for the first time, the exploration of a wide range of trade‐offs between both wildfire risk and pre‐ and post‐contingency load shedding when designing PSPS plans, providing useful insights for utilities and policy makers considering different approaches to PSPS. The efficacy of the model is demonstrated using the EPRI 39‐bus system as a case study. The results highlight the potential risks of not considering security constraints when planning PSPS and show that incorporating security constraints into the PSPS design process improves the resilience of current PSPS plans.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A hybrid neural architecture: Online attosecond x-ray characterization

The emergence of high-repetition-rate x-ray free-electron lasers (XFELs), such as SLAC’s LCLS-II, serves as our canonical example for autonomous controls that necessitate high-throughput diagnostics paired with streaming computational pipelines capable of single-shot analysis with extremely low latency. We present the deterministic characterization with an integrated parallelizable hybrid resolver architecture, a hybrid machine learning framework designed for fast, accurate analysis of XFEL diagnostics using angular streaking-based sinogram images. This architecture integrates convolutional neural networks and bidirectional long short-term memory models to denoise input, identify x-ray sub-spike features, and extract sub-spike relative delays with sub-30 attosecond temporal resolution. Deployed on low-latency hardware, it achieves over 10 kHz throughput with 168.3 μs inference latency, indicating scalability to 14 kHz with field-programmable gate array integration. By transforming regression tasks into classification problems and leveraging optimized error encoding, we achieve high precision with low-latency performance that is critical for real-time streaming event selection and experimental control feedback signals. This represents a key development in real-time control pipelines for next-generation autonomous science, generally, and high repetition-rate x-ray experiments in particular.

Accelerator Physics (physics.acc-ph)↗

Analytical Models of Frequency and Voltage in Large-Scale All-Inverter Power Systems

Low-order frequency response models for power systems have a decades-long history in optimization and control problems such as unit commitment, economic dispatch, and wide-area control. With a few exceptions, these models are built upon the Newtonian mechanics of synchronous generators, assuming that the frequency dynamics across a system are approximately homogeneous, and assume the dynamics of nodal voltages for most operating conditions are negligible, and thus are not directly computed at all buses. As a result, the use of system frequency models results in the systematic underestimation of frequency minimum nadir and maximum RoCoF, and provides no insight into the reactive power-voltage dynamics. This paper proposes a low-order model of both frequency and voltage response in grid-forming inverter-dominated power systems. The proposed model accounts for spatial-temporal variations in frequency and voltage behavior across a system and as a result, demonstrates the heterogeneity of frequency response in future renewable power systems. Electromagnetic transient (EMT) simulations are used to validate the utility, accuracy, and computational efficiency of these models, setting the basis for them to serve as fast, scalable alternatives to EMT simulation, especially when dealing with very large-scale systems, for both planning and operational studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

PyOED: An Extensible Suite for Data Assimilation and Model-Constrained Optimal Design of Experiments

This article describes PyOED, a highly extensible scientific package that enables developing and testing model-constrained optimal experimental design (OED) for inverse problems. Specifically, PyOED aims to be a comprehensive Python toolkit for model-constrained OED. The package targets scientists and researchers interested in understanding the details of OED formulations and approaches. It is also meant to enable researchers to experiment with standard and innovative OED technologies with a wide range of test problems (e.g., simulation models). OED, inverse problems (e.g., Bayesian inversion), and data assimilation (DA) are closely related research fields, and their formulations overlap significantly. Thus, PyOED is continuously being expanded with a plethora of Bayesian inversion, DA, and OED methods as well as new scientific simulation models, observation error models, and observation operators. These pieces are added such that they can be permuted to enable testing OED methods in various settings of varying complexities. The PyOED core is completely written in Python and utilizes the inherent object-oriented capabilities; however, the current version of PyOED is meant to be extensible rather than scalable. Specifically, PyOED is developed to “enable rapid development and benchmarking of OED methods with minimal coding effort and to maximize code reutilization.” This article provides a brief description of the PyOED layout and philosophy and provides a set of exemplary test cases and tutorials to demonstrate the potential of the package.

97 MATHEMATICS AND COMPUTING↗

Efficient Reformulation and Optimization for SC-ACOPF with Line Switching

This project aims to develop efficient and robust computational methods for solving the security-constrained alternating current optimal power flow problem (SC-ACOPF). The SC-ACOPF problem is a central problem in operating the electric power grids in the United States. It determines the most economically efficient way to operate the generation and transmission system to meet daily electricity demand. The solution found by solving an SC-ACOPF problem must satisfy the physics of the alternating current (AC) power flows, various generator and network operational constraints, and must maintain secure operation under various contingency scenarios, where a generator, a transmission branch, or a transformer may unexpectedly trip offline.

97 MATHEMATICS AND COMPUTING↗

Convex Relaxations of Maximal Load Delivery for Multi-Contingency Analysis of Joint Electric Power and Natural Gas Transmission Networks

Recent increases in gas-fired power generation have engendered increased interdependencies between natural gas and power transmission systems. These interdependencies have amplified existing vulnerabilities in gas and power grids, where disruptions can require the curtailment of load in one or both systems. Although typically operated independently, coordination of these systems during severe disruptions can allow for targeted delivery to lifeline services, including gas delivery for residential heating and power delivery for critical facilities. To address the challenge of estimating maximum joint network capacities under such disruptions, we consider the task of determining feasible steady-state operating points for severely damaged systems while ensuring the maximal delivery of gas and power loads simultaneously, represented mathematically as the nonconvex joint Maximal Load Delivery (MLD) problem. To increase its tractability, we present a mixed-integer convex relaxation of the MLD problem. Then, to demonstrate the relaxation’s effectiveness in determining bounds on network capacities, exact and relaxed MLD formulations are compared across various multi-contingency scenarios on nine joint networks ranging in size from 25 to 1191 nodes. The relaxation-based methodology is observed to accurately and efficiently estimate the impacts of severe joint network disruptions, often converging to the relaxed MLD problem’s globally optimal solution within ten seconds.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Computational Algorithms for Unit Commitment with AC Power Flows (Final Report)

Security-constrained unit commitment (SCUC) is a key component in power system operations. When AC power flow constraints are considered in the SCUC model (AC-SCUC), the problem becomes extremely difficult due to its discrete and non-convex nature, as described in “Grid Optimization Competition Challenge 3 Problem Formulation (GOCC)”. There are four main challenges: (i) Discrete decisions regarding unit online/offline status and start-up/shut-down procedures for every single unit. The number of discrete decision variables increases considerably when a system integrates multiple generators; (ii) Configuration-based combined-cycle formulations, and multi-commodity models that include ramping products, spin/non-spin products, and regulation up/down products. The combined-cycle units introduce additional discrete decision variables and auxiliary service products further complicate the model by connecting multi-commodity products’ continuous and discrete variables; (iii) SCUC models with AC power flow constraints are far more complex due to massive bilinear terms in the large-scale nonlinear power balance equations. The nonlinear power balance equations are further complicated by the discrete step control variables of shunts; (iv) N − 1 contingency analysis. The size of the model increases linearly with the number of contingencies considered, greatly increasing the size of the optimization model. Accordingly, there is an emergent need to develop a robust algorithm capable of deriving a high-quality solution in a short time and passing through contingency tests simultaneously. In this project, we explore innovative techniques to address this challenging problem by integrating advanced polyhedral theory, approximation methods, relaxation strategies, decomposition techniques, and parallel computing. Each technique approaches the problem from a different perspective, leveraging its specific strengths to tackle distinct challenges. Each individual method has demonstrated its effectiveness in the PI’s previous research. Their integration is expected to significantly reduce the computational time required to solve the proposed complex problem. Successful completion of this project has the potential to transform the industry by enhancing optimization solvers capable of handling large-scale day-ahead energy market clearing models within strict time constraints, while incorporating AC power flow constraints. This advancement will lead to reduced overall generation costs and, consequently, increased social welfare.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Active operator learning with predictive uncertainty quantification for partial differential equations

With the increased prevalence of neural operators being used to provide rapid solutions to partial differential equations (PDEs), understanding the accuracy of model predictions and the associated error levels is necessary for deploying reliable surrogate models in scientific applications. Existing uncertainty quantification (UQ) frameworks employ ensembles or Bayesian methods, which can incur substantial computational costs during both training and inference. Here, we propose a lightweight predictive UQ method tailored for Deep operator networks (DeepONets) that also generalizes to other operator networks. Numerical experiments on linear and nonlinear PDEs demonstrate that the framework’s uncertainty estimates are unbiased and provide accurate out-of-distribution uncertainty predictions with a sufficiently large training dataset. Our framework provides fast inference and uncertainty estimates that can efficiently drive outer-loop analyses that would be prohibitively expensive with conventional solvers. We demonstrate how predictive uncertainties can be used in the context of Bayesian optimization and active learning problems to yield improvements in accuracy and data-efficiency for outer-loop optimization procedures. In the active learning setup, we extend the framework to Fourier Neural Operators (FNO) and describe a generalized method for other operator networks. To enable real-time deployment, we introduce an inference strategy based on precomputed trunk outputs and a sparse placement matrix, reducing evaluation time by more than a factor of five. Our method provides a practical route to uncertainty-aware operator learning in time-sensitive settings.

97 MATHEMATICS AND COMPUTING↗

Maximizing Free Energy Gain

Maximizing the amount of work harvested from an environment is important for a wide variety of biological and technological processes, from energy-harvesting processes such as photosynthesis to energy storage systems such as fuels and batteries. Here, we consider the maximization of free energy—and by extension, the maximum extractable work—that can be gained by a classical or quantum system that undergoes driving by its environment. We consider how the free energy gain depends on the initial state of the system while also accounting for the cost of preparing the system. We provide simple necessary and sufficient conditions for increasing the gain of free energy by varying the initial state. We also derive simple formulae that relate the free energy gained using the optimal initial state rather than another suboptimal initial state. Finally, we demonstrate that the problem of finding the optimal initial state may have two distinct regimes, one easy and one difficult, depending on the temperatures used for preparation and work extraction. We illustrate our results on a simple model of an information engine.

Physics↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

A Flexible Quasi-Static Mooring Design Optimization Method for Floating Structures

This paper presents a flexible and efficient design method for optimizing the mooring systems of floating structures. Mooring system optimization is challenging because of the strong nonlinearity of mooring system behavior and the many technical constraints that must be satisfied. Furthermore, different mooring configurations can have very different design spaces. While some successful examples of mooring design optimization exist in the literature, developing an optimization approach that can work across various mooring design problems is a larger challenge. We present such a method based on a flexible parameterization that allows a wide variety of mooring designs to be described by a list of variables, a quasi-static mooring model that provides efficient evaluation of a mooring design without directly considering mooring system dynamics, and an optimization framework that generates, evaluates, and adjusts the mooring design while considering user-specified constraints such as offset limits, strength safety factors, and seabed contact limits. We demonstrate the design optimization framework on four mooring design problems, each for a different type of mooring system. We compare the use of different design modes to simplify the optimization problem, showing that they can reduce the computation time by up to 75%. We also compare different optimization algorithms and find that the resulting computational speed can vary by up to 51 times. We perform a sensitivity study on one design and find that the local sensitivity of anchoring radius to water depth has a positive correlation of 0.29, but the global sensitivity shows large nonlinearities. Lastly, we perform a coupled dynamic analysis on one of the optimized designs and find that the predicted mean platform motions and mooring line tensions are within 1% of dynamic results and the extreme motions and tensions are within 14%. Lastly, we show that a DEA-Chain-Polyester mooring configuration is cost-optimal for the given design problem of the demonstrations, which aligns with general industry practice.

16 TIDAL AND WAVE POWER↗

Optimization-based approaches to control of connected and automated vehicles: Principles, complexities, applications, challenges, and outlook

Safe and optimal motion control for connected and automated vehicles (CAVs) poses a fundamental optimization challenge at the intersection of system complexity, environmental uncertainty, and stringent real-time constraints. Existing surveys address this challenge in isolation – focusing either on specific control techniques or individual uncertainty sources – without providing a unified framework that characterizes the trade-offs among computational tractability, performance verifiability, and adaptive generalization across paradigms. This review addresses that gap by presenting a cohesive analytical framework concentrated on the decision-making and trajectory optimization layers of the CAV autonomy stack. We systematically analyze three major optimization paradigms – first-principles model-based optimization, data-driven methods, and hybrid synergistic architectures – evaluating each against four core complexity axes: problem formulation, constraint handling, optimality guarantees, and robustness. Key applications including platooning, trajectory planning, collision avoidance, and cooperative control are examined to reveal recurring methodological patterns and critical operational constraints that limit real-world performance. Our synthesis identifies verifiable hybrid architectures, incentive-aligned multi-agent cooperation, and hardware-algorithm co-design as the defining research frontiers, and distills a targeted agenda for developing CAV control systems that are simultaneously safe, computationally efficient, and deployable in the full complexity of real-world traffic environments.

Muzahid, Abu Jafar Md [University of Tennessee, Kn↗

Recent Advances of PyROS: A Pyomo Solver for Nonconvex Two-Stage Robust Optimization in Process Systems Engineering

The document presents recent algorithmic and implementation advances of the two-stage robust optimization (RO) solver PyROS, and a benchmarking study which demonstrates the utility of PyROS for two-stage RO problems. The advances include extensions of the scope of PyROS to models with uncertain variable bounds, improvements to the initializations of the subproblems used by the underlying cutting set algorithm, and extensions of the uncertainty set interfaces. The benchmarking study is performed on a library of over 8,500 instances, with variations in the nonlinearities, degree-of-freedom partitioning, uncertainty sets, and polynomial decision rule approximations. An amine-based CO2 capture case study is presented to demonstrate the utility of PyROS for large-scale process models. Overall, the results highlight the effectiveness of PyROS for obtaining robust solutions to optimization problems with uncertain equality constraints.

Sherman, Jason↗

Dual Representations and H ∞ -Optimal Control of Partial Differential Equations

We consider H ∞ -optimal state-feedback control of the class of linear Partial Differential Equations (PDEs) which admit a Partial Integral Equation (PIE) representation. While linear matrix inequalities are commonly used for optimal control of Ordinary Differential Equations (ODEs), the absence of a universal state-space representation and suitable dual form prevents such methods from being applied to optimal control of PDEs. Specifically, for ODEs, the controller synthesis problem is defined in state-space, and duality is used to resolve the bilinearity of that synthesis problem. Recently, the PIE representation was proposed as a universal state-space representation for linear PDE systems. In this paper, we show that any PDE system represented by a PIE admits a dual PIE with identical stability and I/O properties. This result allows us to reformulate the stabilizing and optimal state-feedback control problems as convex optimization over the cone of positive Partial Integral (PI) operators. Operator inversion formulae then allow us to construct feedback gains for the original PDE system. The results are verified through application to several canonical problems in optimal control of PDEs and indicate the resulting bounds on H ∞ norm are not conservative.

42 ENGINEERING↗

Gains in operational flexibility, safety margins, and cost efficiencies via integrated Plant Reload Optimization platform

The U.S. Department of Energy Light Water Reactor Sustainability Program Risk-Informed Systems Analysis Pathway Plant Reload Optimization Project aims to develop an integrated, comprehensive framework offering an all-in-one solution for reload evaluations with a special focus on optimizing core design. Optimizing the fuel loading pattern is one of the most important considerations in reducing the amount of new fuel used in the core. Due to thousands of possible core configuration options, finding optimal solutions is an unachievable task for a human. The Plant ReLoad Optimization platform, which supports artificial-intelligence-based reactor core designing, is now fully capable of handling realistic problems. The Plant ReLoad Optimization platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. The NSGA-II (Non-dominated Sorting Genetic Algorithm II) optimizer was developed and tested within RAVEN (Risk Analysis and Virtual ENvironment) to handle many constraints by using an augmented objectives methodology. The demonstration was performed with constrained multiobjective optimization of a 17 × 17 pressurized-water reactor core loading patterns to minimize fuel cost and maximize fuel cycle length.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

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↗

Grid Expansion Optimal Planning Tools (GridEO): Manual for Users and Developers

This report describes Grid Expansion Optimal Planning Tools (GridEO). GridEO is a Python package for electric power grid capacity expansion modeling. With GridEO, the user can build and solve instances of the Capacity Expansion Planning (CEP) problem to determine an optimal plan of investment in capacity of various types of power grid equipment.

24 POWER TRANSMISSION AND DISTRIBUTION↗