Search NASA⌕ Search

SEARCH · Search NASA

Results for “parametric programming”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

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

A Multi-Parametric optimization approach for bilevel mixed-integer linear and quadratic programming problems

Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. Herein, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multi-parametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems.

42 ENGINEERING↗
DOE OSTI2026

Determining Stability Margins in Adiabatic Superconducting Magnets with 3-D Finite Element Analysis

Superconducting magnets play a key role in the development of experiments at Fermilab; understanding the operating stability of these can allow us to utilize more potent magnets for future experiments (like the proposed Muon Collider), optimize the design of magnets in more immediate experiments (like Mu2e), and research the future use of more exotic materials (like high-temperature superconductors). This summer, I developed a 3-D parametric FEA program in ANSYS Mechanical APDL that simulates quench in superconducting magnets, and I also developed a parametric MATLAB program that predicts thermal behavior in magnet quench using the MIITS method. These programs can provide useful quenching parameters (like minimum quench energy and normal zone propagation velocity) for different cases of quench, leading to the previously mentioned objective of magnet design optimization. To test the programs, preliminary cases were run and the data produced was compared and analyzed. The results of these analyses, as well as the program operating methods, are discussed in this project.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Multi-parametric analysis for mixed integer linear programming: An application to transmission upgrade and congestion management

Upgrading the capacity of existing transmission lines is essential for meeting the growing energy demands, facilitating the integration of renewable energy, and ensuring the security of the transmission system. This study focuses on the selection of lines whose capacities and by how much should be expanded from the perspective of the Independent System Operators (ISOs) to minimize the total system cost. We employ advanced multi-parametric programming and an enhanced branch-and-bound algorithm to address complex mixed-integer linear programming (MILP) problems, considering multi-period time constraints and physical limitations of generators and transmission lines. To characterize the various decisions in transmission expansion, we model the increased capacity of existing lines as parameters within a specified range. This study first relaxes the binary variables to continuous variables and applies the Lagrange method and Karush-Kuhn-Tucker (KKT) conditions to obtain optimal solutions and identify critical regions associated with active and inactive constraints. Moreover, we extend the traditional branch-and-bound (B&B) method by determining the problem’s upper and lower bounds at each node of the B&B decision tree, helping to manage computational challenges in large-scale MILP problems. Here, we compare the difference between the upper and lower bounds to obtain an approximate optimal solution within the decision-makers’ tolerable error range. In addition, the first derivative of the objective function on the parameters of each line is used to inform the selection of lines for easing congestion and maximizing social welfare. Finally, the capacity upgrades are selected by weighing the reductions in system costs against the expense of upgrading line capacities. The findings are supported by numerical simulations and provide transmission-line planners with decision-making guidance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do not require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Description and Use of SCALE Sampler Parametric Capability for Engineering Analysis and Optimization

The Sampler sequence was introduced into the SCALE nuclear modeling and simulation suite in SCALE 6.2 to perform uncertainty quantification via random sampling of nuclear data, material number densities, and dimensions. Sampler was expanded with the introduction of a parametric capability in SCALE 6.2.2. This paper discusses input for the Sampler parametric sequence and presents two case studies of analyses performed using the sequence. These case studies include preconceptual design of a package for transporting high assay low-enriched uranium (HALEU) oxide and scoping calculations to support subcritical limit development for a future update of the ANSI/ANS-8.1 (ANS-8.1) standard. The parametric capability within Sampler provides many benefits to analysts. For instance, parametric sweeps are frequently used to identify optimum parameter values as part of safety analysis or system design, but such sweeps can require substantial engineering time or may rely on custom-written scripts or scripts such as Write One, Run Many (or WORM) developed outside of any software quality assurance program. With the parametric capabilities in Sampler, however, a large number of inputs can be generated automatically without recourse to scripting by individual analysts. The parametric capability can also be used in lieu of the CSAS5S search sequence to identify optimum parameters more simply with straightforward inputs and outputs. Sampler can also be used to calculate input parameters from engineering specifications. For example, diameters can be converted to radii, or masses can be used to calculate number densities. Overall, the Sampler parametric capability provides a robust feature within SCALE, eliminating the need for user-developed scripting.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

A Bi-Level Formulation And Solution Method For The Integration Of Process Design And Scheduling

Design and operation decisions of manufacturing plants can often be expressed within a hierarchical structure, where optimal decisions at lower operating level provide constraints for the decision raking at a higher decision level. In this work, we are addressing the case of a hierarchical design and scheduling optimization problem. The integration of design and scheduling decisions can play a big role in designing economically profitable plants and improving their operational performance. This problem can be expressed as a bi-level problem, where design related decisions occur at the upper level and operational scheduling decisions at the lower level. Since discrete decisions are involved in both optimization levels, the resulting formulation typically corresponds to bi-level mixed-integer programming problems (B-MIP). The solution of B-MIP problems is very challenging, and typically requires the use of global optimization techniques, with many algorithms not able to guarantee feasibility. To overcome the challenges in solving this class of problems we propose the use of a multi-parametric based algorithm for the solution of bi-level mixed-integer linear and quadratic programming problems, capable of providing the exact and global solution. The main idea of this approach is to treat the lower scheduling problem as a multi-parametric programming problem in which the design decisions are considered as parameters. Here, the resulting parametric solutions can then be substituted into the upper level design problem, which can be solved as a set of single-level deterministic programming problems. Through the developed formulation and algorithm we are able to supply the decision makers with the exact solution of the integrated design and scheduling problem.

