Engineering PapersSearch

SEARCH · Engineering Papers

Results for “mathematical programming”

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 19 records

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING

Jacobian-based model diagnostics and application to equation oriented modeling of a carbon capture system

It can be difficult to identify the specific variables or equations responsible for convergence issues in large mathematical programming models. The Institute for the Design of Advanced Energy Systems Integrated Platform (IDAES-IP) contains a tool to identify poorly scaled constraints and variables by searching for rows and columns of the Jacobian matrix with small L2-norms. A singular value decomposition is then performed to identify degenerate sets of equations and remaining scaling issues. Here, this work presents a flowsheet developed for post-combustion carbon capture using a monoethanolamine (MEA) solvent system as a case study. This work takes the reader through the entire process of model diagnostics and reformulation, from a basic introduction to the mathematics behind these model diagnostics to the reformulations necessary to make the model numerically robust, including a significantly modified enhancement factor model.

IDAES

On optimal control of hybrid dynamical systems using complementarity constraints

Optimal control for switch-based dynamical systems is a challenging problem in the process control literature. In this study, we model these systems as hybrid dynamical systems with finite number of unknown switching points and reformulate them using non-smooth and non-convex complementarity constraints as a mathematical program with complementarity constraints (MPCC). We utilize a moving finite element based strategy to discretize the differential equation system to accurately locate the unknown switching points at the finite element boundary and achieve high-order accuracy at intermediate non-collocation points. We propose a globalization approach to solve the discretized MPCC problem using a mixed NLP/MILP-based strategy to converge to a non-spurious first-order optimal solution. The method is tested on three dynamic optimization examples, including a gas–liquid tank model and an optimal control problem with a sliding mode solution.

97 MATHEMATICS AND COMPUTING

Available land for cellulosic biofuel production: a supply chain centered comparison

The land that is potentially available to produce dedicated cellulosic bioenergy crops, often referred to as 'marginal' land, depends heavily on the underlying assumptions used to classify and identify it. In this study we compare three definitions and types of marginal land to identify the interactions between the bioenergy landscape and the logistics networks needed for the biofuel supply chain. Typical studies of the scale, cost, and greenhouse gas (GHG) mitigation potential of cellulosic biofuel take a land-centered approach which may neglect to account for the trade-offs between establishing bioenergy crops and the supply chain design decisions needed to allow those crops to be converted to liquid fuel. A mathematical programming approach is used to minimize the total annualized cost of a large-scale field-to-product system producing bioethanol in the USA midwest. Results show that a high concentration of marginal land leads to efficient systems and that the bioenergy landscape design becomes increasingly important with a higher emphasis on GHG mitigation. Additionally, targeted landscape design (including fertilization) with a focus on fields with high soil carbon sequestration potential can greatly reduce the system-wide GHG emissions for only a small increase in the unit cost of biofuel.

09 BIOMASS FUELS

Genetic programming for the nuclear many-body problem: a guide

Genetic Programming (GP) is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use GP to develop surrogate models to mitigate the computational costs of modeling atomic nuclei with ever increasing complexity. The computational burden escalates when uncertainty quantification is pursued, or when observables must be globally computed for thousands of nuclei. By studying three models in which the mean field depends on the total particle density self-consistently, we show that by constructing reduced order models supported by GP one can speed up many-body computations by several orders of magnitude with a negligible loss in accuracy.

dimensionality reduction

Workforce planning: a review of methodologies

Workforce planning deals with determining the number of employees and associated skills necessary to meet the future operational needs of an organization. A workforce system consists of six elements: recruitment, attrition, promotion, training, retention, and scheduling. Historically, several workforce modeling and analysis methodologies have been developed to capture these elements. This paper reviews the results of workforce and manpower models published within peer-reviewed literature between 1959 and 2021 to provide an in-depth analysis of current models. The focus of this review is on analytical, simulation, and empirical models found in literature that were collected based on a citation requirement and keyword search criteria. Results demonstrate the trends in workforce modeling research and discuss the common uses of each model type and the advantages/disadvantages related to each model. Based on the common attributes of workforce systems, the discussion focuses on the most frequently used model type for each element and the best use for each model. Lastly, recommendations are made for the development of workforce models that allow the most comprehensive view of the workforce systems of the future.

