Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bounded objective function”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Predictions of the Nancy Grace Roman Space Telescope Galactic Exoplanet Survey. II. Free-floating Planet Detection Rates

The Nancy Grace Roman Space Telescope (Roman) will perform a Galactic Exoplanet Survey (RGES) to discover bound exoplanets with semimajor axes greater than 1 au using gravitational microlensing. Roman will even be sensitive to planetary-mass objects that are not gravitationally bound to any host star. Such free-floating planetary-mass objects (FFPs) will be detected as isolated microlensing events with timescales shorter than a few days. A measurement of the abundance and mass function of FFPs is a powerful diagnostic of the formation and evolution of planetary systems, as well as the physics of the formation of isolated objects via direct collapse. We show that Roman will be sensitive to FFP lenses that have masses from that of Mars (0.1 M {sub ⊕}) to gas giants (M ≳ 100 M {sub ⊕}) as isolated lensing events with timescales from a few hours to several tens of days, respectively. We investigate the impact of the detection criteria on the survey, especially in the presence of finite-source effects for low-mass lenses. The number of detections will depend on the abundance of such FFPs as a function of mass, which is at present poorly constrained. Assuming that FFPs follow the fiducial mass function of cold, bound planets adapted from Cassan et al., we estimate that Roman will detect ∼250 FFPs with masses down to that of Mars (including ∼60 with masses ≤ M {sub ⊕}). We also predict that Roman will improve the upper limits on FFP populations by at least an order of magnitude compared to currently existing constraints.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Submodular optimization problems and greedy strategies: A survey

The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How effective is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on performance bounds for the greedy strategy in submodular optimization problems. Specifically, we review performance bounds for the greedy strategy, more general and improved bounds in terms of curvature, performance bounds for the batched greedy strategy, and performance bounds for Nash equilibria.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Abstract for Joint Work Statement 5 (AGMT-1005) between National Energy Technology Laboratory (NETL) and ExxonMobil Research and Engineering Company (EMRE) to Umbrella CRADA (AGMT-0922)

NETL and EMRE will focus on fundamental questions aimed at understanding the controlling factors on tight oil production flow paths and how those flow paths are impacted by the hydraulic fracturing fluids and processes. Key questions for the Parties to explore include the following: Are there geochemical reactions between hydrocarbon producing tight reservoir rocks and water from the hydraulic fracturing process? To what extent does this alteration impact oil production? By further characterizing the flow paths near the fracture-matrix interface, what is the relative impact of geochemical process compared to geomechanical changes on production? This research focuses on rock types found in the Permian Basin. The research drives along two main thrusts: 1) Inorganic geochemistry studies involving representative rock types, connate fluids (hydrocarbons and water), and injected fluids (fracturing water) will be conducted in order to bound the kinetics of key mineral reactions; 2) Computed tomography (CT) for characterization of flow paths as a function of geochemical and geomechanical processes associated with hydraulic fracture creation and reservoir production. The objective of this characterization is to ultimately develop new insights into the role geochemical and geomechanical effects play on production. The work will include studying mechanical damage near the rock-fracture interface and how it impacts flow properties.

02 PETROLEUM↗
DOE OSTI2025

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗
DOE OSTI2022

Early Results from GLASS-JWST. VII. Evidence for Lensed, Gravitationally Bound Protoglobular Clusters at z = 4 in the Hubble Frontier Field A2744