42 ENGINEERING↗
DOE OSTI2022

A parametric approach to identify synergistic domains of process intensification for reactive separation

Process intensification aims to combine multiple tasks within multi-functional units to drastically improve economic, energy or sustainability metrics of a chemical process. Limited work exists to systematically identify the synergistic domains where intensification outperforms its nonintensified counterpart. In this work, we computationally derive the synergistic domains of a reactive separation system. Specifically, we first postulate general models for both intensified and nonintensified systems. We use these models to generate data to train a ReLU-type artifical neural network (ANN). Further, the trained ReLU-NN model is formulated as a multi-parametric mixed-integer linear program (mp-MILP), and the critical regions of this mp-MILP define the synergistic feasible domains of intensification. We have derived these synergistic domains of vapor–liquid equilibrium (VLE)-based reactive separation for several industrial applications. These synergistic domains enable quick screening of properties that favor intensification.

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

CrossLink: Meshing a 3D part from a STEP file [Slides]

This example shows how to use CrossLink to create a mesh for a 3D geometry part read in from a STEP file. A STEP file (Standard for the Exchange of Product data) is a common file format used for 3D modelling that can be written out from a CAD program (e.g., Creo Parametric). Being able to read and mesh STEP file geometries is essential for meshing parts from engineering models. Creating the mesh typically involves: (1) Importing the geometry; (2) Creating geometry groups; (3) Assigning curves and surfaces to the geometry groups; (4) Building a topology; (5) Applying geometric and mesh constraints; and (6) Generating the final mesh. Current issues with this process in CrossLink include: (1) The GUI does not display trimmed surfaces; (2) The user must manually create and assign geometry groups; and (3) The user must be aware of duplicate curves and surfaces from the CAD model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Crossing the Streams – Sampler and the TemplateEngine [Slides]

This presentation discusses Sampler, which is a versatile UQ and parametric study tool that can be applied to any SCALE Sequence. Sampler can perturb any quantity in any SCALE input. Recent work at ORNL has developed new types of covariance data that allow Sampler UQ to be applied to nearly all SCALE applications, including reactor depletion, UNF fuel characterization, source term analysis, and decay heat calculation. In SCALE 6.2 releases, CE data in transport cannot be perturbed. Sampler was originally designed for stochastic sampling with any sequence within SCALE and Parametric capability added in SCALE 6.2.2. Sampler can be used for uncertainty quantification, including sample data in static or depletion calculations and sample inputs for uncertainties in compositions and dimensions. The SCALE TemplateEngine allows for expanding templates to full inputs and the combination provides a powerful UQ tool.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Theory uncertainties of the irreducible background to VBF Higgs production

Higgs boson production through gluon fusion in association with two jets is an irreducible background to Higgs boson production through vector boson fusion, one of the most important channels for analyzing and understanding the Higgs boson properties at the Large Hadron Collider. Despite a range of available simulation tools, precise predictions for the corresponding final states are notoriously hard to achieve. Using state-of-the-art fixed-order calculations as the baseline for a comparison, we perform a detailed study of similarities and differences in existing event generators. We provide consistent setups for the simulations that can be used to obtain identical parametric precision in various programs used by experiments. We find that NLO calculations for the two-jet final state are essential to achieve reliable predictions.

Chen, Xuan [Shandong U.] (ORCID:0000000167722196)↗
DOE OSTI2022

Koopman-based Differentiable Predictive Control for the Dynamics-Aware Economic Dispatch Problem

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, the incorporation of differential equations that govern the system dynamics makes DED an optimization problem that is computationally prohibitive to solve. In this work, we present a new data-driven approach based on differentiable programming to efficiently obtain offline parametric solutions to the underlying DED problem. In particular, we employ the recently proposed differentiable predictive control (DPC) for offline learning of explicit neural control policies based on identified Koopman operator (KO) model of the system dynamics. We demonstrate the high solution quality and five orders of magnitude computational-time savings of the DPC method over the original optimization-based DED approach on a 9-bus test power grid network.

King, Ethan↗
DOE OSTI2018

Control of Three Degrees-of-Freedom Wave Energy Converters Using Pseudo-Spectral Methods

