Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Global 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 163 records · Page 9

Contextual Active Online Model Selection with Expert Advice

How can we collect the most useful labels to learn a model selection policy, when presented with arbitrary heterogeneous data streams? In this paper, we formulate this task as a contextual active model selection problem, where at each round the learner receives an unlabeled data point along with a context. The goal is to output the best model for any given context without obtaining an excessive amount of labels. In particular, we focus on the task of selecting pre-trained classifiers, and propose a contextual active model selection algorithm (CAMS), which relies on a novel uncertainty sampling query criterion defined on a given policy class for adaptive model selection. In comparison to prior art, our algorithm does not assume a globally optimal model. We provide rigorous theoretical analysis for the regret and query complexity under both adversarial and stochastic settings. Our experiments on several benchmark classification datasets demonstrate the algorithm’s effectiveness in terms of both regret and query complexity. Notably, to achieve the same accuracy, CAMS incurs less than 10% of the label cost when compared to the best online model selection baselines on CIFAR10.

Liu, Xuefeng↗

Constrained curve fitting for semi-parametric models with radial basis function networks

Common to many analysis pipelines in lattice gauge theory and the broader scientific discipline is the need to fit a semi-parametric model to data. We propose a fit method that utilizes a radial basis function network to approximate the non-parametric component of such models. The approximate parametric model is fit to data using the basin hopping global optimization algorithm. Parameter constraints are enforced through Gaussian priors. The viability of our method is tested by examining its use in a finite-size scaling analysis of the $q$-state Potts model and $p$-state clock model with $q=2,3$ and $p=4,\infty$.

Peterson, Curtis T.↗

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Metabolite discovery through global annotation of untargeted metabolomics data

Liquid chromatography–high-resolution mass spectrometry (LC-MS)-based metabolomics aims to identify and quantify all metabolites, but most LC-MS peaks remain unidentified. Here we present a global network optimization approach, NetID, to annotate untargeted LC-MS metabolomics data. The approach aims to generate, for all experimentally observed ion peaks, annotations that match the measured masses, retention times and (when available) tandem mass spectrometry fragmentation patterns. Peaks are connected based on mass differences reflecting adduction, fragmentation, isotopes, or feasible biochemical transformations. Global optimization generates a single network linking most observed ion peaks, enhances peak assignment accuracy, and produces chemically informative peak–peak relationships, including for peaks lacking tandem mass spectrometry spectra. Applying this approach to yeast and mouse data, we identified five previously unrecognized metabolites (thiamine derivatives and N-glucosyl-taurine). Isotope tracer studies indicate active flux through these metabolites. Furthermore, NetID applies existing metabolomic knowledge and global optimization to substantially improve annotation coverage and accuracy in untargeted metabolomics datasets, facilitating metabolite discovery.

59 BASIC BIOLOGICAL SCIENCES↗

Discovery of two-dimensional binary nanoparticle superlattices using global Monte Carlo optimization

Binary nanoparticle (NP) superlattices exhibit distinct collective plasmonic, magnetic, optical, and electronic properties. Here, we computationally demonstrate how fluid-fluid interfaces could be used to self-assemble binary systems of NPs into 2D superlattices when the NP species exhibit different miscibility with the fluids forming the interface. We develop a basin-hopping Monte Carlo (BHMC) algorithm tailored for interface-trapped structures to rapidly determine the ground-state configuration of NPs, allowing us to explore the repertoire of binary NP architectures formed at the interface. By varying the NP size ratio, interparticle interaction strength, and difference in NP miscibility with the two fluids, we demonstrate the assembly of an array of exquisite 2D periodic architectures, including AB-, AB 2 -, and AB 3 -type monolayer superlattices as well as AB-, AB 2 -, A 3 B 5 -, and A 4 B 6 -type bilayer superlattices. Our results suggest that the interfacial assembly approach could be a versatile platform for fabricating 2D colloidal superlattices with tunable structure and properties.

36 MATERIALS SCIENCE↗

Underestimation of multi-decadal global O 2 loss due to an optimal interpolation method

