Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Robust optimization”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

OPTIMIZATION OF A NUCLEAR VESSEL OUTLET FOR INCIDENT MONITORING

Classical nuclear core fluidic design techniques require improvement to better align with modern technological innovations. The US Department of Energy’s Office of Nuclear Energy (DOE-NE) Transformational Challenge Reactor (TCR) program is deploying additive manufacturing and advanced modeling and simulation to reimagine these designs. With the aid of modern computing power, computerized design optimization can be implemented to remove unwanted pressure drop while simultaneously optimizing flow structures, resulting in new opportunities to enable advanced instrumentation and monitoring capabilities.Previous development of geometric specifications for the TCR pressure vessel’s outlet plenum used design optimization to (1) limit pressure losses below 3.5 kPa (~0.5 psi) and (2) create a fluidic plane in which the temperature variation would not exceed ±5°C. This significant limit of the allowable pressure drop stems from the overarching goal of the TCR program to apply cutting edge techniques and unconventional thinking to demonstrate potential opportunities in additive manufacturing (AM).This paper expands the previous work by optimizing thermowell locations for robust measurements by explicitly modeling them and the resulting flow impacts. Additionally, a single core coolant channel was chosen to represent an event that causes an increased bulk flow temperature increase of 100°C.High fidelity unsteady Reynolds-averaged Navier-Stokes (URANS) simulations of the conjugate heat transfer problem were run in Siemen’s Star-CCM+ for this study. Next, the bulk flow temperature of a single coolant channel was increased by 100°C and was allowed to converge again. Finally, statistical analysis using a sequential probability ratio test (SPRT) was used to determine the elapsed time the thermocouples took to discover the increased bulk flow temperature.

See, Nate↗
DOE OSTI2022

Optimal Transport for Super Resolution Applied to Astronomy Imaging

Super resolution is an essential tool in optics, especially on interstellar scales, due to physical laws restricting possible imaging resolution. We propose using optimal transport and entropy for super resolution applications. We prove that the reconstruction is accurate when sparsity is known and noise or distortion is small enough. We prove that the optimizer is stable and robust to noise and perturbations. We compare this method to a state of the art convolutional neural network and get similar results for much less computational cost and greater methodological flexibility.

Rawson, Michael G.↗
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

Loss Landscape Analysis for Reliable Quantized ML Models for Scientific Sensing

In this paper, we propose a method to perform empirical analysis of the loss landscape of machine learning (ML) models. The method is applied to two ML models for scientific sensing, which necessitates quantization to be deployed and are subject to noise and perturbations due to experimental conditions. Our method allows assessing the robustness of ML models to such effects as a function of quantization precision and under different regularization techniques -- two crucial concerns that remained underexplored so far. By investigating the interplay between performance, efficiency, and robustness by means of loss landscape analysis, we both established a strong correlation between gently-shaped landscapes and robustness to input and weight perturbations and observed other intriguing and non-obvious phenomena. Our method allows a systematic exploration of such trade-offs a priori, i.e., without training and testing multiple models, leading to more efficient development workflows. This work also highlights the importance of incorporating robustness into the Pareto optimization of ML models, enabling more reliable and adaptive scientific sensing systems.

Baldi, Tommaso [Pisa, Scuola Normale Superiore]↗
DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗
DOE OSTI2022

A New Shape Optimization Approach for Lightweighting Electric Machines Inspired by Additive Manufacturing

Minimizing the mass in electric machines while maintaining superior performance is a new requirement for the advancement of drivetrains used in wind energy and electric mobility. Topology optimization (TO) for lightweighting electric machines using traditional approaches typically explores a restricted design space allowed by standard parametrizable geometry and manufacturing, while advanced methods, such as cell-based density approaches, suffer from a lack of robust manufacturability constraints during the optimization process. To overcome these drawbacks, we explore a grid-independent, boundary optimization where the outer shape of the magnet is parameterized using Bezier curves. We conduct a design of experiments (DOE) to study the effect of different magnet shapes on machine performance by varying the control points on the Bezier curves. A machine-learning-based surrogate model is constructed using the data from the DOE to quantify the relationship between the control points, air-gap torque, and mass. The control points are then optimized to maximize the torque density. The approach is used for minimizing electrical steel mass in the International Energy Agency (IEA) 15-MW radial flux direct-drive wind turbine generator. The new approach to shape optimization resulted in smooth and concise shapes that can be easily additively manufactured with up to a 20-ton reduction in electrical steel mass.

