Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “non convex”

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 OSTI2026

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗
DOE OSTI2023

Accelerating gradient descent and Adam via fractional gradients

Here we propose a class of novel fractional-order optimization algorithms. We define a fractional-order gradient via the Caputo fractional derivatives that generalizes integer-order gradient. We refer it to as the Caputo fractional-based gradient, and develop an efficient implementation to compute it. A general class of fractional-order optimization methods is then obtained by replacing integer-order gradients with the Caputo fractional-based gradients. To give concrete algorithms, we consider gradient descent (GD) and Adam, and extend them to the Caputo fractional GD (CfGD) and the Caputo fractional Adam (CfAdam). We demonstrate the superiority of CfGD and CfAdam on several large scale optimization problems that arise from scientific machine learning applications, such as ill-conditioned least squares problem on real-world data and the training of neural networks involving non-convex objective functions. Numerical examples show that both CfGD and CfAdam result in acceleration over GD and Adam, respectively. We also derive error bounds of CfGD for quadratic functions, which further indicate that CfGD could mitigate the dependence on the condition number in the rate of convergence and results in significant acceleration over GD.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Novel Multi-Agent Deep Reinforcement Learning-enabled Distributed Power Allocation Scheme for mmWave Cellular Networks

We consider the power allocation problem over shared spectrum for millimeter-Wave (mmWave) cellular downlink. Existing approaches usually find sub-optimal solutions by solving a non-convex optimization which leads to scalability issues due to centralized control. Therefore, distributed and adaptive approaches are desirable. Recently, model-free Deep Reinforcement Learning (DRL) has achieved success in such wireless resource management tasks. By modeling the radio environment as a Markov Decision Process (MDP) with the base stations (BSs) being the agents, power allocation can be automated at the agent level with comparable throughput performance to conventional centralized schemes. The multi-agent setting presents new challenges as the radio environment is impacted by the joint actions of the agents and is no longer stationary from any individual agent’s perspective. Existing literature bypasses this non-stationarity violation by ignoring it which may cause performance degradation. To tackle this issue, we propose a distributed continuous power allocation scheme based on a modified version of multi-agent Deep Deterministic Policy Gradient (MADDPG) that is tailored for the distributed multiple-agent setting. The proposed scheme employs a centralized-training distributed-execution framework where Q-functions are trained over subsets of BSs while each BS determines its transmit power based only on its own local observation. It admits constant per-BS communication and computation complexity and is thus scalable to large networks. Numerical evaluation shows that the proposed scheme adapts well to a wide range of interference conditions and can achieve comparable or better performance than several state-of-the-art non-learning approaches.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2022

Subcell limiting strategies for discontinuous Galerkin spectral element methods

Here, we present a general family of subcell limiting strategies to construct robust high-order accurate nodal discontinuous Galerkin (DG) schemes. The main strategy is to construct compatible low order finite volume (FV) type discretizations that allow for convex blending with the high-order variant with the goal of guaranteeing additional properties, such as bounds on physical quantities and/or guaranteed entropy dissipation. For an implementation of this main strategy, four main ingredients are identified that may be combined in a flexible manner: (i) a nodal high-order DG method on Legendre–Gauss–Lobatto nodes, (ii) a compatible robust subcell FV scheme, (iii) a convex combination strategy for the two schemes, which can be element-wise or subcell-wise, and (iv) a strategy to compute the convex blending factors, which can be either based on heuristic troubled-cell indicators, or using ideas from flux-corrected transport methods. By carefully designing the metric terms of the subcell FV method, the resulting methods can be used on unstructured curvilinear meshes, are locally conservative, can handle strong shocks efficiently while directly guaranteeing physical bounds on quantities such as density, pressure or entropy. We further show that it is possible to choose the four ingredients to recover existing methods such as a provably entropy dissipative subcell shock-capturing approach or a sparse invariant domain preserving approach. We test the versatility of the presented strategies and mix and match the four ingredients to solve challenging simulation setups, such as the KPP problem (a hyperbolic conservation law with non-convex flux function), turbulent and hypersonic Euler simulations, and MHD problems featuring shocks and turbulence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

The geometry of the modular bootstrap

Abstract We explore the geometry behind the modular bootstrap and its image in the space of Taylor coefficients of the torus partition function. In the first part, we identify the geometry as an intersection of planes with the convex hull of moment curves onR + ⊗ℤ, with boundaries characterized by the total positivity of generalized Hankel matrices. We phrase the Hankel constraints as a semi-definite program, which has several advantages, such as the validity of bounds irrespective of spin truncation. We derive bounds on the gap, twist-gap, and the space of Taylor coefficients themselves. We find that if the gap is above$$ {\Delta }_{\textrm{gap}}^{\ast } $$ ∆ gap ∗ , where$$ \frac{c-1}{12}<{\Delta}_{\textrm{gap}}^{\ast }<\frac{c}{12} $$ c − 1 12 < Δ gap ∗ < c 12 , all coefficients become bounded on both sides and kinks develop in the space. In the second part, we propose an analytic method of imposing the integrality condition for the degeneracy number in the spinless bootstrap, which leads to a non-convex geometry. We find that even at very low derivative order this condition rules out regions otherwise allowed by bootstraps at high derivative order.

