Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quadratic Program”

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.

23 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Physics-Informed Graph Neural Networks for Collaborative Dynamic Reconfiguration and Voltage Regulation in Unbalanced Distribution Systems

Network reconfiguration has long been employed as a strategic approach to minimize power distribution system losses and effectively regulate voltage levels. Tap-changing voltage regulators are also critical for controlling bus voltages, especially in accommodating the increasing integration of distributed energy resources (DERs) with intermittent outputs. This paper introduces novel methodologies to address the challenges of dynamic reconfiguration and optimal tap setting in unbalanced three-phase distribution systems. We propose an approximated mixed-integer quadratically constrained program (MIQCP) to model dynamic reconfiguration, along with a pioneering formulation for voltage regulator (VR) tap-setting based on Special Ordered Set type 1 (SOS1). To mitigate computational complexity, we propose a physics-informed spatial-temporal graph convolutional network (STGCN) with an integrated link classifier. The proposed approach enables efficient solution generation by fixing specific variables in the MIQCP instance and solving the simplified sub-MIP using an MIP solver. Numerical studies demonstrate the superior prediction accuracy of our STGCN model compared to baseline neural network models, resulting in reduced DER curtailment and voltage deviation with shorter computation time.

dynamic reconfiguration↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

COLUMBUS─An Efficient and General Program Package for Ground and Excited State Computations Including Spin–Orbit Couplings and Dynamics

The COLUMBUS program system provides the tools for performing high-level multireference (MR) computations, including the multireference configuration interaction (MRCI) method and its multireference averaged quadratic coupled cluster (MR-AQCC) extension, allowing computations on a wide range of fascinating atomic and molecular systems, including the treatment of open-shells and complicated excited state phenomena. The inclusion of spin−orbit coupling (SOC) directly within the MRCI step enables the description of systems containing heavy elements, such as lanthanides and actinides, whose properties are strongly influenced by SOC. Analytic energy gradients and nonadiabatic couplings at the correlated MRCI level provide the foundation for a variety of dynamics studies, giving insight into ultrafast photochemistry. New and ongoing method developments in COLUMBUS include the computation of spin densities, improved descriptions of ionic states, enhancements to the AQCC method, and the porting of COLUMBUS to graphical processing units (GPUs). New external interfaces enable an enhanced description of electronic resonances and molecules in strong laser fields. This work highlights these new developments while providing a detailed account of the diverse applications of COLUMBUS in recent years.

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

Glass Design Using Machine Learning Property Models with Prediction Uncertainties: Nuclear Waste Glass Formulation

The United States Department of Energy is responsible for managing the legacy nuclear waste stored in underground tanks at the Hanford Site. The waste will be separately vitrified as low-activity waste and high-level waste fractions. Waste glass formulation algorithms have been traditionally developed using partial quadratic mixture property-composition models. Recently, machine learning (ML) techniques have been used to predict glass properties and discover new glass materials for nuclear waste vitrification, and these advancements can be utilized to improve waste glass composition design. In this proof-of-principle study, ML algorithms such as Gaussian process regression (GPR) were used to interpolate glass properties (e.g., viscosity, electrical conductivity, chemical durability). After selecting appropriate sets of GPR hyper-parameters for each property, an optimization program was developed to formulate glass compositions to maximize waste loading while simultaneously satisfying property within constraints. The results of the ML-based waste loadings and glass compositions were compared to those obtained using the traditional methods. Comparing to the previous glass design framework, the ML-based optimization methods offer improved glass designs and a streamlined approach to generation of optimally designed data and near real-time updates.

glass formulation, machine learning, constraints, ↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