additive manufacturing↗
DOE OSTI2022

A Boundary Topology Optimization Approach for Lightweighting Electric Machines Inspired by Additive Manufacturing

Minimizing the mass in electric machines while maintaining superior performance has become a new requirement for the advancement of drivetrains used in wind energy and electric mobility. Topology optimization for light-weighting electric machines using traditional approaches typically explore a restricted design space allowed by standard parametrizable geometry and manufacturing, while advanced methods like cell-based density approaches suffer from a lack of robust manufacturability constraints during the optimization process. To overcome these drawbacks, we explore a grid-independent, boundary TO where the outer shape of the magnet is parameterized using Bezier curves. We conduct a design of experiments (DOE) to study the effect of different magnet shapes on machine performance by varying the control points on the Bezier curves. A machine-learning based surrogate model is constructed using the data from the DOE to quantify the relationship between the control points, air-gap torque and mass. The control points are then optimized to maximize the torque density. The approach is used for minimizing electrical steel mass in the IEA-15MW radial flux direct-drive wind turbine generator. The free-from boundary TO resulted in smooth and concise shapes that can be easily additively manufactured with upto 20-ton reduction in electrical steel mass.

additive manufacturing↗
DOE OSTI2022

A New Shape Optimization Approach for Lightweighting Electric Machines Inspired by Additive Manufacturing: Preprint

Minimizing the mass in electric machines while maintaining superior performance is a new requirement for the advancement of drivetrains used in wind energy and electric mobility. Topology optimization (TO) for lightweighting electric machines using traditional approaches typically explores a restricted design space allowed by standard parametrizable geometry and manufacturing, while advanced methods, such as cell-based density approaches, suffer from a lack of robust manufacturability constraints during the optimization process. To overcome these drawbacks, we explore a grid-independent, boundary TO where the outer shape of the magnet is parameterized using Bezier curves. We conduct a design of experiments (DOE) to study the effect of different magnet shapes on machine performance by varying the control points on the Bezier curves. A machine-learning-based surrogate model is constructed using the data from the DOE to quantify the relationship between the control points, air-gap torque, and mass. The control points are then optimized to maximize the torque density. The approach is used for minimizing electrical steel mass in the International Energy Agency (IEA) 15-MW radial flux direct-drive wind turbine generator. The free-form boundary TO resulted in smooth and concise shapes that can be easily additively manufactured with up to a 20-ton reduction in electrical steel mass.

additive manufacturing↗
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

Black-box optimization of CT acquisition and reconstruction parameters: a reinforcement learning approach

Protocol optimization is critical in Computed Tomography (CT) for achieving desired diagnostic image quality while minimizing radiation dose. Due to the inter-effect of influencing CT parameters, traditional optimization methods rely on the testing of exhaustive combinations of these parameters. This poses a notable limitation due to the impracticality of exhaustive parameter testing. This study introduces a novel methodology leveraging Virtual Imaging Trials (VITs) and reinforcement learning to more efficiently optimize CT protocols. Computational phantoms with liver lesions were imaged using a validated CT simulator and reconstructed with a novel CT reconstruction Toolkit. The optimization parameter space included tube voltage, tube current, reconstruction kernel, slice thickness, and pixel size. The optimization process was done using a Proximal Policy Optimization (PPO) agent which was trained to maximize the Detectability Index (d’) of the liver lesion for each reconstructed image. Results showed that our reinforcement learning approach found the absolute maximum d’ across the test cases while requiring 79.7% fewer steps compared to an exhaustive search, demonstrating both accuracy and computational efficiency, offering a efficient and robust framework for CT protocol optimization. The flexibility of the proposed technique allows for use of varying image quality metrics as the objective metric to maximize for. Our findings highlight the advantages of combining VIT and reinforcement learning for CT protocol management.

Fenwick, David [Duke University Medical Center]↗
DOE OSTI2023

Model Predictive Control for Urban Traffic Signals with Stability Guarantees