Physics↗
DOE OSTI2025

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↗
DOE OSTI2020

Optimal economic operation of liquid petroleum products pipeline systems

The majority of overland transport needs for crude petroleum and refined petroleum products are met using pipelines. Numerous studies have developed optimization methods for design of these systems in order to minimize construction costs while meeting capacity requirements. Here, we formulate problems to optimize the operations of existing single liquid commodity pipeline systems subject to physical flow and pump engineering constraints. The objectives are to maximize the economic value created for users of the system and to minimize operating costs. We present a general computational method for this class of continuous, non-convex nonlinear programs, and examine the use of pump operating settings and flow allocations as decision variables. Furthermore, the approach is applied to compute optimal operating regimes and perform engineering economic sensitivity analyses for a case study of a crude oil pipeline developed using publicly available data.

02 PETROLEUM↗
DOE OSTI2025

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing

We analyze the convergence of a nonlocal gradient descent method for minimizing a class of high-dimensional non-convex functions, where a directional Gaussian smoothing (DGS) is proposed to define the nonlocal gradient (also referred to as the DGS gradient). The method was first proposed in [Zhang et al., Enabling long-range exploration in minimization of multimodal functions, UAI 2021], in which multiple numerical experiments showed that replacing the traditional local gradient with the DGS gradient can help the optimizers escape local minima more easily and significantly improve their performance. However, a rigorous theory for the efficiency of the method on nonconvex landscape is lacking. In this work, we investigate the scenario where the objective function is composed of a convex function, perturbed by deterministic oscillating noise. We provide a convergence theory under which the iterates exponentially converge to a tightened neighborhood of the solution, whose size is characterized by the noise wavelength. Here, we also establish a correlation between the optimal values of the Gaussian smoothing radius and the noise wavelength, thus justifying the advantage of using moderate or large smoothing radii with the method. Furthermore, if the noise level decays to zero when approaching the global minimum, we prove that DGS-based optimization converges to the exact global minimum with linear rates, similarly to standard gradient-based methods in optimizing convex functions. Several numerical experiments are provided to confirm our theory and illustrate the superiority of the approach over those based on the local gradient.

