Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem solving”

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

On optimal control of hybrid dynamical systems using complementarity constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas–liquid tank model and an optimal control problem with a sliding mode solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗
DOE OSTI2024

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

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.

42 ENGINEERING↗
DOE OSTI2024

Predictive Dirac neutrino spectrum with strong CP solution in SU(5)L × SU(5)R unification

Abstract We develop a grand unified theory of matter and forces based on the gauge symmetry SU(5) L × SU(5) R with parity interchanging the two factor groups. Our main motivation for such a construction is to realize a minimal GUT embedding of left-right symmetric models that provide a parity solution to the strong CP problem without the axion. We show how the gauge couplings unify with an intermediate gauge symmetry SU(3) cL × SU(2) 2L × U(1) L × SU(5) R , and establish its consistency with proton decay constraints. The model correctly reproduces the observed fermion masses and mixings and leads tonaturally light Dirac neutrinoswith their Yukawa couplings suppressed by a factorM I /M G , the ratio of the intermediate scale to the GUT scale. We call this mechanism type II-Dirac seesaw. Furthermore, the model predictsδ CP = ±(130.4±1.2)° and$${m}_{{\nu }_{1}}$$= (4.8 – 8.4) meV for the Dirac CP phase and the lightest neutrino mass. We demonstrate how the model solves the strong CP problem via parity symmetry.

Physics↗
DOE OSTI2026

Consequential improvement acquisition function for efficient multi-fidelity Bayesian optimization

Abstract Surrogate-based Bayesian optimization has been widely applied in design optimization to increase sampling efficiency. However, the cost for each evaluation of the objective function can still be very high when physical experiments or large-scale simulations are involved. Multi-fidelity Bayesian optimization is the new approach to further improve the sampling efficiency by reducing the number of expensive samples at the highest fidelity level and supplementing them with less expensive ones at low-fidelity levels. In this paper, a new consequential improvement (CI) acquisition function is proposed to allow for the simultaneous selection of the solution and the fidelity level in problems with a known hierarchy of fidelity levels. The new CI acquisition function incorporates the consequential effectiveness of objective improvement with the considerations of cost, accuracy, and validity differences between high- and low-fidelity samples in engineering practice. The new method of multi-fidelity Bayesian optimization based on the CI is demonstrated with several analytical and simulation-based design examples. In the simulation-based design optimization example, the results show that the CI acquisition function has a decisive advantage in the sampling efficiency over the other methods of multi-fidelity Bayesian optimization with simultaneous selection. The results indicate that the proposed method is particularly advantageous in solving high-dimensional problems and when large cost ratios between high- and low-fidelity evaluations exist and high-fidelity validation is mandatory. Furthermore, the method robustly avoids the prevalent issue of over sampling at low-fidelity levels.