42 ENGINEERING

Hyperplane decision trees as piecewise linear surrogate models for chemical process design

Recent trends in chemical engineering research point towards an increasing reliance on data-driven modeling approaches. Neural networks, for instance, have proven to be accurate when data is plentiful and high-dimensional, but in many cases, they require computationally-intensive training procedures. Here, in this work, we describe hyperplane decision trees (HT) as a highly expressive and low-compute machine learning model architecture. These models are locally linear and have linear decision boundaries, resulting in a piecewise linear model of the data. This property allows them to be converted into mixed-integer linear constraints which can be globally optimized. Our open-source PyTorch implementation of this method is a fast, flexible, and accessible way to build accurate piecewise linear models of data.

Decision trees

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC

IM3 Projected U.S. Western Interconnection Grid Stress Dataset

This dataset provides projected grid stress and reliability results (including all model inputs and outputs from GO WEST and TEP) for Integrated Multisector, Multiscale Modeling (IM3) Phase 2 simulations across eight different scenarios for the U.S. Western Interconnection through 2055. The scenarios include combinations of two Shared Socioeconomic Pathways (SSP3 and SSP5) with four high-resolution climate projections specific to the United States from a set of Thermodynamic Global Warming (TGW) simulations. These climate projections include "hotter" and "cooler" variants for two Representative Concentration Pathways (RCP4.5 and RCP8.5). The resulting eight simulations are: rcp45cooler_ssp3 rcp45cooler_ssp5 rcp45hotter_ssp3 rcp45hotter_ssp5 rcp85cooler_ssp3 rcp85cooler_ssp5 rcp85hotter_ssp3 rcp85hotter_ssp5 GO WEST is an open-source power grid modeling framework for the U.S. Western Interconnection, which allows users to tailor the model depending on their research study and science questions. It covers 28 balancing authorities (BAs) and 12 states in U.S. Western Interconnection. GO WEST allows users to select different number of nodes and come up with a simplified network by utilizing 10,000 nodal topology of the U.S. Western Interconnection (ACTIVSg10k). Users can select different number of nodes, mathematical formulations (linear programming vs. mixed-integer linear programming), transmission line limit scaling factors, and hurdle rate scaling factors. GO WEST offers a unit commitment and economic dispatch (UC/ED) module to simulate grid operations on an hourly scale. In this sense, users can calibrate and validate their model versions by comparing model outputs to historical datasets. TEP is an open-source transmission capacity expansion model, built on the GO WEST framework. It utilizes linear programming to optimize transmission capacity addition investment on existing lines within the GO WEST framework. The TEP model only increases the thermal capacity of existing transmission lines and does not add new lines to the system, which leaves the topology preserved. In order to use TEP model, users need to create scenarios with the GO WEST framework. Please refer to README file for a detailed description of the dataset including individual files and references.

Capacity Expansion Model

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING

Taming nuclear mass models with Gaussian processes

We propose a new set of nuclear mass predictions based on multiple theoretical mass models. By employing Gaussian process regression with the Matérn kernel, we achieved root-mean-square (rms) deviations below 100 keV for the training dataset. The best-performing mass models achieved rms deviations below 150 keV for the new precise mass data from AME2020, whereas the ensemble average showed robust performance across the nuclear chart. Our approach uniquely combines: (1) systematic refinement of eight mass models through their residuals, (2) physics-informed features, including magic numbers, nucleon parity numbers, neutron excess, and nuclear collectivity, and (3) theory-to-theory validation demonstrating robust extrapolation capability. We find that the Matérn kernel provides superior uncertainty quantification compared to the RBF kernel, with a length-scale analysis revealing enhanced inter-nuclei correlations. We provide complete mass predictions for all unknown nuclides in AME2020, offering valuable constraints for nuclear structure studies and astrophysical modeling when used with proper uncertainty propagation.

