Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization methods”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Dynamic beam shaping—Improving laser materials processing via feature synchronous energy coupling

Today, tailored laser beams are rarely used and thus an opportunity to optimize existing or introduce new processes is missed. New methods of dynamic beam shaping have the potential to change that in future. This keynote paper deals with methods allowing a transient energy input into the workpiece at such time scales that the underlying interaction processes are guided towards the desired result. It shows principles, categorizes necessary system technology, and gives application examples to familiarize the reader with the topic. It postulates that time-scale-dependent coupling between transient energy input and addressed process features is key for achieving the optimum.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees↗
DOE OSTI2024

Physics-informed machine learning to predict solvatochromic parameters of designer solvents with case studies in CO 2 and lignin dissolution

The polarity of solvents plays a critical role in various research applications, particularly in their solubilities. Polarity is conveniently characterized by the Kamlet-Taft parameters that is, the hydrogen bonding acidity (α), the basicity (β), and the polarizability (π*). Obtaining Kamlet-Taft parameters is very important for designer solvents, namely ionic liquids (ILs) and deep eutectic solvents (DESs). However, given the unlimited theoretical number of combinations of ionic pairs in ILs and hydrogen-bond donor/acceptor pairs in DESs, experimental determination of their Kamlet-Taft parameters is impractical. To address this, the present study developed two different machine learning (ML) algorithms to predict Kamlet-Taft parameters for designer solvents using quantum chemically derived input features. The ML models developed in the present study showed accurate predictions with high R 2 and low RMSE values. Further, in the context of present interest in the circular bioeconomy, the relationship between the basicities and acidities of designer solvents and their ability to dissolve lignin and carbon dioxide (CO 2 ) is discussed. Our method thus guides the design of effective solvents with optimal Kamlet-Taft parameter values dissolving and converting biomass and CO 2 into valuable chemicals.

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

An Antibody Cocktail-Based Immunoaffinity-LC-MS Method Enabled Ultra-Sensitive and Robust Quantification of Circulating Proinsulin Proteoforms and C-Peptide

Accurately measuring circulating proinsulin proteoforms is crucial for clinical investigation of diabetes, but was previously not feasible owing to limited assay specificity/sensitivity. Here, in this study, we devised a highly sensitive LC-MS-based strategy to quantify intact proinsulin, des-31,32 and des-64,65 proinsulin, and C-peptide in circulation. The method involves: (i) quantitative, robust affinity capture using an optimized antibody cocktail, eliminating the severe quantitative bias across multiple proteoforms typically introduced when using a single antibody; (ii) Lys-C digestion producing unique signature peptides for each proteoform, and (iii) trapping-nano-LC coupled with FAIMS/dCV-MS for an ultrasensitive analysis. The selective trapping/delivery ensured sensitive/selective analysis of the targets while achieving excellent analytical robustness that is critical for clinical assays, and the FAIMS/dCV substantially reduces baseline noise/interferences, further enhancing S/N. The assay achieved exceptional sensitivity, with serum LOQs of 1.7, 2.3, and 3.6 pg/mL respectively for intact-proinsulin, des-31,32 and des-64,65, representing the first assay capable of sensitively quantifying these major circulating proinsulin proteoforms. We applied this assay to 78 subjects, including autoantibody positive (n = 20) and new-onset type 1 diabetes (T1D, n = 19) with respective age/sex/BMI-matched controls, enabling the first accurate profiling of proinsulin proteoforms in clinical groups. The assay results demonstrated a clear separation of control and new-onset T1D groups that a parallel total-proinsulin ELISA assay fails to capture. Furthermore, distinct expression patterns in relative abundance ratios among proteoforms were observed across clinical groups. This assay may provide valuable insights into the β-cell functions and the onset/progression of diabetes and other associated conditions. Moreover, the strategy is broadly applicable to targeted measurement of other biomarker proteoforms.

