Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributionally 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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

AADL: Anderson Accelerated Deep Learning

We propose a stable, distributed approach to perform AA that accelerates the convergence rate of stochastic first-order optimizers to train neural networks. Differently from previous works, we do not alter neither the scheme to perform AA nor the loss function minimized during the training. To improve robustness against stagnation, we customize general guidelines that suggest to relax the frequency of AA corrections by performing AA only at the end of an entire training epoch. To improve robustness of AA against the stochastic oscillations of first-order optimizers, we average the gradients computed on consecutive stochastic optimization updates. The improved regularity of the converging sequence and the reduced amplitude of stochastic oscillations across consecutive optimization steps allows AA to efficiently extrapolate an improved converging sequence, thereby overcoming limitations of existing approaches to perform AA on stochastic optimization.

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗
NASA NTRS1993

Time-dependent grid adaptation for meshes of triangles and tetrahedra

This paper presents in viewgraph form a method of optimizing grid generation for unsteady CFD flow calculations that distributes the numerical error evenly throughout the mesh. Adaptive meshing is used to locally enrich in regions of relatively large errors and to locally coarsen in regions of relatively small errors. The enrichment/coarsening procedures are robust for isotropic cells; however, enrichment of high aspect ratio cells may fail near boundary surfaces with relatively large curvature. The enrichment indicator worked well for the cases shown, but in general requires user supervision for a more efficient solution.

Russ D Rausch↗
DOE OSTI2023

Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

In “Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition,” we review the state of the art in practical algorithms for scheduling power-systems operations in the short term and the results of the recent competition organized by the U.S. Advanced Research Projects Agency–Energy. We explain the mixed-integer nonlinear formulation used in the competition for nonspecialists in electrical engineering, the context and organization of the competition, and the performance of competitors. We find that the collective approaches and results of competitors provide support for efforts to move nonlinear optimization techniques into industrial applications, as they have proven to be a robust and efficient alternative to current linear approximation techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Programming approaches for scalability, performance, and portability of combustion physics codes

Here, this paper presents the process, strategy, and results associated with porting a typical combustion physics flow solver to current state-of-the-art and future massively-parallel computer architectures. Major focus is placed on the distinct algorithmic structure of these types of codes and how it can be integrated with modern programming paradigms for heterogeneous platforms (i.e., distributed many-core systems with accelerators). An end-to-end case study is presented that exemplifies the process in a generic manner, which then serves as a clear guide with respect to the strategy and best practices leading to a robust and adaptable framework that performs well, is durable over time, is portable, and requires minimal human-effort. This end is accomplished beginning with the use of a mature, validated, structured, multiblock code framework optimized for application of both Large Eddy Simulation (LES) and Direct Numerical Simulation (DNS). This code has been ported to a variety of platforms over the past decade, including most recently the Oak Ridge Leadership Computing Facility’s “Summit” Platform. The experience gained on these multiple platforms provides general insights and thus the results presented are not specific to any one code or platform other than the overarching trend toward distributed many-core systems with accelerators in order to move toward exascale performance. The resultant performance and scalability of the ported code is demonstrated on a real-world application; a state-of-the-art rotating detonation rocket engine simulation that matches the complex geometry and boundary conditions imposed as part of a companion experimental campaign.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An Optimal Power Control Strategy for Grid-Following Inverters in a Synchronous Frame

This work proposes a power control strategy based on the linear quadratic regulator with optimal reference tracking (LQR-ORT) for a three-phase inverter-based generator (IBG) using an LCL filter. The use of an LQR-ORT controller increases robustness margins and reduces the quadratic value of the power error and control inputs during transient response. A model in a synchronous reference frame that integrates power sharing and voltage–current (V–I) dynamics is also proposed. This model allows for analyzing closed-loop eigenvalue location and robustness margins. The proposed controller was compared against a classical droop approach using proportional-resonant controllers for the inner loops. Mathematical analysis and hardware-in-the-loop (HIL) experiments under variations in the LCL filter components demonstrate fulfillment of robustness and performance bounds of the LQR-ORT controller. Experimental results demonstrate accuracy of the proposed model and the effectiveness of the LQR-ORT controller in improving transient response, robustness, and power decoupling.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Machine learning bridges local static structure with multiple properties in metallic glasses

