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 271 records · Page 15

Alchemy: A Model-Based Approach for 2D to 3D Autonomous Nuclear System Design

Engineering design of nuclear power plant (NPP) piping and equipment systems frequently bypasses crucial 2D system planning, instead moving straight to 3D modeling. This often leads to designs that exceed building envelope constraints, forcing expensive and time-consuming redesigns. When 2D modeling is employed, it typically involves labor-intensive manual workflows that convert 2D drawings into 3D models, resulting in inefficiencies and errors across design iterations. These workflows further suffer from poor software interoperability and dependence on proprietary software ecosystems, thereby contributing to schedule delays and cost overruns. This paper presents Alchemy, an autonomous framework that transforms 2D system definitions into Industry Foundation Classes (IFC)-compliant 3D building information models (BIMs) for expediting nuclear facility design at the conceptual preliminary phase. Using a model-based approach, the framework treats the 2D system diagram as the central reference model employed to automatically generate all subsequent outputs, ensuring consistency between the system definition and the resulting physical design. A web-based interface enables engineers to define hierarchical system topologies including associated equipment, geometric properties, and connectivity requirements. A two-phase equipment layout optimization algorithm automatically computes collision-free spatial configurations within predefined building envelopes. An artificial intelligence (AI)-assisted pipe routing module then generates orthogonal, collision-free routing paths, allowing the user to select either an A* search-based method or an Ant Colony Optimization (ACO)-based method. All outputs are authored natively in IFC format, relying on open-source technologies and standardized formats in order to ensure extensibility and eliminate proprietary software dependencies. The proposed framework is validated on two representative pressurized-water reactor (PWR)-based case studies, for which it autonomously generates IFC-compliant 3D models in minutes, drastically reducing workflows that typically require hours of manual effort. The generated model demonstrates topologically correct equipment placement, physically plausible spatial relationships, and collision-free pipe routing consistent with known PWR loop configurations. This work represents a foundational step toward digital engineering for nuclear facility preliminary design, with future ongoing development targeting design code compliance and expanded system complexity.

97 - MATHEMATICS AND COMPUTING↗

Dissimilar Material Joining via Interlocking Metasurfaces

Background The integration of dissimilar materials poses a significant challenge in engineering, necessitating innovative solutions for robust and reliable joining. Interlocking metasurfaces (ILMs) are a new joining technology comprising arrays of autogenous features patterned across two surfaces that interlock to form robust structural joints. Objective Here, this study elucidates the factors influencing the tensile performance of ILM joints formed between dissimilar materials. Methods We employed parametric optimization to identify optimal unit cell geometries for maximal yield strength based on the hypothesis that the elastic tensile properties of the materials are the primary determinants of tensile performance. Experimental validation was performed by mechanically testing the theorized optimal ILM geometry and a range of ILM geometries to capture the overall behavior trends of joints between two additively manufactured polymers, VeroPureWhite (VW) and RGDA8430-DM (8430). Results Experimental validation of optimized designs revealed that additional factors, e.g. flexural strength and localized plasticity, also strongly influenced the tensile performance of T-slot ILMs joining dissimilar materials. The proposed optimal design remained the best performer. Conclusions This study demonstrates the viability of ILMs as a joining method for dissimilar materials. ILMs can join dissimilar materials with no loss in joint yield strength compared to joints composed solely of the weaker of the two constitutive materials. ILMs demonstrated their potential as a versatile and effective joining technology in diverse engineering applications.