Gaussian processes

Uncovering heterogeneous intercommunity disease transmission from neutral allele frequency time series

The COVID-19 pandemic has underscored the need for accurate epidemic forecasting to predict pathogen spread, evolution, and evaluate intervention strategies. Forecast reliability hinges on detailed knowledge of disease transmission across population segments, which may be inferred from contact surveys or mobility data. However, these indirect approaches make it difficult to estimate rare transmissions between socially or geographically distant communities. We show that the steep ramp-up of genome sequencing surveillance during the pandemic can be leveraged to directly identify transmission patterns between geographically defined communities. Our approach uses a hidden Markov model to infer the fraction of infections a community imports from others based on how rapidly allele frequencies in the focal community converge to those in the donor communities. Applying this method to SARS-CoV-2 sequencing data from England and the United States, we uncover networks of intercommunity transmission that reflect geographical relationships while exposing significant long-range interactions. The scaling of importation rate with distance is consistent across both countries, yet weaker than expected based on mobility data, highlighting limitations of indirect inference. We show that transmission patterns can change between waves of variants of concern and analyze how the inferred heterogeneity in intercommunity transmission impacts evolutionary forecasts. While applied here to geographically defined communities, our approach could be applied to those defined by other traits (e.g., age, socioeconomic status), provided time-series data can be stratified accordingly. Overall, our study highlights population genomic time series data as a crucial record of epidemiological interactions, which can be deciphered using tree-free inference methods.