A long-standing challenge in the metallic glass (MG) community has been how to quantitatively gauge the influence of the intricate local packing environment on the response (such as the propensity for atomic rearrangement) of the atomic configuration to external stimuli. Here we establish this structure–property relation by representing the complex amorphous structure using a single, flexibility-orientated structural quantity. This structural flexibility (SF) couples to a bona fide structural representation, the pair distribution function (PDF) of individual atoms, through a weighting function that reflects what matters in the static atomic configuration to dynamic responses. Machine learning is used, employing microscopic flexibility volume as the supervisory signal, to establish via direct regression an optimized weighting vector, which is proven robust for all quenching rates, deformation conditions, and different compositions in a given (e.g., Cu x Zr 100-x ) alloy system. Additionally, the SF is evaluated solely from the particle positions (PDF), for any structure variation, from the atomic scale up to sample average. Strong correlations are demonstrated between SF and a broad range of properties, including vibrational, diffusional, as well as elastic and plastic relaxation responses.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Distributed optimization for multi-commodity urban traffic control

A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.

Augmented Lagrangian↗
DOE OSTI2025

Methods for Carbon Mass Closure in Polyolefin Hydrocracking

Heterogeneous catalytic hydrocracking of polyolefins is a promising approach for the processing of postconsumer plastics, but product quantification methods remain inconsistent across the literature. In systems that generate a large fraction of vapor-phase products, typical product capture methods can result in large carbon balance deficits, exceeding 50%, compromising reported yields and selectivities. Here, we identify the major sources of product loss and develop enhanced capture methods to improve the quantification accuracy. Seven supplemental techniques were evaluated, targeting either increased vapor recovery (by increasing the volatility or system volume) or enhanced retention in the liquid phase (by decreasing volatility). Among these, a flow collection approach using a continuous helium sweep and downstream gas sampling bag capture yielded the highest recovery, achieving a 96 ± 9.2% carbon balance closure. We show that the efficacy of these methods is strongly dependent on product distribution. In general, solvent addition was most effective when condensable species dominate the product distribution, while flow collection was preferred when both condensable species and light gases are present in high concentrations. These results highlight the need for method-specific workup strategies and demonstrate that no single protocol is universally optimal. We provide general guidelines for selecting and implementing robust product capture techniques, enabling accurate yield and selectivity determinations in polyolefin hydrocracking systems.

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

Summer 2025 SULI: Nucleus ID, TinyTPC, and Scientific Communication

This paper summarizes my work during the Summer 2025 SULI internship, which focused on two main projects and broader scientific development. The first project involved improving the particle identification (PID) of protons, deuterons, and tritons using PIDA distributions and template fitting, with the goal of modeling nuclear final-state interactions (FSI) and testing the robustness of the method against systematic uncertainties. These techniques pave the way for future application to LArTPC data from the ICARUS detector. The second project centered on the optimization and data-taking of the TinyTPC detector, a compact LArTPC used for high-resolution low-energy measurements. I adjusted gain and threshold parameters, performed hardware validation tests, and developed analysis strategies to extract meaningful physics from collected data. Throughout the summer, I also enhanced my scientific communication and mentorship skills through presentations, collaborative analysis, and peer guidance.

McCright, Hannah [Maryland U.]↗
DOE OSTI2025

Self-consistent modeling of tokamak edge plasma transport with lithium sources