This study presents a solution to the optimal control problem of a three degrees-of-freedom (3DOF) wave energy converter (WEC). The three modes are the heave, pitch, and surge. The dynamic model is characterized by a coupling between the pitch and surge modes, while the heave is decoupled. The heave, however, excites the pitch motion through nonlinear parametric excitation in the pitch mode. This paper uses Fourier series (FS) as basis functions to approximate the states and the control. A simplified model is first used where the parametric excitation term is neglected and a closed-form solution for the optimal control is developed. For the parametrically excited case, a sequential quadratic programming approach is implemented to solve for the optimal control numerically. Numerical results show that the harvested energy from three modes is greater than three times the harvested energy from the heave mode alone. Moreover, the harvested energy using a control that accounts for the parametric excitation is significantly higher than the energy harvested when neglecting this nonlinear parametric excitation term.

16 TIDAL AND WAVE POWER↗
DOE OSTI2019

Pseudo-spectral method to control three-degree-of-freedom wave energy converters

The invention provides optimal control of a three-degree-of-freedom wave energy converter using a pseudo-spectral control method. The three modes are the heave, pitch and surge. A dynamic model is characterized by a coupling between the pitch and surge modes, while the heave is decoupled. The heave, however, excites the pitch motion through nonlinear parametric excitation in the pitch mode. The invention can use a Fourier series as basis functions to approximate the states and the control. For the parametric excited case, a sequential quadratic programming approach can be implemented to numerically solve for the optimal control. The numerical results show that the harvested energy from three modes is greater than three times the harvested energy from the heave mode alone. Moreover, the harvested energy using a control that accounts for the parametric excitation is significantly higher than the energy harvested when neglecting this nonlinear parametric excitation term.

Abdelkhalik, Ossama↗
DOE OSTI2022

The QICK (Quantum Instrumentation Control Kit): Readout and control for qubits and detectors

We introduce a Xilinx RF System-on-Chip (RFSoC)-based qubit controller (called the Quantum Instrumentation Control Kit, or QICK for short), which supports the direct synthesis of control pulses with carrier frequencies of up to 6 GHz. The QICK can control multiple qubits or other quantum devices. The QICK consists of a digital board hosting an RFSoC field-programmable gate array, custom firmware, and software and an optional companion custom-designed analog front-end board. We characterize the analog performance of the system as well as its digital latency, important for quantum error correction and feedback protocols. We benchmark the controller by performing standard characterizations of a transmon qubit. We achieve an average gate fidelity of ℱ avg =99.93%. All of the schematics, firmware, and software are open-source.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Trabecula: A Random Generator of Computational Phantoms for Bone Marrow Dosimetry

This study was motivated by the efforts on evaluation of radiation risk for leukemia incidence in the Techa River Cohort, where the main bone marrow dose contributors were 89,90Sr (bone-seeking beta emitters). Energy deposition in bone marrow targets was evaluated by simulating radiation particle transport using computational phantoms. The present paper describes the computer program “Trabecula” implementing an algorithm for parametric generation of computational phantoms, which serve as the basis for calculating bone marrow doses. “Trabecula” is a user-friendly tool that automatically converts analytical models into voxelized representations that are directly compatible as input to MCNP.

Shishkina, Elena A.↗
DOE OSTI2026

PowerMappeR: Power-Optimized Mapping of SNNs onto ReRAM Crossbars coupled via Packet-Switched NoCs

Many recent efforts in developing hardware-accelerated spiking neural networks (SNNs) are characterized by deep co-design between algorithms, architectures, and devices. Architectural advances overcome device constraints by coupling together many small resistive-RAM (ReRAM) crossbars via a network-on-chip (NoC) for neuromorphic component operation. Concurrently, improved SNN training methods increase accuracy and structural sparsity in networks despite growing problem sizes. Finally, compilers leverage these attributes to minimize area and inter-crossbar communication while mapping large SNNs to sophisticated architectures. However, for compiler-driven co-design to realize increasingly complex and profitable optimizations, a compile-time view of power consumption is critical. We present PowerMappeR to express and optimize over mapping-, architecture-, and device-specific power consumption information. By modeling the dynamic power of well-established components, we develop an integer linear programming (ILP)-based, encoding-agnostic, parametric power estimation model. Using this model, we demonstrate practical improvements in area and inter-crossbar communication by 0%–9.5% and 1.4%–5.1%, respectively. We also limit hotspot formation during optimization, achieving comparable or better results in targeted metrics with up to 96.4%–97.1% restriction of hotspot magnitude. Finally, we introduce profile-guided formulations to reduce worst-case and expected-case hotspot magnitude by 40.7%–69.5% and 40.6%–56.3%, respectively. Optimizing worst-case hotspot magnitude incidentally improves expected-case magnitude by 10.85%–33.45%. Reciprocally, optimizing expected-case magnitude incidentally improves worst-case magnitude by 4.33%–39.87%. Validation against hardware simulators confirms that PowerMappeR can decrease dynamic power consumption by 12.6%–27.3%.

Pohl, Devin [ORNL] (ORCID:0009000040149027)↗