Traditional traffic signal control focuses more on the optimization aspects whereas the stability and robustness of the closed-loop system are less studied. This paper aims to establish the stability properties of traffic signal control systems through the analysis of a practical model predictive control (MPC) scheme, which models the traffic network with the conservation of vehicles based on a store-and forward model and attempts to balance the traffic densities. More precisely, this scheme guarantees the exponential stability of the closed-loop system under state and input constraints when the inflow is feasible and traffic demand can be fully accessed. Practical exponential stability is achieved in case of small uncertain traffic demand by a modification of the previous scheme. Simulation results of a small-scale traffic network validate the theoretical analysis.

ADVANCED PROPULSION SYSTEMS,MATHEMATICS AND COMPUT↗
DOE OSTI2021

Optimal design of acoustic metamaterial cloaks under uncertainty

In this work, we consider the problem of optimal design of an acoustic cloak under uncertainty and develop scalable approximation and optimization methods to solve this problem. The design variable is taken as an infinite-dimensional spatially-varying field that represents the material property, while an additive infinite-dimensional random field represents the variability of the material property or the manufacturing error. Discretization of this optimal design problem results in high-dimensional design variables and uncertain parameters. To solve this problem, we develop a computational approach based on a Taylor approximation and an approximate Newton method for optimization, which is based on a Hessian derived at the mean of the random field. We show our approach is scalable with respect to the dimension of both the design variables and uncertain parameters, in the sense that the necessary number of acoustic wave propagations is essentially independent of these dimensions, for numerical experiments with up to one million design variables and half a million uncertain parameters. Additionally, we demonstrate that, using our computational approach, an optimal design of the acoustic cloak that is robust to material uncertainty is achieved in a tractable manner. The optimal design under uncertainty problem is posed and solved for the classical circular obstacle surrounded by a ring-shaped cloaking region, subjected to both a single-direction single-frequency incident wave and multiple-direction multiple-frequency incident waves. Finally, we apply the method to a deterministic large-scale optimal cloaking problem with complex geometry, to demonstrate that the approximate Newton method’s Hessian computation is viable for large, complex problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗
DOE OSTI2023

A Distributionally Robust Resilience Enhancement Strategy for Distribution Networks Considering Decision-Dependent Contingencies

When performing the resilience enhancement for distribution networks, there are two obstacles to reliably model the uncertain contingencies: 1) decision-dependent uncertainty (DDU) due to various line hardening decisions, and 2) distributional ambiguity due to limited outage information during extreme weather events (EWEs). Here, to address these two challenges, this paper develops scenario-wise decision-dependent ambiguity sets (SWDD-ASs), where the DDU and distributional ambiguity inherent in EWE-induced contingencies are simultaneously captured for each possible EWE scenario. Then, a two-stage tri-level decision-dependent distributionally robust resilient enhancement (DD-DRRE) model is formulated, whose outputs include the optimal line hardening, distributed generation (DG) allocation, and proactive network reconfiguration strategy under the worst-case distributions in SWDD-ASs. Subsequently, the DD-DRRE model is equivalently recast to a mixed-integer linear programming (MILP)-based master problem and multiple scenario-wise subproblems, facilitating the adoption of a customized column-and-constraint generation (C&CG) algorithm. Finally, case studies demonstrate a remarkable improvement in the out-of-sample performance of our model, compared to its prevailing stochastic and robust counterparts. Moreover, the potential values of incorporating the ambiguity and distributional information are quantitatively estimated, providing a useful reference for planners with different budgets and risk-aversion levels.

decision-dependent uncertainty↗
DOE OSTI2020

Inverse Design of a Graphene-Based Quantum Transducer via Neuroevolution

Here we introduce an inverse design framework based on artificial neural networks, genetic algorithms, and tight-binding calculations, capable to optimize the very large configuration space of nanoelectronic devices. Our non-linear optimization procedure operates on trial Hamiltonians through superoperators controlling growth policies of regions of distinct doping. We demonstrate that our algorithm optimizes the doping of graphene-based three-terminal devices for valleytronics applications, monotonously converging to synthesizable devices with high merit functions in a few thousand evaluations (out of similar or equal to ≃ 2 3800 possible configurations). The best-performing device allowed for a terminal-specific separation of valley currents with similar or equal to ≃ 96% (≃ 94%) K(K') valley purity. Importantly, the devices found through our non-linear optimization procedure have both a higher merit function and higher robustness to defects than the ones obtained through geometry optimization.

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

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