Tran, Hoang [Oak Ridge National Laboratory (ORNL),↗
DOE OSTI2022

Real-time dispatch optimization for concentrating solar power with thermal energy storage

Concentrating solar power (CSP) plants present a promising path towards utility-scale renewable energy. The power tower, or central receiver, configuration can achieve higher operating temperatures than other forms of CSP, and, like all forms of CSP, naturally pairs with comparatively inexpensive thermal energy storage, which allows CSP plants to dispatch electricity according to market price incentives and outside the hours of solar resource availability. Currently, CSP plants commonly include a steam Rankine power cycle and several heat exchange components to generate high-pressure steam using stored thermal energy. The efficiency of the steam Rankine cycle depends on the temperature of the plant's operating fluid, and so is a main concern of plant operators. However, the variable nature of the solar resource and the conservatism with which the receiver is operated prevent perfect control over the receiver outlet temperature. Therefore, during periods of solar variability, collection occurs at lower-than-design temperature. To support operator decisions in a real-time setting, we develop a revenue-maximizing non-convex mixed-integer, quadradically-constrained program which determines a dispatch schedule with sub-hourly time fidelity and considers temperature-dependent power cycle efficiency. The exact nonlinear formulation proves intractable for real-time decision support. Here we present exact and inexact techniques to improve problem tractability that include a hybrid nonlinear and linear formulation. Our approach admits solutions within approximately 3% of optimality, on average, within a five-minute time limit, demonstrating its usability for decision support in a real-time setting.

14 SOLAR ENERGY↗
DOE OSTI2025

Persistent Sampling: Enhancing the Efficiency of Sequential Monte Carlo

Sequential Monte Carlo (SMC) samplers are powerful tools for Bayesian inference but suffer from high computational costs due to their reliance on large particle ensembles for accurate estimates. We introduce persistent sampling (PS), an extension of SMC that systematically retains and reuses particles from all prior iterations to construct a growing, weighted ensemble. By leveraging multiple importance sampling and resampling from a mixture of historical distributions, PS mitigates the need for excessively large particle counts, directly addressing key limitations of SMC such as particle impoverishment and mode collapse. Crucially, PS achieves this without additional likelihood evaluations-weights for persistent particles are computed using cached likelihood values. This framework not only yields more accurate posterior approximations but also produces marginal likelihood estimates with significantly lower variance, enhancing reliability in model comparison. Furthermore, the persistent ensemble enables efficient adaptation of transition kernels by leveraging a larger, decorrelated particle pool. Experiments on high-dimensional Gaussian mixtures, hierarchical models, and non-convex targets demonstrate that PS consistently outperforms standard SMC and related variants, including recycled and waste-free SMC, achieving substantial reductions in mean squared error for posterior expectations and evidence estimates, all at reduced computational cost. PS thus establishes itself as a robust, scalable, and efficient alternative for complex Bayesian inference tasks.

Karamanis, Minas↗
DOE OSTI2020

Distributed non-negative matrix factorization with determination of the number of latent features

The holistic analysis and understanding of the latent (that is, not directly observable) variables and patterns buried in large datasets is crucial for data-driven science, decision making and emergency response. Such exploratory analyses require devising unsupervised learning methods for data mining and extraction of the latent features, and non-negative matrix factorization (NMF) is one of the prominent such methods. NMF is based on compute-intense non-convex constrained minimization, which, for large datasets requires fast and distributed algorithms. However, current parallel implementations of NMF fail to estimate the number of latent features. In practice, identifying these features is both difficult and significant for pattern recognition and latent feature analysis, especially for large dense matrices. Here, we introduce a distributed NMF algorithm coupled with distributed custom clustering followed by a stability analysis on dense data, which we call DnMFk, to determine the number of latent variables. The results on synthetic data and the classical Swimmer data set demonstrate the accuracy of model determination while scaling nearly linearly across multiple processors for large data. Further, we employ DnMFk to determine the number of hidden features from a terabyte matrix.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multi-objective surrogate-assisted calibration of CPFEM models using macroscopic response and in situ EBSD measurements of grain reorientation trajectories

Crystal plasticity finite element method (CPFEM) models are widely used to simulate the deformation behaviour of polycrystalline materials, but their calibration is often limited by their high computational cost and the non-convexity of the optimisation landscape. Here, this study develops a multi-objective surrogate-assisted calibration workflow that couples a multi-objective genetic algorithm (MOGA) with an adaptively trained deep neural network (DNN) surrogate model to efficiently identify CPFEM parameters from experimental data. The workflow is demonstrated on three crystal plasticity (CP) formulations of increasing complexity — Voce hardening (VH), two-coefficient latent hardening (LH2), and six-coefficient latent hardening (LH6) — using in situ electron backscatter diffraction (EBSD) measurements of Alloy 617 under uniaxial tensile loading. The CPFEM models are calibrated against the experimentally observed stress–strain response and reorientation trajectories of eight grains, then validated against eight additional trajectories and overall texture evolution. Across the CP formulations, the macroscopic response was reproduced reliably, while differences emerged in the robustness and accuracy of the grain-scale predictions. Including grain reorientation trajectories in the multi-objective calibration improved texture evolution predictions and filtered out physically inconsistent parameter sets that can arise from calibrating against only the stress–strain data. The workflow also demonstrates good transferability of calibrated parameters from a low- to a high-fidelity microstructural model. These results provide practical guidance for integrating in situ microstructural data into CPFEM through efficient, repeatable, and physically meaningful multi-objective calibration.

Crystal plasticity finite element method↗
DOE OSTI2023

Fourier-DeepONet: Fourier-enhanced deep operator networks for full waveform inversion with improved accuracy, generalizability, and robustness

In this article, full waveform inversion (FWI) infers the subsurface structure information from seismic waveform data by solving a non-convex optimization problem. Data-driven FWI has been increasingly studied with various neural network architectures to improve accuracy and computational efficiency. Nevertheless, the applicability of pre-trained neural networks is severely restricted by potential discrepancies between the source function used in the field survey and the one utilized during training. Here, we develop a Fourier-enhanced deep operator network (Fourier-DeepONet) for FWI with the generalization of seismic sources, including the frequencies and locations of sources. Specifically, we employ the Fourier neural operator as the decoder of DeepONet, and we utilize source parameters as one input of Fourier-DeepONet, facilitating the resolution of FWI with variable sources. To test Fourier-DeepONet, we develop three new and realistic FWI benchmark datasets (FWI-F, FWI-L, and FWI-FL) with varying source frequencies, locations, or both. Our experiments demonstrate that compared with existing data-driven FWI methods, Fourier-DeepONet obtains more accurate predictions of subsurface structures in a wide range of source parameters. Moreover, the proposed Fourier-DeepONet exhibits superior robustness when handling data with Gaussian noise or missing traces and sources with Gaussian noise, paving the way for more reliable and accurate subsurface imaging across diverse real conditions.

42 ENGINEERING↗
DOE OSTI2024

A quasi-meshfree method for constructing boundary-aware reproducing bases on geometrically complex domains using manifold geodesics

In many applications, physical domains are geometrically complex making it challenging to perform coarse-scale approximation. A defeaturing process is often used to simplify the domain in preparation for approximation and analysis at the coarse scale. In this paper, a methodology is presented for constructing a coarse-scale reproducing basis on geometrically complex domains given an initial fine-scale mesh of the fully featured domain. The initial fine-scale mesh can be of poor quality and extremely refined. The construction of the basis functions begins with a coarse-scale covering of the domain and generation of weighting functions with local support. Manifold geodesics are used to define distances within the local support for general applicability to non-convex domains. Conventional moving least squares is used to construct the coarse-scale reproducing basis. Applications in quasi-interpolation and linear elasticity are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗
DOE OSTI2022

A hybrid robust-stochastic optimization approach for day-ahead scheduling of cascaded hydroelectric system in restructured electricity market

Uncertainties arising from complicated natural and market environments pose great challenges for the efficient operation of cascaded hydroelectric systems. To overcome these challenges, this paper studies the day-ahead scheduling of cascaded hydroelectric systems in a restructured electricity market with the presence of uncertainties in electricity price and natural water inflow. To properly model the uncertainty, we consider the unique characteristics of these two types of uncertainties and capture them via the uncertainty set and stochastic scenarios, respectively. Further, a hybrid robust-stochastic optimization model is developed to simultaneously hedge against these two types of uncertainties, which is formulated as a large-scale non-convex optimization problem with mixed integer recourse. After introducing linearization of nonlinear terms, a tailored hybrid decomposition scheme combining Lagrangian relaxation and Dantzig-Wolfe decomposition is adopted to achieve efficient computation of the proposed model. Two real-world cases are conducted to demonstrate the capability and characteristics of the proposed model and algorithms.

13 HYDRO ENERGY↗
DOE OSTI2023

Uncertain characterization of reservoir fluids due to brittleness of equation of state regression

Equations of state (EoS) play a central role in modeling the phase equilibrium of fluid mixtures. Their parameterization involves fitting a model to experimental data, i.e., solving a nonlinear, non-convex, multivariate optimization problem. The latter requires one to select design variables, domains of definition for each variable, and weights assigned to individual measurements. We demonstrate that subjective choices of an optimization algorithm and an initial guess also impact the regression process. Consequently, EoS predictions are fundamentally uncertain even after the EoS tuning to a limited set of experimental data points. We demonstrate this observation for two hydrocarbon reservoir fluids, in which five properties of the heaviest carbon fraction are treated as design variables. While all the optimization algorithms and initial guesses match experimental data for the gas and liquid properties, the resulting EoS parameterizations lead to dramatically different predictions of the fluid’s thermophysical behavior in the unsampled pressure and temperature regions. In conclusion, we propose the probabilistic treatment of design variables to quantify the predictive uncertainty of the resulting fluid models.

15 GEOTHERMAL ENERGY↗
DOE OSTI2020

nPINNs: Nonlocal physics-informed neural networks for a parametrized nonlocal universal Laplacian operator. Algorithms and applications

Physics-informed neural networks (PINNs) are effective in solving inverse problems based on differential and integro-differential equations with sparse, noisy, unstructured, and multifidelity data. PINNs incorporate all available information, including governing equations (reflecting physical laws), initial-boundary conditions, and observations of quantities of interest, into a loss function to be minimized, thus recasting the original problem into an optimization problem. In this paper, we extend PINNs to parameter and function inference for integral equations such as nonlocal Poisson and nonlocal turbulence models, and we refer to them as nonlocal PINNs (nPINNs). The contribution of the paper is three-fold. First, we propose a unified nonlocal Laplace operator, which converges to the classical Laplacian as one of the operator parameters, the nonlocal interaction radius $\delta$ goes to zero, and to the fractional Laplacian as $\delta$ goes to infinity. This universal operator forms a super-set of classical Laplacian and fractional Laplacian operators and, thus, has the potential to fit a broad spectrum of data sets. We also provide theoretical convergence rates with respect to $\delta$ and verify them via numerical experiments. Second, we use nPINNs to estimate the two parameters, $\delta$ and $\alpha$, characterizing the kernel of the unified operator. The strong non-convexity of the loss function yielding multiple (good) local minima reveals the occurrence of the operator mimicking phenomenon, that is, different pairs of estimated parameters could produce multiple solutions of comparable accuracy. Third, we propose another nonlocal operator with spatially variable order $\alpha(y)$, which is more suitable for modeling turbulent Couette flow. Our results show that nPINNs can jointly infer this function as well as $\delta$. More importantly, these parameters exhibit a universal behavior with respect to the Reynolds number, a finding that contributes to our understanding of nonlocal interactions in wall-bounded turbulence.

97 MATHEMATICS AND COMPUTING↗