We investigate the blue and optical rest-frame sizes (λ ≃ 2300–4000 Å) of three compact star-forming regions in a galaxy at z = 4 strongly lensed (×30, ×45, and ×100) by the Hubble Frontier Field galaxy cluster A2744 using GLASS-ERS James Webb Space Telescope (JWST)/NIRISS imaging at 1.15 μm, 1.50 μm, and 2.0 μm with a point-spread function ≲0$_{.}^{"}$1. In particular, the Balmer break is probed in detail for all multiply imaged sources of the system. With ages of a few tens of Myr, stellar masses in the range (0.7–4.0) ×10 6 M⊙ and optical/ultraviolet effective radii spanning the interval 3 < R eff < 20 pc, such objects are currently the highest-redshift (spectroscopically confirmed) gravitationally bound young massive star clusters (YMCs), with stellar mass surface densities resembling those of local globular clusters. Optical (4000 Å, JWST-based) and ultraviolet (1600 Å, Hubble Space Telescope–based) sizes are fully compatible. The contribution to the ultraviolet underlying continuum emission (1600 Å) is ~30%, which decreases by a factor of 2 in the optical for two of the YMCs (~4000 Å rest-frame), reflecting the young ages (<30 Myr) inferred from the spectral energy distribution fitting and supported by the presence of high-ionization lines secured with the Very Large Telescope/MUSE. Such bursty forming regions enhance the specific star formation rate of the galaxy, which is ≃10 Gyr –1 . This galaxy would be among the extreme analogs observed in the local universe having a high star formation rate surface density and a high occurrence of massive stellar clusters in formation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Bounding Radionuclide Release Estimates for a Hypothetical Power Reactor Accident

The object of this study is to provide an estimate of bounding radionuclide releases from a nuclear power plant accident. The time frame of interest is the release phase from the initiating event through 30 days. The maximum credible initiating event includes an initial failure of the containment function with a primary system leak. All estimates include a complete loss-of-onsite power and no successful mitigative actions. The active safety injection systems are also assumed failed. The review considers the following commonly deployed reactor designs in the following order of interest: RBMK 1000, VVER-440, VVER-1000, 1000 MWe PWR, 1000 MWe BWR, BN-800, and the 600 MWe CANDU/PHWR. The review also considers spent fuel pool accident scenarios.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Design of Mini-Plate-1 Irradiation Test for Qualification of High-Density, Low-Enriched U-10Mo Monolithic Fuel

The United States High Performance Research Reactor project is tasked with fuel development and qualification leading to conversion of higher power research and test reactors in the US from high-enriched uranium (HEU) to low-enriched uranium (LEU) fuels. Here, this manuscript identifies the functional and operational design requirements of the first miniature test plate (mini-plate [MP]) irradiation campaign (MP-1) of commercially fabricated LEU U-10Mo monolithic plate-type fuel and is the precursor to a large parametric mini-plate test (MP-2) aimed at producing the data to support regulatory qualification of the LEU U-10Mo monolithic fuel. The manuscript (1) provides a general description of the selected U-10Mo LEU fuel and (2) defines the overall experiment design and functional requirements to accomplish the specific test objective of MP-1, which is to confirm that the commercially manufactured LEU U-10Mo monolithic fuel meets the established requirements of geometric stability, mechanical integrity and stable and predictable behavior. The fuel testing parameters are established by the need to bound performance behavior within the operational envelope of the reactors being converted.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Equipment Qualification Report Environmental Qualification of GNB Absolyte Valve Regulated Lead Acid (VRLA) 1600 Ah100G33 Battery Rack Assembly (24590-QL-POA-EDB0-00001-11-00002_00A)

Greenberry Environmental Qualification Report 550001.001-35.0.5 provides basis for assignment of qualified life for: GNB Absolyte Valve Regulated Lead Acid (VRLA) 1600 Ah 100G33 Battery Rack Assembly in accordance with the requirements specified 24590-WTP-3PS-G000-T0015 (Rev 2) and Environmental Qualification Plan 550001.001-35.0.1 (Rev. 3). The equipment qualification basis represents the most conservative capability of the equipment. The analysis performed for the qualification is not less conservative than the bounding environmental conditions detailed in contract documents issued to Greenberry in contract 24509-QL-POA-EDB0-00001 Rev.0. The qualified life of 10 years has been established based upon an end-condition objective of the equipment condition indicators that correlate to the ability of equipment to perform its safety function. The VRLA Battery Cell Assembly was aged by 10 years (minimum) in accordance with conditions specified by Bechtel Equipment Qualification Datasheet 24590-LAW-EUQ-UPE 00003 Rev. 3 and the process conditions specified by the Instrument Data Sheet 24590-LAW EUD-UPE-00009 Rev. 2. Greenberry Industrial has contracted with GNB Industrial Battery Co located at 4115 S Zero St, Fort Smith, AR 72908 to perform age conditioning, monitoring, and capacity testing in accordance with Environmental Qualification Plan 550001.001-35.0.1 Rev. 1. The required process at the stated conditions set by the parameters established by the plan were completed satisfactorily. The details of the of the test process observed by Greenberry is detailed in the attached Seismic Test Log 550001.001-7.0.3, including examples of the objective evidence collected during the qualification process.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗
DOE OSTI2025

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗
DOE OSTI2025

Deep Learning–Assisted Multiobjective Optimization of Geological CO 2 Storage Performance under Geomechanical Risks

In geological CO 2 storage, designing the optimal well control strategy for CO 2 injection to maximize CO 2 storage while minimizing the associated geomechanical risks is not trivial. This challenge arises due to pressure buildup, CO 2 plume migration, the highly nonlinear nature of geomechanical responses to rock-fluid interaction, and the high computational cost associated with coupled flow and geomechanics simulations. In this paper, we introduce a novel optimization framework to address these challenges. The optimization problem is formulated as follows: maximize total CO 2 storage while minimizing geomechanical risks by adjusting the injection schedules within bounded constraints. The geomechanical risks are primarily driven by injection-induced pressure build-up, which is characterized by ground displacement and the induced microseismicity. We used the Fourier neural operator (FNO)-based deep learning model to construct surrogate models, replacing the time-consuming coupled flow and geomechanics simulations for evaluating the aforementioned objective functions. The developed surrogate models have been incorporated into a multiobjective optimization framework through a genetic algorithm to reduce the computational burden. The proposed optimization framework reduces the computational cost from approximately 2,400 hours, when using objective function evaluations based on physics-based simulations, to around 20 minutes. A set of Pareto-optimal solutions of the proposed workflow yields nontrivial optimal decisions, reducing the microseismicity potential and the vertical displacement. This Pareto front highlights the optimal trade-offs between CO 2 storage amount, safety, and ground displacement, emphasizing the need for careful optimization and management of injection strategies to achieve a balanced outcome. The novelty of this work is twofold. First, we demonstrate the importance of incorporating the minimization of the geomechanical risks as objective functions into the CO 2 storage optimization workflow to mitigate the potential risk of induced microseismicity and ground displacement. Second, we leverage the FNO-based surrogate models to optimize a real-field CO 2 storage operation.

42 ENGINEERING↗
DOE OSTI2026

Beyond Contrast Transfer: Spectral SNR as a Finite-Dose Metric for STEM Phase Retrieval

The contrast transfer function (CTF) is widely used to evaluate phase retrieval methods in scanning transmission electron microscopy (STEM), including center-of-mass imaging, parallax imaging, direct ptychography, and iterative ptychography. However, the CTF reflects only the maximum usable signal, neglecting the effects of finite electron fluence and the Poisson-limited nature of detection. As a result, it can significantly overestimate practical performance, especially in low-dose regimes. Here, we employ the spectral signal-to-noise ratio (SSNR), as a finite-dose statistical framework to evaluate the recoverable signal as a function of spatial frequency. Using numerical reconstructions of white-noise objects, we show that center-of-mass, parallax, and direct ptychography exhibit dose-independent SSNRs, with close-form analytic expressions. In contrast, iterative ptychography exhibits a surprising dose dependence: at low fluence, its SSNR converges to that of direct ptychography; at high fluence, it saturates at a value consistent with the maximum detective quantum efficiency predicted by recent quantum Fisher information bounds. The results highlight the limitations of CTF-based evaluation and motivate SSNR as a more accurate, finite-dose metric for assessing STEM phase retrieval methods.

STEM phase retrieval↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Pragmatic Uncertainty Quantification and Propagation in Inverse Estimation of Structural Dynamics Parameters given Material Property Uncertainties and Limited Sensor Data

In this report we demonstrate some relatively simple and inexpensive methods to effectively account for various sources of epistemic lack-of-knowledge type uncertainty in inverse problems. The demonstration problem involves inverse estimation of six parameters of a bolted joint that attaches a kettlebell shaped object to a thick plate. The parameters are efficiently inverted in a modal-based model calibration using gradient-based optimization. Two material properties of the kettlebell are treated as uncertain to within given epistemic uncertainty bounds. We apply and test interval and sparse-sample probabilistic approaches to account for uncertainty in the estimated parameters (and various scalar functionals of the parameters as generic quantities of interest, QOIs) due to uncertainties in the material properties. We also investigate the error effects of limited numbers of vibration sensors (accelerometers) on the kettlebell and plate, and therefore abbreviated excitation/response information in the parameter inversions. We propose and demonstrate a Leave-K-Sensors-Out “cross-prediction” UQ approach to estimate related uncertainties on the parameters and QOI functionals. We indicate how uncertainties from material properties and limited sensors are treated in a combined manner. The economical combined UQ approach involves just three to five samples (i.e. three to five inverse simulations), with no added complication or error/uncertainty from use of surrogate models for affordability. Finally, we describe a related economical UQ approach for handling potential parameter solution non-uniqueness and numerical optimization related precision uncertainties in the estimated parameter values. Indicated further research is identified.

36 MATERIALS SCIENCE↗
DOE OSTI2021

X‐ray scattering reveals disordered linkers and dynamic interfaces in complexes and mechanisms for DNA double‐strand break repair impacting cell and cancer biology

Abstract Evolutionary selection ensures specificity and efficiency in dynamic metastable macromolecular machines that repair DNA damage without releasing toxic and mutagenic intermediates. Here we examine non‐homologous end joining (NHEJ) as the primary conserved DNA double‐strand break (DSB) repair process in human cells. NHEJ has exemplary key roles in networks determining the development, outcome of cancer treatments by DSB‐inducing agents, generation of antibody and T‐cell receptor diversity, and innate immune response for RNA viruses. We determine mechanistic insights into NHEJ structural biochemistry focusing upon advanced small angle X‐ray scattering (SAXS) results combined with X‐ray crystallography (MX) and cryo‐electron microscopy (cryo‐EM). SAXS coupled to atomic structures enables integrated structural biology for objective quantitative assessment of conformational ensembles and assemblies in solution, intra‐molecular distances, structural similarity, functional disorder, conformational switching, and flexibility. Importantly, NHEJ complexes in solution undergo larger allosteric transitions than seen in their cryo‐EM or MX structures. In the long‐range synaptic complex, X‐ray repair cross‐complementing 4 (XRCC4) plus XRCC4‐like‐factor (XLF) form a flexible bridge and linchpin for DNA ends bound to KU heterodimer (Ku70/80) and DNA‐PKcs (DNA‐dependent protein kinase catalytic subunit). Upon binding two DNA ends, auto‐phosphorylation opens DNA‐PKcs dimer licensing NHEJ via concerted conformational transformations of XLF‐XRCC4, XLF–Ku80, and LigIV BRCT –Ku70 interfaces. Integrated structures reveal multifunctional roles for disordered linkers and modular dynamic interfaces promoting DSB end processing and alignment into the short‐range complex for ligation by LigIV. Integrated findings define dynamic assemblies fundamental to designing separation‐of‐function mutants and allosteric inhibitors targeting conformational transitions in multifunctional complexes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Automatically parallelizing batch inference on deep neural networks using Fiats and Fortran 2023 `do concurrent`

This paper introduces novel programming strategies that leverage features of the Fortran 2023 standard of the International Standards Organization (ISO) to automatically parallelize computations on deep neural networks. The paper focuses on the interplay of object-oriented, parallel, and functional programming paradigms in the Fiats deep learning library. We demonstrate how several infrequently used language features play a role in enabling efficient, parallel execution. Specifically, the ability to explicitly declare that a procedure is pure facilitates inference in the context of the language’s loop-parallelism construct `do concurrent`. Also, explicitly prohibiting the overriding of a parent type’s type-bound procedures eliminates the need for dynamic dispatch in performance-critical code. Finally, this paper uses batch inference calculations on a neural network surrogate for atmospheric aerosol dynamics to demonstrate that LLVM Flang compiler’s automatic parallelization of `do concurrent` achieves roughly the same performance and scalability as achieved by OpenMP compiler directives. We also demonstrate that double-precision inference costs 37–72% longer runtime than default-real precision with most values in the range 57-60%.

Rouson, Damian↗
DOE OSTI2021

Decentralized Filtering Adaptive Neural Network Control for Uncertain Switched Interconnected Nonlinear Systems

This article presents a novel decentralized filtering adaptive neural network control framework for uncertain switched interconnected nonlinear systems. Each subsystem has its own decentralized controller based on the established decentralized state predictor. For each subsystem, the nonlinear uncertainties are approximated by a Gaussian radial basis function (GRBF) neural network incorporated with a piecewise constant adaptive law, where the adaptive law will update adaptive parameters from the error dynamics between the host system and the decentralized state predictor by discarding the unknowns, whereas a decentralized filtering control law is derived to cancel both local and mismatched uncertainties from other subsystems, as well as achieve the local objective tracking of the host system. The achievement of global objective depends on the achievement of local objective for each subsystem. The matched uncertainties are canceled directly by adopting their opposite in the control signal, whereas a dynamic inversion of the system is required to eliminate the effect of the mismatched uncertainties on the output. By exploiting the average dwell time principle, the error bounds between the real system and the virtual reference system, which defines the best performance that can be achieved by the closed-loop system, are derived. A numerical example is given to illustrate the effectiveness of the decentralized filtering adaptive neural network control architecture by comparing against the model reference adaptive control (MRAC).

Average dwell time, decentralized, filtering adapt↗
DOE OSTI2022

Algorithm 1028: VTMOP: Solver for Blackbox Multiobjective Optimization Problems

VTMOP is a Fortran 2008 software package containing two Fortran modules for solving computationally expensive bound-constrained blackbox multiobjective optimization problems. VTMOP implements the algorithm of [32], which handles two or more objectives, does not require any derivatives, and produces well-distributed points over the Pareto front. The first module contains a general framework for solving multiobjective optimization problems by combining response surface methodology, trust region methodology, and an adaptive weighting scheme. The second module features a driver subroutine that implements this framework when the objective functions can be wrapped as a Fortran subroutine. Lastly, support is provided for both serial and parallel execution paradigms, and VTMOP is demonstrated on several test problems as well as one real-world problem in the area of particle accelerator optimization.

97 MATHEMATICS AND COMPUTING↗