Aydogdu, Ibrahim [Georgia Institute of Technology,↗
DOE OSTI2025

Developing aqueous solubilizing agents as an alternative to solvent extraction

Here, advancing separations science is important for the entire field of chemistry. One partitioning technique that would benefit from improvement is solvent extraction. Despite its effective and widespread use, the method suffers from some problems: generation of flammable organic waste, lengthy process times, and safety concerns associated with contacting organic solvents with acidic aqueous solutions. We developed an alternative separation method inspired by solvent extraction that side-steps those issues. Toward this end, we identified that the functionality of an extractant (an agent used in solvent extraction to pull analytes from the aqueous phase into the organic phase) would change if it was modified for water solubility. In this alternative scenario, the extractant transforms into an “aqueous solubilizing agent.” We discovered that adding this aqueous solubilizing agent alongside a precipitating agent caused the contaminants to precipitate, but not the analyte. This separation concept was demonstrated within the bounds of one of the most difficult partitioning problems, separating minor actinides (Am 3+ ) from lanthanides (Ln 3+ ). We discovered that the (HSO 3 Ph) 4 BTP (aq) aqueous solubilizing agent prevented Am 3+ (aq) from precipitating with Ln 3+ (aq) when f-element precipitating agents (NaF (aq) or HF (aq) ) were added. This separation boasts impressive Am 3+ (aq) recovery yield (90 ± 2 %), near quantitative Ln 3+ (aq) removal, and high separation factors [>3000, Am 3+ (aq) vs. Nd 3+ (aq) ]. It seems likely – given the large number of candidate extractants that could be modified for aqueous solubility and the numerous combinations of existing solubilizing and precipitating agents – that this alternative approach could be used broadly in place of solvent extraction and solve other important separation problems.

(HSO3Ph)4BTP(aq)↗
DOE OSTI2025

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A closer look in the mirror: reflections on the matter/dark matter coincidence

We argue that the striking similarity between the cosmic abundances of baryons and dark matter, despite their very different astrophysical behavior, strongly motivates the scenario in which dark matter resides within a rich dark sector parallel in structure to that of the standard model. The near cosmic coincidence is then explained by an approximate ℤ$_{2}$ exchange symmetry between the two sectors, where dark matter consists of stable dark neutrons, with matter and dark matter asymmetries arising via parallel WIMP baryogenesis mechanisms. Taking a top-down perspective, we point out that an adequate ℤ$_{2}$ symmetry necessitates solving the electroweak hierarchy problem in each sector, without our committing to a specific implementation. A higher-dimensional realization in the far UV is presented, in which the hierarchical couplings of the two sectors and the requisite ℤ$_{2}$-breaking structure arise naturally from extra-dimensional localization and gauge symmetries. We trace the cosmic history, paying attention to potential pitfalls not fully considered in previous literature. Residual ℤ$_{2}$-breaking can very plausibly give rise to the asymmetric reheating of the two sectors, needed to keep the cosmological abundance of relativistic dark particles below tight bounds. We show that, despite the need to keep inter-sector couplings highly suppressed after asymmetric reheating, there can naturally be order-one couplings mediated by TeV scale particles which can allow experimental probes of the dark sector at high energy colliders. Massive mediators can also induce dark matter direct detection signals, but likely at or below the neutrino floor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A light QCD axion with hilltop misalignment

We study the cosmological evolution of a light QCD axion and identify the parameter space to obtain the correct relic dark matter abundance. The axion potential is flattened at the origin, corresponding to the only minimum, while it is unsuppressed at π. These potential features arise by assuming a mirror sector with the strong CP phase $\overline{θ}$ shifted by π compared to the SM sector, which allows the mirror axion potential to be tuned against the usual QCD axion potential. Before the QCD phase transition, assuming the mirror sector is decoupled and much colder than the SM thermal bath, the mirror sector potential dominates, causing the axion to initially roll to a temporary minimum at π. However, after the QCD phase transition, the potential minimum changes, and the axion relaxes from the newly created “hilltop” near π to the CP-conserving minimum at the origin. As the axion adiabatically tracks this shift in the potential minimum through the QCD phase transition, with non-adiabatic evolution near π and 0, it alters the usual prediction of the dark matter abundance. Consequently, this “hilltop” misalignment mechanism opens new regions of axion parameter space, with the correct relic abundance while still solving the strong CP problem, that could be explored in future experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Axion detection via superfluid 3 He ferromagnetic phase and quantum measurement techniques

We propose to use the nuclear spin excitation in the ferromagnetic A 1 phase of the superfluid 3 He for the axion dark matter detection. This approach is striking in that it is sensitive to the axion-nucleon coupling, one of the most important features of the QCD axion introduced to solve the strong CP problem. We review a quantum mechanical description of the nuclear spin excitation and apply it to the estimation of the axion-induced spin excitation rate. We also describe a possible detection method of the spin excitation in detail and show that the combination of the squeezing of the final state with the Josephson parametric amplifier and the homodyne measurement can enhance the sensitivity. It turns out that this approach gives good sensitivity to the axion dark matter with the mass of $\mathcal{O}$(1) μeV depending on the size of the external magnetic field. We estimate the parameters of experimental setups, e.g., the detector volume and the amplitude of squeezing, required to reach the QCD axion parameter space.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Leptogenesis in automatic Nelson-Barr models

In this study, we numerically show that automatic Nelson-Barr models with new chiral fermions can simultaneously solve the strong CP problem and generate the observed baryon asymmetry via high-scale leptogenesis. In these models, all CP violation arises from a single spontaneous symmetry-breaking scale, linking the origin of quark and lepton CP phases. Using conservative assumptions and minimal dynamics, we identify a viable parameter window where successful leptogenesis occurs without spoiling the quality of the strong CP solution. Models with vector-like fermions face tension within this leptogenesis scenario. A key prediction is a correlation between the baryon asymmetry and the induced QCD vacuum angle shift. Remarkably, we find that the majority of the available parameter space is within reach of current and future nucleon EDM experiments.

CP violation↗
DOE OSTI2024

SPECTER: efficient evaluation of the spectral EMD

The Energy Mover’s Distance (EMD) has seen use in collider physics as a metric between events and as a geometric method of defining infrared and collinear safe observables. Recently, the Spectral Energy Mover’s Distance (SEMD) has been proposed as a more analytically tractable alternative to the EMD. In this work, we obtain a closed-form expression for the Riemannian-like p = 2 SEMD metric between events, eliminating the need to numerically solve an optimal transport problem. Additionally, we show how the SEMD can be used to define event and jet shape observables by minimizing the distance between events and parameterized energy flows (similar to the EMD), and we obtain closed-form expressions for several of these observables. We also present the Specter framework, an efficient and highly parallelized implementation of the SEMD metric and SEMD-derived shape observables as an analogue of the previously-introduced Shaper for EMD-based computations. We demonstrate that computing the SEMD with Specter can be up to a thousand times faster than computing the EMD with standard optimal transport libraries.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Accelerating template generation in resonant anomaly detection searches with optimal transport

We introduce Resonant Anomaly Detection with Optimal Transport (RAD-OT), a method for generating signal templates in resonant anomaly detection searches. RAD-OT leverages the fact that the samples from the conditional probability density of the target features vary approximately linearly along the optimal transport path connecting the resonant feature. This does not assume that the conditional density itself is linear with the resonant feature, allowing RAD-OT to efficiently capture multimodal relationships, changes in resolution, etc. By solving the optimal transport problem, RAD-OT can quickly build a template by interpolating between the background distributions in two sideband regions. We demonstrate the performance of RAD-OT using the LHC Olympics R&D dataset, where we find comparable sensitivity and improved stability with respect to deep learning-based approaches.

Automation↗
DOE OSTI2025

A matheuristic for design and dispatch of a utility-connected distributed energy system

Modeling distributed power generation systems often requires complicated mathematical expressions that present challenges for commercial optimization solvers. Here, this paper presents a matheuristic to solve a mixed-integer optimization model that informs decisions regarding the design and dispatch of a utility-connected microgrid. We deploy a genetic algorithm to search the system design space and a linear program to solve the economic dispatch problem. The model is a component of a web tool that requires solutions within a few minutes. Our method yields objective function values within 5% of an exogenously produced optimal in fewer than 30 seconds for 90% of our test cases compared to only 10% of our test cases by a traditional optimization solver in the same amount of time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Eco-driving Profile Optimization by Dynamic Programming for Battery Electric Vehicles

Although full automation has not yet been achieved, automated vehicles are a valid research area. Not only would automated vehicles provide ultimate driver convenience, but they would maximize energy efficiency by eliminating undesired human driving behaviors and optimally controlling the powertrain. From the perspective of control related to energy saving, speed profile optimization is important for improving system efficiency and satisfying passenger demands. This study employs Dynamic Programming (DP) to solve the constrained optimal problem for travel time, distance, and speed limit by exploring all possible control options. The solutions obtained by DP demonstrate consistent control patterns combining four control modes-acceleration, cruising, coasting, and braking, with cruising or coasting being selective depending on the boundary conditions. Further, this study introduces DP-based simulation results and attempts to provide comprehensive interpretations of the optimal policy by analyzing the essential factors that affect the control problem, including boundary conditions, road load, and powertrain characteristics. Based on these interpretations, the control concepts can be explained as the optimal policy selecting the best control option based on system efficiency and boundary conditions. The results of DP are compared with a human-like driver model to show that the optimal speed profiles can effectively reduce energy consumption.

Autonomous vehicles↗