Abstract. The global ocean's oxygen content has declined significantly over the past several decades and is expected to continue decreasing under global warming, with far-reaching impacts on marine ecosystems and biogeochemical cycling. Determining the oxygen trend, its spatial pattern, and uncertainties from observations is fundamental to our understanding of the changing ocean environment. This study uses a suite of CMIP6 Earth system models to evaluate the biases and uncertainties in oxygen distribution and trends due to sampling sparseness. Model outputs are sub-sampled according to the spatial and temporal distribution of the historical shipboard measurements, and the data gaps are filled by a simple optimal interpolation method using Gaussian covariance with a constant e-folding length scale. Sub-sampled results are compared to full model output, revealing the biases in global and basin-wise oxygen content trends. The simple optimal interpolation underestimates the modeled global deoxygenation trends, capturing approximately two-thirds of the full model trends. The North Atlantic and subpolar North Pacific are relatively well sampled, and the simple optimal interpolation is capable of reconstructing more than 80 % of the oxygen trend in the non-eddying CMIP models. In contrast, pronounced biases are found in the equatorial oceans and the Southern Ocean, where the sampling density is relatively low. The application of the simple optimal interpolation method to the historical dataset estimated the global oxygen loss to be 1.5 % over the past 50 years. However, the ratio of the global oxygen trend between the sub-sampled and full model output has increased the estimated loss rate in the range of 1.7 % to 3.1 % over the past 50 years, which partially overlaps with previous studies. The approach taken in this study can provide a framework for the intercomparison of different statistical gap-filling methods to estimate oxygen content trends and their uncertainties due to sampling sparseness.

Ito, Takamitsu (ORCID:000000019873099X)↗

Application-specific optimal model weighting of global climate models: A red tide example

Global climate models (GCMs) and Earth system models (ESMs) provide many climate services with environmental relevance. The High Resolution Model Inter-comparison Project (HighResMIP) of the Coupled Model Intercomparison Project Phase 6 (CMIP6) provides model runs of GCMs and ESMs to address regional phenomena. Developing a parsimonious ensemble of CMIP6 requires multiple ensemble methods such as independent-model subset selection, prescreening-based subset selection, and model weighting. The work presented here focuses on application-specific optimal model weighting, with prescreening-based subset selection. As such, independent ensemble members are categorized, selected, and weighted based on their ability to reproduce physically-interpretable features of interest that are problem-specific. We discuss the strengths and caveats of optimal model weighting using a case study of red tide prediction in the Gulf of Mexico along the West Florida Shelf. Red tide is a common name of specific harmful algal blooms that occur worldwide, causing adverse socioeconomic and environmental impacts. Our results indicate the importance of prescreening-based subset selection as optimal model weighting can underplay robust ensemble members by optimizing error cancellation. Prescreening-based subset selection also provides insights about the validity of the model weights. By illustrating the caveats of using non-representative models when optimal model weighting is used, the findings and discussion of this study are pertinent to many other climate services.

54 ENVIRONMENTAL SCIENCES↗

Integrated membrane material design and system synthesis

In designing membrane systems, the synergy between membrane materials and the process design is often overlooked. In this paper, we present a mixed-integer nonlinear programming (MINLP) model for synthesizing membrane systems while simultaneously designing the respective membrane materials for multicomponent gas separation. The approach considers superstructure representations for systems with: (1) same, (2) potentially different, and (3) property-targeting membrane materials. In the first two systems, the selection of membrane material is a decision, while in the final type, membrane permeances are subject to optimization. Physics-based surrogate models are used to describe permeation in crossflow and countercurrent flow permeators. We show that, through a case study of biogas upgrading, our approach obtains high quality solutions. Furthermore, we use the proposed approach while considering permeance-based production cost to find the optimal membrane.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗

Global and regional perspectives on optimizing thermo-responsive dynamic windows for energy-efficient buildings

Architectural thermo-responsive dynamic windows offer an autonomous solution for solar heat regulation, thereby reducing building energy consumption. Previous work has emphasized the significance of thermo-responsive windows in hot climates due to their role in solar heat control and subsequent energy conservation; conversely, our study provides a different perspective. Through a global-scale analysis, we explore over 100 material samples and execute more than 2.8 million simulations across over two thousand global locations. World heatmap results, derived from well-trained artificial neural network models, reveal that thermo-responsive windows are especially useful in climates where buildings demand both heating and cooling energy, whereas thermo-responsive windows with optimal transition temperatures show no dynamic features in most of low-latitude tropical regions. Additionally, this study provides a practical guideline and an open-source mapping tool to optimize the intrinsic properties of thermo-responsive materials and evaluate their energy performance for sustainable buildings at various geographical scales.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Minimization of Measurement Uncertainty in Optical Frequency Domain Reflectometry