Shen, Qingqing [University at Buffalo, NY (United ↗
DOE OSTI2025

Mic-hackathon 2024: hackathon on machine learning for electron and scanning probe microscopy

Microscopy is one of the primary sources of information on materials structure and functionality at the nanometer and atomic scales. The data generated through microscopy is often contained in well-structured datasets, enriched with extensive metadata and sample histories, although not always with the same level of detail or storage format. The broad incorporation of data management plans by major funding agencies ensures the preservation and accessibility of this data. However, deriving insights from these rich datasets remains challenging due to the lack of established code ecosystems, standardized benchmarks, and integration strategies. Correspondingly, the efficiency of data usage is very low, and time expenditures at the analysis stage are enormous. In addition to post-acquisition data analysis, the emergence of application programming interfaces by major microscope manufacturers now creates opportunities for real-time ML-based data analytics to enable automated decision making, and particularly ML-agent controlled real-time microscope operation. Despite these opportunities, there is a significant gap in integrating the ML community with the broader microscopy community, limiting the value that these methods bring to physics and materials discovery and materials optimization. Hackathons address these challenges by fostering collaboration between ML experts and microscopy professionals, encouraging the development of innovative solutions that leverage ML for microscopy and preparing the workforce of the future both for microscopy-intensive domains areas, instrument manufacturers, and ML scientists interested in real world applications for fundamental research, materials optimization, and manufacturing. The hackathon generated benchmark datasets and digital twins of microscopes that further contribute to the development of the field and establish data analysis ecosystems. All the codes can be found at GitHub(https://github.com/KalininGroup/Mic-hackathon-2024-codes-publication/tree/1.0.0.1) and Zenodo (https://zenodo.org/records/15579940).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Non-Hermitian Quantum Mechanics Approach for Extracting and Emulating Continuum Physics Based on Bound-State-like Calculations

Here, this Letter introduces a unified emulation framework for studying continuum physics in finite quantum systems. Using a reduced basis method, we construct powerful emulators for the inhomogeneous Schrödinger equation that operate in a combined parameter space of complex energy (𝐸) and other inputs (𝜽). Within the space, the emulators simultaneously perform analytical continuation in 𝐸—extracting continuum physics from numerically simpler bound-state-like calculations—and interpolate this entire process across 𝜽. This yields a small, non-Hermitian system whose properties (e.g., resonances and scattering observables) can be rapidly predicted for any 𝜽. Crucially, the complex-𝐸 emulation provides a pathway to compute continuum observables for complex systems where advanced bound-state methods exist but direct continuum calculations are yet to be developed, while the 𝜽 emulation enables rapid parameter-space exploration and can be adapted to accelerate other existing continuum calculations. Demonstrations with two- and three-body systems highlight the method’s effectiveness and suggest its connection to (near-)optimal rational approximation. This Letter presents the key results, with further details reserved for a companion paper.

ab initio calculations↗
DOE OSTI2025

HPC Digital Twins for Evaluating Scheduling Policies, Incentive Structures and their Impact on Power and Cooling

Schedulers are critical for optimal resource utilization in high-performance computing. Traditional methods to evaluate sched- ulers are limited to post-deployment analysis, or simulators, which do not model associated infrastructure. In this work, we present the first-of-its-kind integration of scheduling and digital twins in HPC. This enables what-if studies to understand the impact of parameter configurations and scheduling decisions on the physical assets, even before deployment, or regarching changes not easily realizable in production. We (1) provide the first digital twin framework extended with scheduling capabilities, (2) integrate various top-tier HPC systems given their publicly available datasets, (3) implement extensions to integrate external scheduling simulators. Finally, we show how to (4) implement and evaluate incentive structures, as- well-as (5) evaluate machine learning based scheduling, in such novel digital-twin based meta-framework to prototype scheduling. Our work enables what-if scenarios of HPC systems to evaluate sustainability, and the impact on the simulated system.

Maiterth, Matthias [ORNL] (ORCID:000000018698460X)↗
DOE OSTI2024

Improved Earthquake Source Parameters with 3D Wavespeed Models in California and Nevada

Seismic tomography harnesses earthquake data to explore the inaccessible structure of the Earth. Adjoint waveform tomography (AWT), a method of seismic tomography, updates the tomographic model by optimizing the fit between observed earthquake data and synthetic waveforms. The synthetic data are calculated by solving the wave equation through a given 3D model. An important requirement to calculating synthetics is the source information (location, centroid time, depth, and moment tensor). Errors in source information affect the quality of the synthetics produced, which in turn can limit how structure can be inferred in the AWT workflow. Here, to test the effect of updating source information, we used MTTime (Chiang, 2020), a time-domain full-waveform moment tensor inversion code, to calculate the moment tensors and depths of 118 earthquakes that occurred in California and Nevada over a 20-yr period. We calculated 3D Green’s functions using a 3D seismic wavespeed model of California and Nevada (Doody et al., 2023b). We show that the inverted solutions provide better waveform fits than the Global Centroid Moment Tensor catalog and increase usable, well-correlated data by up to 7%. Therefore, we argue that recalculating source parameters should be considered in AWT workflows, particularly for smaller magnitude events (⁠M w > 5.0).

58 GEOSCIENCES↗
DOE OSTI2024

Efficient green and yellow light-emitting diodes (LEDs) for solid-state lighting applications

In this project, Lumileds, the University of Michigan, the University of New Mexico, Sandia National Laboratories, and Ohio State University conducted a collaborative and comprehensive research effort to investigate the most promising approaches to improve green and yellow InGaN LEDs. Advanced LED characterization methods and predictive model calculations were applied to design optimization experiments more effectively and accelerate the pace of improvements.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Autonomous Flow Electrochemistry for Accelerated Catalyst Discovery

Our objective is to develop an Autonomous Chemical Experimentation (ACE) platform that accelerates discovery of new catalytic transformations and other energy-relevant chemical reactions and processes. We intentionally designed ACE to be highly modular, both with respect to its rapid deployment to different chemistries and experimental workflows as well as incorporation of a wide range of different AI algorithms. In addition to the development of the core software architecture, initial efforts were made to incorporate Large Language Models to provide human-interpretable reasoning of the optimizer’s actions, and to develop a user-friendly graphical interface for experimental researchers. ACE was demonstrated using a flow electrocatalysis platform containing an inline FTIR spectrometer for real-time analysis and quantification of the reaction outcome. Human-in-the-loop experiments were performed in which a human researcher conducted an experiment using electrode potentials suggested by ACE, then fed the spectral data back to ACE for decision making. After confirming the successful function of the optimizer, efforts were next directed to automation of the hardware and performed full autonomy tests using three reactions: catalytic oxidation of formate, catalytic oxidation of cyclohexanol, and oxidation of hydroquinone. These studies confirm that ACE can close the loop between reaction execution, analysis, and optimization. They also reveal that more improved product detection methods will be essential for ACE to make well-informed decisions for reactions with low conversions.

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

High-Throughput Characterization Tools/Algorithms To Outline Porosity Variability in AM Samples as a Function of Processing Conditions

This report documents the development and deployment of advanced algorithms and tools that enable high-throughput characterization for metal additive manufacturing (AM), with a particular focus on process parameter optimization and material/part qualification for nuclear applications. While the method ologies presented support diverse characterization techniques, the majority of the work is centered on AI-driven algorithms for X-ray computed tomography (XCT) to accelerate defect detection and materials analysis at scale.

36 MATERIALS SCIENCE↗
DOE OSTI2024

SimPoint++: Less Simulation Points

We propose SimPoint++, which replaces the BIC method by combining WCSS and Silhouette to find the optimal cluster. The new Python framework of SimPoint++ provides a dimension reduction pipeline for effective clustering and supports multi-thread application analysis. We evaluate SimPoint++ with Spec CPU 2017 benchmarks. SimPoint++ achieves comparable or higher accuracy with significantly fewer simulation points, resulting in a 5x speed-up in simulation time compared to state-of-the-art solutions.

Chen, Si↗
DOE OSTI2025

An iterative CMB lensing estimator minimizing instrumental noise bias

Noise maps from cosmic microwave background (CMB) experiments are generally statistically anisotropic, due to scanning strategies, atmospheric conditions, or instrumental effects. Any mismodeling of this complex noise can bias the reconstruction of the lensing potential and the measurement of the lensing power spectrum from the observed CMB maps. We introduce a new CMB lensing estimator based on the maximum (MAP) reconstruction that is minimally sensitive to these instrumental noise biases. By modifying the likelihood to rely exclusively on correlations between CMB map splits with independent noise realizations, we minimize autocorrelations that contribute to biases. In the regime of many independent splits, this maximum closely approximates the optimal MAP reconstruction of the lensing potential. In simulations, we demonstrate that this method is able to determine lensing observables that are immune to any noise mismodeling with a negligible cost in signal-to-noise ratio. Our estimator enables unbiased and nearly optimal lensing reconstruction for next-generation CMB surveys.

Legrand, Louis [University of Cambridge (United Ki↗
DOE OSTI2025

Gaussian integral method for void fraction

Here, a novel method, the Gaussian Integral Method (GIM), is presented for calculating void fractions in Computational Fluid Dynamics–Discrete Element Method (CFD-DEM) simulations. GIM is versatile and applicable to various grid types, including structured and unstructured polyhedral meshes, without requiring special boundary treatments. An optimization technique is introduced to make GIM independent of grid resolution and type. The method is validated against experimental data from a fluidized bed, demonstrating that GIM produces realistic simulations closely resembling experimental observations. Additionally, unstructured polyhedral grids using GIM outperform structured grids of equivalent resolution, yielding results more aligned with experimental data. The gradient of the void fraction is computed in the CFD solver and utilized in the DEM solver for precise estimation at particle locations. Overall, GIM provides an effective solution for void fraction calculations in particulate media simulations with complex geometries, enhancing the accuracy and applicability of CFD-DEM simulations for industrial processes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Reinforcement Learning for Energy-Movement Optimization in Arduino-Based Robotics

Our goal is to develop a learning method for an Arduino-based robotthat maximizes travel distance and minimizes energy expenditure. • Will implement State ActionReward State Action (SARSA) reinforcement learning algorithm • Learning steps informed by state of environment • Rewards good decisions and punishes bad ones.

Gilmore, Blake↗
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

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