Magnetic confinement fusion devices require effective heat and particle exhaust solutions on the divertor plates to operate sustainably, especially under reactor-relevant conditions. Liquid lithium divertors have been proposed to address two major challenges: control of excessive heat flux to plasma-facing components through vapor shielding and minimization of core plasma contamination from impurities. The National Spherical Torus Experiment-Upgrade (NSTX-U) will explore lithium as a divertor material due to its potential to meet both objectives. We present a self-consistent coupling framework between the plasma boundary transport code UEDGE and the lithium wall transport code Wall–Li to evaluate the feasibility and operational limits of lithium-based divertors. The model aims to optimize lithium sourcing levels to prevent core plasma contamination via fuel dilution while ensuring divertor protection through vapor shielding. This integrated framework, applicable to any tokamak with lithium sources, dynamically adjusts lithium sourcing based on local plasma conditions and surface temperature. The coupled model is tested using NSTX-like geometry and plasma conditions to assess its performance and reliability. Wall–Li calculates lithium fluxes from plasma-facing components, incorporating physical sputtering, thermally enhanced sputtering, and evaporation driven by surface temperature and ion flux. These fluxes are reintroduced into UEDGE as neutral lithium atoms, enabling simulation of their transport and distribution within the plasma. UEDGE computes plasma and neutral transport, surface heat flux, and iteratively feeds this information back to Wall–Li. A small time step is employed to ensure numerical stability and convergence, enabling accurate simulations over typical tokamak discharge durations. This integrated modeling approach provides a robust tool for identifying operational regimes that balance effective lithium sourcing with minimal core plasma contamination, offering critical insights for optimizing lithium-based divertor systems in current and future fusion devices.

Magnetic confinement fusion↗
DOE OSTI2022

Minimizing Fraud in the Carbon Offset Market Using Blockchain Technologies

Fraud in the Environmental Benefit Credit (EBC) markets is pervasive. To make matters worse, the cost of creating EBCs is often higher than the market price. Consequently, a method to create, validate, and verify EBCs and their relevance is needed to mitigate fraud. The EBC market has focused on geologic (fossil fuel) CO 2 sequestration projects that are often over budget and behind schedule and has failed to capture the "lowest hanging fruit" EBCs - terrestrial sequestration via the agricultural industry. This project reviews a methodology to attain possibly the least costly EBCs by tracking the reduction of inputs required to grow crops. The use of bio- stimulant products, such as humate, allows a farmer to use less nitrogen without adversely affecting crop yield. Using less nitrogen qualifies for EBCs by reducing nitrous oxide emissions and nitrate runoff from a farmer's field. A blockchain that tracks the bio-stimulant material from source to application provides a link between a tangible (bio-stimulant commodity) and the associated intangible (EBCs) assets. Covert insertion of taggants in the bio-stimulant products creates a unique barcode that allows a product to be digitally tracked from beginning to end. This process (blockchain technology) is so robust, logical, and transparent that it will enhance the value of the associated EBCs by mitigating fraud. It provides a real time method for monetizing the benefits of the material. Substantial amounts of energy are required to produce, transport, and distribute agricultural inputs including fertilizer and water. Intelligent optimization of the use of agricultural inputs can drive meaningful cost savings. Tagging and verification of product application provides a valuable understanding of the dynamics in the water/food energy nexus, a major food security and sustainability issue. As technology in agriculture evolves so to must methods to verify the Enterprise Resource Planning (ERP) potential of innovative solutions. The technology reviewed provides the ability to combine blockchain and taggants ("taggant blockchains") as the engine by which to (1) mitigate fraudulent carbon credits; (2) improve food chain security, and (3) monitor and manage sustainability. The verification of product quality and application is a requirement to validate benefits. Recent upgrades to humic and fulvic quality protocols known as ISO CD 19822 TC134 offers an analytical procedure. This work has been assisted by the Humic Products Trade Association and International Humic Substance Society. In addition, providing proof of application of these products and verification of the correct application of prescriptive humic and bio-stimulant products is required. Individual sources of humate have unique and verifiable characteristics. Additionally, methods for prescription of site- specific agricultural inputs in agricultural fields are available. (See US Patents 734867B2, US 90658633B2.) Finally, a method to assure application rate is required through the use of taggants. Sensors using organic solid to liquid phase change nanoparticles of various types and melting temperatures added to the naturally occurring materials provide a barcode. Over 100 types of nanoparticles exist ensuring numerous possible barcodes to reduce industry fraud. Taggant materials can be collected from soil samples of plant material to validate a blockchain of humic, fulvic and other soil amendment products. Other non-organic materials are also available as taggants; however, the organic tags are biodegradable and safe in the environment allowing for use during differing application timeliness.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Computing the Properties of Matter with Leadership Computing Resources (Closeout Report for DE-SC0018121)

