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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Structure-aware methods for expensive derivative-free nonsmooth composite optimization

We present new methods for solving a broad class of bound-constrained nonsmooth composite minimization problems. These methods are specially designed for objectives that are some known mapping of outputs from a computationally expensive function. We provide accompanying implementations of these methods: in particular, a novel manifold sampling algorithm (MS-P) with subproblems that are in a sense primal versions of the dual problems solved by previous manifold sampling methods and a method (GOOMBAH) that employs more difficult optimization subproblems. For these two methods, we provide rigorous convergence analysis and guarantees. We demonstrate extensive testing of these methods. Open-source implementations of the methods developed in this manuscript can be found at https://github.com/POptUS/ IBCDFO/.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1972

Adaptive nonlinear optimization of the signal-to-noise ratio of an array subject to a constraint.

Investigation of a stochastic projected gradient algorithm which can be used to find a constrained optimum point for a concave or convex objective function subject to nonlinear constraints. When the constraint consists of only one linear equation, convergence to the constrained optimum value is proven, and bounds are obtained for the rate of convergence of the algorithm to the constrained optimum value. This algorithm is then applied to the nonlinear problem of automatically making an array of detectors form a beam in a desired direction in space when unknown interfering noise is present so as to maximize the signal-to-noise ratio subject to a constraint on the supergain ratio.

Winkler, L. P.↗
DOE OSTI2025

Computational Performance Bounds Prediction in Quantum Computing With Unstable Noise

Quantum computing has significantly advanced in recent years, boasting devices with hundreds of quantum bits (qubits), hinting at its potential quantum advantage over classical computing. Yet, noise in quantum devices poses significant barriers to realizing this supremacy. Understanding noise’s impact is crucial for reproducibility and application reuse; moreover, the next-generation quantum-centric supercomputing essentially requires efficient and accurate noise characterization to support system management (e.g., job scheduling), where ensuring correct functional performance (i.e., fidelity) of jobs on available quantum devices can even be higher-priority than traditional objectives. However, noise fluctuates over time, even on the same quantum device, which makes predicting the computational bounds for on-the-fly noise is vital. Noisy quantum simulation can offer insights but faces efficiency and scalability issues. Here, in this work, we propose a data-driven workflow, namely QuBound, to predict computational performance bounds. It decomposes historical performance traces to isolate noise sources and devises a novel encoder to embed circuit and noise information processed by a Long Short-Term Memory (LSTM) network. For evaluation, we compare QuBound with a state-of-the-art learning-based predictor, which only generates a single performance value instead of a bound. Experimental results show that the result of the existing approach falls outside of performance bounds, while all predictions from our QuBound with the assistance of performance decomposition better fit the bounds. Moreover, QuBound can efficiently produce practical bounds for various circuits with over 106 speedup over simulation; in addition, the range from QuBound is over 10× narrower than the state-of-the-art analytical approach.