Elbrecht, Benjamin James [Sandia National Laborato↗

Designing the Protocols for Programmable Ammonia Catalysis

Programmable catalysis can provide a more energy-efficient and cost-effective route to enhancing commercial ammonia production, a key process in the advancement of renewable energy technologies and the manufacture of fertilizers and basic chemicals. This work explores the computational discovery of optimal forcing protocols to drive such dynamic catalysis models. By employing matrix-free time-stepper methods, coupled with an optimization approach, that integrates Bayesian optimization with a Bayesian continuation strategy to efficiently discover the periodic steady states of such periodically forced systems, we enable the discovery of complex optimal catalyst strain waveforms, while ensuring robust solver convergence. We demonstrate the flexibility of our approach to discover optimized forcing protocols under varying physical constraints on strain modulation or other catalyst operating parameters. We show that these can have a temporal structure more complex than simple step functions. In order to detect undesirable catalytic loops that may correlate with overall reduced performance, we perform a study using graph-theoretical analysis to investigate the dynamics of catalytic kinetic networks formed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗

Analysis of semivolatile organics in liquid radioactive residue using sorptive stir bar and solvent back-extraction

Current methods for semivolatiles analysis in radioactive samples can produce large volumes of radioactive solvent residue. A method utilizing stir-bar sorptive extraction has been explored in this work for its applicability to radioactive waste samples. This low solvent analytical method may accelerate remediation, minimize hazardous solvent waste, and reduce exposure risk to workers. Organic compounds (polyaromatic hydrocarbons, chlorinated aromatics, and phenolic compounds) were chosen as surrogates for common Liquid Waste System (LWS) contaminants at Savannah River Site (Aiken, SC). Stir-bar extraction parameters (extraction time, matrix modification, and effective pH range) and solvent back extraction parameters (solvent type, volume, and extraction time) were optimized experimentally for the chosen compounds. Affinity of the stir-bar extraction polymer to radionuclides Cs-137 and Am-241 was observed to determine radionuclide concentration effects. The stir-bar method achieved mean recovery of 100 ± 0.7% (1σ), relative to 114 ± 7% using solvent extraction, while reducing weekly method hands-on time by 93.4% and solvent volume consumption by 99.3%. Sensitivity was improved by 378% in simulated tank waste and 278% in real-world LWS matrix, relative to solvent extraction. This work has produced a safe and optimized method for the low solvent analysis of organics in legacy radioactive tank waste by stir-bar sorptive extraction.

GC-MS↗

A Quantum Mechanical MP2 Study of the Electronic Effect of Nonplanarity on the Carbon Pyramidalization of Fullerene C 60

Among C 60 ’s diverse functionalities, its potential application in CO 2 sequestration has gained increasing interest. However, the processes involved are sensitive to the molecule’s electronic structure, aspects of which remain debated and require greater precision. To address this, we performed structural optimization of fullerene C 60 using the QM MP2/6–31G* method. The nonplanarity of the optimized icosahedron is characterized by two types of dihedral angles: 138° and 143°. The 120 dihedrals of 138° occur between two hexagons intersecting at C–C bonds of 1.42 Å, while the 60 dihedrals of 143° are observed between hexagons and pentagons at C–C bonds of 1.47 Å. NBO analysis reveals less pyramidal sp 1.78 hybridization for carbons at the 1.42 Å bonds and more pyramidal sp 2.13 hybridization for the 1.47 Å bonds. Electrostatic potential charges range from -0.04 a.u. to 0.04 a.u. on the carbon atoms. Second-order perturbation analysis indicates that delocalization interactions in the C–C bonds of 1.42 Å (143.70 kcal/mol) and 1.47 Å (34.98 kcal/mol) are 22% and 38% higher, respectively, than those in benzene. MP2/Def2SVP calculations yield a correlation energy of 13.49 kcal/mol per electron for C 60 , slightly higher than the 11.68 kcal/mol for benzene. However, the results from HOMO-LUMO calculations should be interpreted with caution. This study may assist in the rational design of fullerene C 60 derivatives for CO 2 reduction systems.

36 MATERIALS SCIENCE↗

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗

A large-scale benchmarking of deterministic and stochastic derivative-free optimization algorithms

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗

Algorithm-guided experimentation for autonomous AI systems in self-driving laboratories

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗

A safe reinforcement learning algorithm for supervisory control of power plants

Traditional control theory-based methods require tailored engineering for each system and constant fine-tuning. In power plant control, one often needs to obtain a precise representation of the system dynamics and carefully design the control scheme accordingly. Model-free Reinforcement learning (RL) has emerged as a promising solution for control tasks due to its ability to learn from trial-and-error interactions with the environment. It eliminates the need for explicitly modeling the environment’s dynamics, which is potentially inaccurate. However, the direct imposition of state constraints in power plant control raises challenges for standard RL methods. To address this, we propose a chance-constrained RL algorithm based on Proximal Policy Optimization for supervisory control. Our method employs Lagrangian relaxation to convert the constrained optimization problem into an unconstrained objective, where trainable Lagrange multipliers enforce the state constraints. In conclusion, our approach achieves the smallest distance of violation and violation rate in a load-follow maneuver for an advanced Nuclear Power Plant design.

constrained optimization↗

SANE: strategic autonomous non-smooth exploration for multiple optima discovery in multi-modal and non-differentiable black-box functions

Both computational and experimental material discovery bring forth the challenge of exploring multidimensional and multimodal parameter spaces, such as phase diagrams of Hamiltonians with multiple interactions, composition spaces of combinatorial libraries, material structure image spaces, and molecular embedding spaces. Often these systems are black-boxes and time-consuming to evaluate, which resulted in strong interest towards active learning methods such as Bayesian optimization (BO). However, these systems are often noisy which make the black box function severely multi-modal and non-differentiable, where a vanilla BO can get overly focused near a single or faux optimum, deviating from the broader goal of scientific discovery. To address these limitations, here we developed Strategic Autonomous Non-Smooth Exploration (SANE) to facilitate an intelligent Bayesian optimized navigation with a proposed cost-driven probabilistic acquisition function to find multiple global and local optimal regions, avoiding the tendency to becoming trapped in a single optimum. To distinguish between a true and false optimal region due to noisy experimental measurements, a human (domain) knowledge driven dynamic surrogate gate is integrated with SANE. We implemented the gate-SANE into pre-acquired piezoresponse spectroscopy data of a ferroelectric combinatorial library with high noise levels in specific regions, and piezoresponse force microscopy (PFM) hyperspectral data. SANE demonstrated better performance than classical BO to facilitate the exploration of multiple optimal regions and thereby prioritized learning with higher coverage of scientific values in autonomous experiments. Our work showcases the potential application of this method to real-world experiments, where such combined strategic and human intervening approaches can be critical to unlocking new discoveries in autonomous research.

Biswas, Arpan [University of Tennessee, Knoxville,↗

Optimized Tandem Catalyst Patterning for CO 2 Reduction Flow Reactors

Tandem catalysis involves two or more catalysts arranged in proximity within a single reaction vessel, with the aim of synergistically aligning the catalysts’ reaction pathways to maximize overall system performance. This study presents a proof of concept showing the integration of continuum transport modeling with design optimization in a simplified two-dimensional flow reactor setup for electrochemical CO 2 reduction. Ag catalysts provide the CO 2 ⟶ CO reaction capability, and Cu catalysts provide the CO ⟶ high-value products reaction capability. Given a set of input parameters, the optimization algorithm uses adjoint methods to modify the Ag/Cu surface patterning in order to maximize the current density toward high-value products, such as ethylene. The optimized designs yield significant performance enhancement especially at more negative applied voltages (i.e., stronger surface reactions) and for larger numbers of patterning sections. For an applied voltage of −1.7 V vs. SHE, the 12-section optimized design increases the current density toward ethylene by up to 65% compared to the unoptimized 2-section design. For the optimized cases, observed differences in the production and consumption of CO (the key intermediate species) and minimized zones of low CO reactant surface concentration on Cu sections explain the improved reactor performance.

CO2 reduction↗

Generating Euler Diagrams Through Combinatorial Optimization

Abstract Can a given set system be drawn as an Euler diagram? We present the first method that correctly decides this question for arbitrary set systems if the Euler diagram is required to represent each set with a single connected region. If the answer is yes, our method constructs an Euler diagram. If the answer is no, our method yields an Euler diagram for a simplified version of the set system, where a minimum number of set elements have been removed. Further, we integrate known wellformedness criteria for Euler diagrams as additional optimization objectives into our method. Our focus lies on the computation of a planar graph that is embedded in the plane to serve as the dual graph of the Euler diagram. Since even a basic version of this problem is known to be NP‐hard, we choose an approach based on integer linear programming (ILP), which allows us to compute optimal solutions with existing mathematical solvers. For this, we draw upon previous research on computing planar supports of hypergraphs and adapt existing ILP building blocks for contiguity‐constrained spatial unit allocation and the maximum planar subgraph problem. To generate Euler diagrams for large set systems, for which the proposed simplification through element removal becomes indispensable, we also present an efficient heuristic. We report on experiments with data from MovieDB and Twitter. Over all examples, including 850 non‐trivial instances, our exact optimization method failed only for one set system to find a solution without removing a set element. However, with the removal of only a few set elements, the Euler diagrams can be substantially improved with respect to our wellformedness criteria.

Computer Science↗

Strategically designed metal-free deep-ultraviolet birefringent crystals with superior optical properties

Finding new birefringent materials with deep-ultraviolet (DUV, λ < 200 nm) transparency is urgent, as current commercial materials cannot meet the rapidly growing demands in related application fields. Herein, three guanidinium-based compounds, C(NH 2 ) 3 CH 3 SO 3 , β-C(NH 2 ) 3 Cl, and γ-C(NH 2 ) 3 Cl, all featuring [C(NH 2 ) 3 ·X] ∞ (X = CH 3 SO 3 and Cl) pseudo layers, were designed through structural motif tailoring. Theoretical calculations indicate that these metal-free compounds all possess broad bandgaps (6.49–6.71 eV, HSE06) and remarkable birefringence (cal. 0.166–0.211 @ 1064 nm). Centimeter-sized C(NH 2 ) 3 CH 3 SO 3 crystals have been grown using a feasible aqua-solution method. Subsequently, to further optimize the properties, β/γ-C(NH 2 ) 3 Cl was remolded by further tailoring the [C(NH 2 ) 3 ] + cationic unit and the acceptor Cl - anion, and then the fourth compound NH 2 COF was theoretically constructed. Interestingly, NH 2 COF exhibits the desired coexistence of a wider bandgap (7.87 eV, HSE06) and giant birefringence (cal. 0.241 @ 1064 nm) attributed to its higher density of well-aligned birefringence-active groups (BAGs). Furthermore, among these four designed compounds, C(NH 2 ) 3 CH 3 SO 3 has been experimentally synthesized and exhibits a short UV cutoff edge. Centimeter-sized crystals have been grown using a feasible aqueous solution method. This study provides an effective strategy to optimize the density of BAGs for large birefringence and offers valuable insights into the strategic design of metal-free DUV birefringent crystals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗

Determining the Minimum Phase‐to‐Phase Gap Distance for Unconventional Transmission Lines Using Numerical Method

With the increasing demand for power transmission, compact, high surge impedance loading (HSIL) high-voltage transmission lines have emerged as a viable solution due to their reduced land acquisition costs and higher power delivery capability. The compactness of a transmission line depends on effective insulation coordination, particularly in determining the phase-to-phase clearance, which is governed by the critical flashover voltage under switching and lightning overvoltage conditions. Traditional methods for phase-to-phase clearance rely on empirical formulas derived from experimental data, which are convenient for conventional high-voltage lines. However, unconventional HSIL lines require a faster and more adaptable evaluation method, as they involve optimized conductor positioning to reduce right-of-way requirements while enhancing natural power loadability. This study presents a simplified numerical approach to determine the minimum phase-to-phase gap, utilizing arc propagation viability curves, and offers an efficient alternative to conventional empirical methods. The proposed method was successfully applied to a 500 kV conventional line as well as 500 and 735 kV unconventional line designs, demonstrating its capability in accurately assessing insulation requirements. Results reveal that the method can support reduced gap clearances while still maintaining reliability, thereby validating its usefulness in optimizing compact transmission line configurations.

Arafat, Easir [The University of Texas at Dallas, ↗

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↗