In order to add more capabilities to Halide, we have designed a new framework called Tiramisu and integrated this framework into Halide. Since Tiramisu enables Halide to target heterogeneous architectures, our development efforts have been refocused on Tiramisu. Most high-performance computer systems today are complex and increasingly heterogeneous; they may have CPUs, GPUs and FPGAs. Achieving best performance requires taking full advantage of all these different architectures. To address this issue, we have designed Tiramisu, an optimization framework that enables Halide (and other DSLs) to target heterogeneous architectures. Tiramisu is an optimization framework that takes as input a high level, architecture-independent representation of code and a set of scheduling and data mapping commands that guide code transformation. The input can either be generated by a domain-specific language (DSL) compiler such as Halide or directly written by a programmer. Tiramisu then applies the user-specified code and data-layout transformations and generates an architecture-specific, low-level intermediate representation (IR) that takes advantage of modern architectural features such as multicore parallelism, non-uniform memory (NUMA) hierarchies, clusters, and accelerators like GPUs and FPGAs. We integrated Tiramisu within Halide and implemented a representative set of benchmarks to evaluate this integration. Tiramisu is now open source and is available for public use (http://tiramisu-compiler.org/). A paper about Tiramisu was published, it shows that Tiramisu extends Halide with many new capabilities and that Tiramisu can generate efficient code for multicores, GPUs, FPGAs and distributed heterogeneous systems. The performance of code generated by the Tiramisu backends matches or exceeds hand optimized reference implementations. For example, the multicore backend matches the highly optimized Intel MKL library on many kernels and shows speedups reaching 4x over the original Halide. In addition to making Tiramisu more robust, we have used Tiramisu to implement a set of representative tensor operation for constructing baryon building blocks required for multi baryon contractions in LQCD. In order to implement this code, we needed to generalize Tiramisu in two ways: first we needed to support indirect array accesses, and second, we needed to add support for complex numbers to Tiramisu. The code generated by Tiramisu is 6x faster than the reference code. Our efforts towards an MPI based multi-node version of tiramisu have matured and the resulting code scales well on multiple nodes (tests up to 512 KNL nodes have been undertaken).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Primordial non-Gaussianity from the completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey II: measurements in Fourier space with optimal weights

ABSTRACT We present measurements of the local primordial non-Gaussianity parameter $f_{\mathrm{NL}}^\mathrm{local} $from the clustering of 343 708 quasars with redshifts 0.8 < z < 2.2 distributed over 4808 deg2 from the final data release (DR16) of the extended Baryon Acoustic Oscillation Spectroscopic Survey (eBOSS), the largest volume spectroscopic survey up to date. Our analysis is performed in Fourier space, using the power spectrum monopole at very large scales to constrain the scale-dependent halo bias. We demonstrate the robustness of our analysis pipeline with EZ-mock catalogues that simulate the eBOSS DR16 target selection. We carefully assess the impact of systematics on our measurement, exploiting a novel neural network scheme for cleaning the DR16 sample as well as test multiple contamination removal methods. We estimate the bias due to the overcorrection of the systematic removal to be sub-dominant compared to the statistical uncertainty. We find fNL = −12 ± 21 (68 per cent confidence) for the main clustering sample including quasars with redshifts between 0.8 and 2.2, after applying redshift weighting techniques, designed for non-Gaussianity measurement from large scales structure, to optimize our analysis, which improve our results by 37 per cent.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Robust Resilient Signal Reconstruction under Adversarial Attacks

We consider the problem of signal reconstruction for a system under sparse signal corruption by a malicious agent. The reconstruction problem follows the standard error coding problem that has been studied extensively in the literature. We include a new challenge of robust estimation of the attack support. The problem is then cast as a constrained optimization problem merging promising techniques in the area of deep learning and estimation theory. A pruning algorithm is developed to reduce the "false positive" uncertainty of data-driven attack localization results, thereby improving the probability of correct signal reconstruction. Sufficient conditions for the correct reconstruction and the associated reconstruction error bounds are obtained for both exact and inexact attack support estimation. Moreover, a simulation of a water distribution system is presented to validate the proposed techniques.

Robust, Signal reconstruction, Resilient estimator↗
NASA NTRS1986

Unified control/structure design and modeling research

To demonstrate the applicability of the control theory for distributed systems to large flexible space structures, research was focused on a model of a space antenna which consists of a rigid hub, flexible ribs, and a mesh reflecting surface. The space antenna model used is discussed along with the finite element approximation of the distributed model. The basic control problem is to design an optimal or near-optimal compensator to suppress the linear vibrations and rigid-body displacements of the structure. The application of an infinite dimensional Linear Quadratic Gaussian (LQG) control theory to flexible structure is discussed. Two basic approaches for robustness enhancement were investigated: loop transfer recovery and sensitivity optimization. A third approach synthesized from elements of these two basic approaches is currently under development. The control driven finite element approximation of flexible structures is discussed. Three sets of finite element basic vectors for computing functional control gains are compared. The possibility of constructing a finite element scheme to approximate the infinite dimensional Hamiltonian system directly, instead of indirectly is discussed.

Mingori, D. L.↗
DOE OSTI2023

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

MimicGAN: Robust Projection onto Image Manifolds with Corruption Mimicking

In the past few years, Generative Adversarial Networks (GANs) have dramatically advanced our ability to represent and parameterize high-dimensional, non-linear image manifolds. As a result, they have been widely adopted across a variety of applications, ranging from challenging inverse problems like image completion, to problems such as anomaly detection and adversarial defense. A recurring theme in many of these applications is the notion of projecting an image observation onto the manifold that is inferred by the generator. In this context, Projected Gradient Descent (PGD) has been the most popular approach, which essentially optimizes for a latent vector that minimizes the discrepancy between a generated image and the given observation. However, PGD is a brittle optimization technique that fails to identify the right projection (or latent vector) when the observation is corrupted, or perturbed even by a small amount. Such corruptions are common in the real world, for example images in the wild come with unknown crops, rotations, missing pixels, or other kinds of non-linear distributional shifts which break current encoding methods, rendering downstream applications unusable. To address this, we propose corruption mimicking—a new robust projection technique, that utilizes a surrogate network to approximate the unknown corruption directly at test time, without the need for additional supervision or data augmentation. The proposed method is significantly more robust than PGD and other competing methods under a wide variety of corruptions, thereby enabling a more effective use of GANs in real-world applications. Finally, more importantly, we show that our approach produces state-of-the-art performance in several GAN-based applications—anomaly detection, domain adaptation, and adversarial defense, that benefit from an accurate projection.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

A study of optimal abstract jamming strategies vs. noncoherent MFSK

The present investigation is concerned with the performance of uncoded MFSK modulation in the presence of arbitrary additive jamming, taking into account the objective to devise robust antijamming strategies. An abstract model is considered, giving attention to the signal strength as a nonnegative real number X, the employment of X as a random variable, its distribution function G(x), the transmitter's strategy G, the jamming noise as an M-dimensional random vector Z, and the error probability. A summary of previous work on the considered problem is provided, and the results of the current study are presented.

Mceliece, R. J.↗