Li, Jinyang [George Mason Univ., Fairfax, VA (Unit↗
DOE OSTI2021

Localization of Nonblinking Point Sources Using Higher-Order-Mode Detection and Optical Heterodyning: Developing a Strategy for Extending the Scope of Molecular, Super-resolution Imaging

While the stochastic, “blinking” nature of fluorescent systems has enabled the super-resolution of their localization by the fitting of their point-spread functions (PSFs), this strategy cannot be exploited for similar resolution of “nonblinking” systems, such as those that might be encountered in a coherent Raman experiment. An alternative method for subdiffraction-limited imaging lies in the exploitation of optical heterodyning. For example, if a Gaussian PSF (a TEM00 mode) of a point emitter is displaced with respect to the origin of the optical system, photons in the higher-order TEM modes carry information about that displacement. Information concerning the displacement can be extracted from photons in these higher-order modes. These photons can be collected by optical heterodyning, which exploits the large gain in a detector’s response to an optical signal from an emitter coupled to a local oscillator, which is prepared in the TEM of interest, e.g., TEM10. We have generalized and developed the heterodyning technique to localize point emitters via the detection of higher-order spatial modes. We have developed a theoretical approach to find a practical estimation limit of the localization parameters using a realistic model that accounts for shot noise, background noise, and Gaussian noise. To demonstrate the applicability of the method, we designed experiments in which a laser is a surrogate for one and two point emitters. Using the Fisher information and its accompanying Cramér-Rao lower bound, we demonstrate super-resolution localization in these cases: we show that objects can be localized to roughly 2–3 orders of magnitude of their point-spread function’s size for a given optical system. Finally and most importantly, it is suggested that the results will ultimately be generalizable to multiple emitters and, most importantly, to “nonblinking” molecular systems, which will be essential for broadening the scope of super-resolution measurements beyond the limits of fluorescence-based techniques.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
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↗
NASA NTRS1981

Parametric results for heat transfer across honeycomb sandwich panels

The problem of heat transfer across honeycomb sandwich panels is theoretically investigated. The basic objective is to predict the rear surface temperature as a function of time when the front surface is exposed to a prescribed heat flux; the faces are bounded by planar sheets so that the air circulation in the honeycomb cells is bounded and contained. The influence of the air circulation on convective heat transfer is explicitly included. Drawing upon previous investigators' results that indicated various relations for the Nusselt numbers vs Rayleigh numbers in different regimes of the aspect ratio (defined as the ratio of the cell height to cell width), parametric calculations are performed to predict the rear surface temperatures. Chemical degradation of the material, especially the glue holding the face material on the end, is important but has not yet been included. The results indicate that decreasing the cell width, increasing the cell wall thickness and increasing the cell height all have beneficial effects upon the heat transfer; i.e., all of these variations reduce rear surface temperature for a given time for a prescribed heat flux on the front surface.

Ramohalli, K.↗
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↗
NASA NTRS2009

Adaptive Morphological Feature-Based Object Classifier for a Color Imaging System

Utilizing a Compact Color Microscope Imaging System (CCMIS), a unique algorithm has been developed that combines human intelligence along with machine vision techniques to produce an autonomous microscope tool for biomedical, industrial, and space applications. This technique is based on an adaptive, morphological, feature-based mapping function comprising 24 mutually inclusive feature metrics that are used to determine the metrics for complex cell/objects derived from color image analysis. Some of the features include: Area (total numbers of non-background pixels inside and including the perimeter), Bounding Box (smallest rectangle that bounds and object), centerX (x-coordinate of intensity-weighted, center-of-mass of an entire object or multi-object blob), centerY (y-coordinate of intensity-weighted, center-of-mass, of an entire object or multi-object blob), Circumference (a measure of circumference that takes into account whether neighboring pixels are diagonal, which is a longer distance than horizontally or vertically joined pixels), . Elongation (measure of particle elongation given as a number between 0 and 1. If equal to 1, the particle bounding box is square. As the elongation decreases from 1, the particle becomes more elongated), . Ext_vector (extremal vector), . Major Axis (the length of a major axis of a smallest ellipse encompassing an object), . Minor Axis (the length of a minor axis of a smallest ellipse encompassing an object), . Partial (indicates if the particle extends beyond the field of view), . Perimeter Points (points that make up a particle perimeter), . Roundness [(4(pi) x area)/perimeter(squared)) the result is a measure of object roundness, or compactness, given as a value between 0 and 1. The greater the ratio, the rounder the object.], . Thin in center (determines if an object becomes thin in the center, (figure-eight-shaped), . Theta (orientation of the major axis), . Smoothness and color metrics for each component (red, green, blue) the minimum, maximum, average, and standard deviation within the particle are tracked. These metrics can be used for autonomous analysis of color images from a microscope, video camera, or digital, still image. It can also automatically identify tumor morphology of stained images and has been used to detect stained cell phenomena (see figure).

McDowell, Mark↗
NASA NTRS1982

Continued research on selected parameters to minimize community annoyance from airport noise

A mathematical model of the annoyance created at an airport by aircraft operations is developed. The model incorporates population distribution considerations around an airport and the annoyance caused by aircraft noise. The objective function of this model corresponds to seeking to minimize total population annoyance created by all aircraft operations in a 24-hour period. Several factors are included in this model as constraint bounded. Demand for flight services is incorporated by including lower bounds on the number of operations by type of aircraft, runway used and time period. Also upper bounds on the number of operations for each runway are included. The mathematical model as formulated is recognized as corresponding to a nonlinear integer mathematical programming problem.

Frair, L.↗
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↗
NASA NTRS2012

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗
NASA NTRS1987

Star formation in molecular clouds - Observation and theory

Star-formation (SF) processes occurring on the scale of giant molecular clouds (10 to the 6th solar masses and 10 to the 20th cm) or smaller are discussed, reviewing the results of recent theoretical and observational investigations. Topics examined include the origin of stellar masses; bimodal SF; initial mass functions; binary stars, bound clusters, and hierarchical fragmentation; and the efficiency of SF. The properties of molecular clouds and the origin of substructures in molecular clumps are explored in detail, and consideration is given to gravitational collapse and protostars, bipolar outflows from young stellar objects, visible young stellar objects, and the implications for binary-star and planetary-system formation.

Shu, Frank H.↗
NASA NTRS1999

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗
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↗
NASA NTRS1998

A Posteriori Bounds for Linear-Functional Outputs of Crouzeix-Raviart Finite Element Discretizations of the Incompressible Stokes Problem

We present a finite element technique for the efficient generation of lower and upper bounds to outputs which are linear functionals of the solutions to the incompressible Stokes equations in two space dimensions; the finite element discretization is effected by Crouzeix-Raviart elements, the discontinuous pressure approximation of which is central to our approach. The bounds are based upon the construction of an augmented Lagrangian: the objective is a quadratic "energy" reformulation of the desired output; the constraints are the finite element equilibrium equations (including the incompressibility constraint), and the intersubdomain continuity conditions on velocity. Appeal to the dual max-min problem for appropriately chosen candidate Lagrange multipliers then yields inexpensive bounds for the output associated with a fine-mesh discretization; the Lagrange multipliers are generated by exploiting an associated coarse-mesh approximation. In addition to the requisite coarse-mesh calculations, the bound technique requires solution only of local subdomain Stokes problems on the fine-mesh. The method is illustrated for the Stokes equations, in which the outputs of interest are the flowrate past, and the lift force on, a body immersed in a channel.

Patera, Anthony T.↗
NASA NTRS2005

A First and Second Order Moment Approach to Probabilistic Control Synthesis

This paper presents a robust control design methodology based on the estimation of the first two order moments of the random variables and processes that describe the controlled response. Synthesis is performed by solving an multi-objective optimization problem where stability and performance requirements in time- and frequency domains are integrated. The use of the first two order moments allows for the efficient estimation of the cost function thus for a faster synthesis algorithm. While reliability requirements are taken into account by using bounds to failure probabilities, requirements related to undesirable variability are implemented by quantifying the concentration of the random outcome about a deterministic target. The Hammersley Sequence Sampling and the First- and Second-Moment- Second-Order approximations are used to estimate the moments, whose accuracy and associated computational complexity are compared numerically. Examples using output-feedback and full-state feedback with state estimation are used to demonstrate the ideas proposed.

Crespo, Luis G.↗