Optical frequency domain reflectometry (OFDR) is a technique for interrogating optical fiber sensors to generate relative, quasi-distributed measurements. Although Optical frequency domain reflectometry (OFDR) is increasingly being adopted for aerospace, energy production, and structural monitoring applications, the quantification of uncertainty for OFDR measurements has not been developed beyond sparse empirical relationships. To address this knowledge gap, an uncertainty metric for OFDR measurements was developed. This uncertainty metric was applied to weight the edges between OFDR measurements on directed correlation graphs and analyzed to minimize the cumulative uncertainty. In conclusion, this work is the first to propose an uncertainty metric for OFDR and provides a generalized mathematical framework for optimizing OFDR hardware selection, optical fiber sensor selection, and postprocessing strategy.

42 ENGINEERING↗

Computationally efficient optimization models for preliminary distillation column design and separation energy targeting

We propose versatile shortcut distillation column and separation energy targeting models that are well-suited for superstructure-based process synthesis. The models are based on a novel reformulation of the Underwood equations to address systems where the components that are present in the feed can vary due to zero flow rates of some components. Also, we propose valid constraints, resulting in a significant enhancement of the computational performance of the models. Furthermore, the proposed distillation column model can automatically identify adequate key components and the energy requirement of a desired separation task, while considering a wide range of types of separations including non-sharp/sloppy splits. Also, the proposed separation energy targeting model can be used to estimate an energy requirement target for the separation of a mixture without finding detail network configurations. Due to their versatility and computational efficiency, the proposed models can be readily used for and expand the scope of superstructure-based process synthesis approaches.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Assessing decision boundaries under uncertainty

In order to make design decisions, engineers may seek to identify regions of the design domain that are acceptable in a computationally efficient manner. A design is typically considered acceptable if its reliability with respect to parametric uncertainty exceeds the designer’s desired level of confidence. Despite major advancements in reliability estimation and in design classification via decision boundary estimation, the current literature still lacks a design classification strategy that incorporates parametric uncertainty and desired design confidence. To address this gap, this paper offers a novel interpretation of the acceptance region by defining the decision boundary as the hypersurface which isolates the designs that exceed a user-defined level of confidence given parametric uncertainty. This work addresses the construction of this novel decision boundary using computationally efficient algorithms that were developed for reliability analysis and decision boundary estimation. The approach proposed in this paper is verified on two physical examples from structural and thermal analysis using Support Vector Machines and Efficient Global Optimization-based contour estimation.

97 MATHEMATICS AND COMPUTING↗

A solution framework for linear PDE-constrained mixed-integer problems

Abstract We present a general numerical solution method for control problems with state variables defined by a linear PDE over a finite set of binary or continuous control variables. We show empirically that a naive approach that applies a numerical discretization scheme to the PDEs to derive constraints for a mixed-integer linear program (MILP) leads to systems that are too large to be solved with state-of-the-art solvers for MILPs, especially if we desire an accurate approximation of the state variables. Our framework comprises two techniques to mitigate the rise of computation times with increasing discretization level: First, the linear system is solved for a basis of the control space in a preprocessing step. Second, certain constraints are just imposed on demand via the IBM ILOG CPLEX feature of a lazy constraint callback. These techniques are compared with an approach where the relations obtained by the discretization of the continuous constraints are directly included in the MILP. We demonstrate our approach on two examples: modeling of the spread of wildfire and the mitigation of water contamination. In both examples the computational results demonstrate that the solution time is significantly reduced by our methods. In particular, the dependence of the computation time on the size of the spatial discretization of the PDE is significantly reduced.

97 MATHEMATICS AND COMPUTING↗

A generalized distillation network synthesis model

In this report we propose a generalized superstructure-based distillation network synthesis model with improved modeling capabilities resulting in an extended solution space. The model can assign multiple mixtures to be separated (e.g., reactor network effluents) to different columns of the network while considering the interactions among different separation steps. In terms of outlets, products with general specifications, including pure components and multi-component mixtures, as well as streams without strict specifications (e.g., reactor recycle streams) can be readily handled. Furthermore, stream bypass is considered to avoid unnecessary separations, and thermal coupling is considered to yield novel solutions. The proposed model enables seamless integration with reactor network synthesis models thereby leading to solutions that are superior to the ones obtained by conventional sequential approaches.

42 ENGINEERING↗

Piecewise polyhedral formulations for a multilinear term

Herein, we present a mixed-integer linear programming (MILP) formulation of a piecewise, polyhedral relaxation (PPR) of a multilinear term using its convex-hull representation. Based on the PPR’s solution, we also present a MILP formulation whose solutions are feasible for nonconvex, multilinear equations. We then present computational results showing the effectiveness of proposed formulations on standard benchmark nonlinear programs (NLPs) with multilinear terms and compare with a traditional formulation that is built using recursive bilinear groupings of multilinear terms.

42 ENGINEERING↗