Okada, Takashi [Department of Physics; University

Full-polarization millimeter wavelength variability of Sagittarius A * during the 2018 EHT campaign

Context. Sagittarius A* (Sgr A*), the supermassive black hole at the center of the Milky Way, provides a unique laboratory to study accretion dynamics and plasma processes near the event horizon. Aims. We investigated the variability and polarization properties of Sgr A* using ALMA observations during the 2018 Event Horizon Telescope campaign. Methods. We analyzed high-cadence full-polarization light curves from ALMA at millimeter wavelengths, performed time-series analysis, and investigated the temporal behavior during an X-ray flare observed by Chandra on 2018 April 24. The variability characteristics are compared with expectations from standard accretion flow models. Results. We find low variability in total intensity (σ/μ < 10%), but significantly higher variability in linear and circular polarization (∼30% and ∼50%, respectively). A time-series analysis reveals red-noise variability, with power spectral densities between −2 and −3 across all Stokes parameters. Polarized intensity shows stable intra-day timescales, while total intensity exhibits more variable timescales, suggesting distinct emission regions, with polarization likely arising from a coherent structure. On April 24, a statistically significant inter-band delay in polarized intensity coincides with a near-simultaneous X-ray and millimeter peak that deviates from the typical delayed flare scenario. This event also features enhanced millimeter variability and coherent polarization loop evolution. The observed simultaneity challenges standard models of transient synchrotron emission with cooling delays, favoring instead a scenario of continuous energy injection in an optically thin region. Conclusions. Our results offer new constraints on the physical mechanisms driving variability in Sgr A*, and provide key observational input for refining theoretical models of accretion and plasma behavior in the vicinity of supermassive black holes.

Galaxy: center

Locating the missing large-scale emission in the jet of M87* with short EHT baselines

In very-long baseline interferometric arrays, nearly co-located stations probe the largest scales and typically cannot resolve the observed source. In the absence of a large-scale structure, closure phases constructed with these stations are zero and, since they are independent of station-based errors, they can be used to probe data issues. Here, we show how these trivial closure phases become nonzero with a brightness distribution on smaller scales than their short baseline would suggest. When applied to sources that are made up of a bright compact and large-scale diffuse component, the trivial closure phases directly measure the centroid relative to the compact source and higher-order image moments. We present a technique to measure these image moments with minimal model assumptions and validate it on synthetic Event Horizon Telescope (EHT) data. We then apply this technique to 2017 and 2018 EHT observations of M87* and find a weak preference for extended emission in the direction of the large-scale jet. We also apply it to 2021 EHT data and measure the source centroid about 1 mas northwest of the compact ring, which is consistent with the jet observed at lower frequencies.

79 ASTRONOMY AND ASTROPHYSICS

Probing jet base emission of M87* with the 2021 Event Horizon Telescope observations

We investigate the presence and spatial characteristics of the jet base emission in M87* at 230 GHz, enabled by the significantly enhanced (u,v) coverage in the 2021 Event Horizon Telescope (EHT) observations. The integration of the 12−m Kitt Peak Telescope (USA) and NOEMA (France) stations into the array introduces two critical intermediate-length baselines to SMT (USA) and IRAM 30−m (Spain), providing sensitivity to emission structures at spatial scales of ∼250 μas and ∼2500 μas (∼ 0.02 pc and ∼ 0.02 pc). Without these new baselines, previous EHT observations of the source in 2017 and 2018 lacked the capability to constrain emission on large scales, where a “missing flux” of order ∼1 Jy is expected to reside. To probe these scales, we analyzed closure phases–robust against station-based gain calibration errors–and model the jet base emission using a simple Gaussian component offset from the compact ring emission at spatial separations > 100 μas. Our analysis revealed a Gaussian feature centered at (ΔRA ≈ 320 μ as, ΔDec. ≈ 60 μ as), projected separation of ≈ 5500 AU, with an estimated flux density of only ∼60 mJy, implying that most of the missing flux identified in previous EHT studies had to originate from different, larger scales. Brighter emission at the relevant spatial scales is firmly ruled out, and the data do not favor more complex models. This component aligns with the inferred position of the large-scale jet and is therefore physically consistent with the emission of the jet base. While our findings point to detectable jet base emission at 230 GHz, the limited coverage provided by only two intermediate baselines limits our ability to robustly reconstruct its morphology. Consequently, we treated the recovered Gaussian as an upper limit on the jet base flux density. Future EHT observations with expanded intermediate baseline coverage will be essential to constrain the structure and nature of this component with higher precision.

accretion, accretion disks

Spatially resolved polarization swings in the supermassive binary black hole candidate OJ 287 with first Event Horizon Telescope observations

We present the first Event Horizon Telescope 1.3 mm observations of the supermassive binary black hole candidate OJ 287. The observations achieved an unprecedented angular resolution of 18 μas and reveal significant structural and polarization variability over just five days, marking the shortest timescale on which such changes have been directly imaged in this source. The inner jet exhibits a twisted ridgeline structure, with features displaying apparent superluminal motions up to about 22 c. The linear polarization maps reveal three main polarized features whose electric-vector position angles (EVPAs) change substantially over the time span of our observations, including a component with a radial polarization consistent with being produced by a recollimation shock. Most notably, we directly resolved two innermost jet components whose EVPAs rotate in opposite directions. The faster component, moving at 2.4 ± 0.9 μas/day (17.4 ± 6.5 c), exhibits counterclockwise EVPA swings of roughly 3.7° per day, while the slower component, with a proper motion of 1.4 ± 0.3 μas/day (10.2 ± 2.2 c), rotates clockwise at approximately 2.5° per day. Previous studies inferred helical magnetic fields in AGN jets from time-resolved or integrated polarization variability but lacked the angular resolution to directly image this effect. Our results provide spatially resolved evidence that a helical magnetic field threads the jet’s collimation and acceleration zone, ruling out models based on the superposition of unresolved components. Our analysis suggests that propagating shocks interact with a Kelvin–Helmholtz plasma instability, illuminating different phases of the helical magnetic field and producing the observed polarization spatial and temporal variability. Moreover, our model naturally accounts for the more rapid polarization rotation observed in the faster moving component. Our model predicts even more rapid swings in polarization, which could be tested with future observations featuring a more densely sampled time coverage.

OJ 287

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization