Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “constrained 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

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↗

Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs

We extend and improve recent results given by Singh and Watson on using classical bounds on the union of sets in a chance-constrained optimization problem. Specifically, we revisit the so-called Dawson and Sankoff bound that provided one of the best approximations of a chance constraint in the previous analysis. Next, we show that our work is a generalization of the previous work, and in fact the inequality employed previously is a very relaxed approximation with assumptions that do not generally hold. Computational results demonstrate on average over a 43% improvement in the bounds. As a byproduct, we provide an exact reformulation of the floor function in optimization models.

97 MATHEMATICS AND COMPUTING↗

Combining model-based and model-free methods for stochastic control of distributed energy resources

Modern distribution systems are experiencing a fast transformation with the growing penetration of distributed energy resources (DERs). Along with the economic and environmental benefits of DERs, challenges arise to address the uncertainties caused by their inherent volatility. If properly coordinated, however, DERs have the potential to provide the controllability that grid operators need. Here, we propose a hierarchical control framework that combines the model-based and model-free methods for stochastic DER control in distribution systems. The upper-level scheduler considers a chance-constrained optimal power flow problem (model-based) that schedules DER setpoints to minimize the operational cost and maintain the operating reserve. The lower-level distributed DER controllers absorb real-time disturbances and uncertainties using the extremum seeking control (model-free) to achieve grid objectives. The combination of model-based and model-free methods allows us to take the advantages of both methods to effectively manage the uncertainty in distribution systems. The proposed work is demonstrated on the IEEE 13-node feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Learning viscoelasticity models from indirect data using deep neural networks

In this study, we propose a novel approach to model viscoelasticity materials, where rate-dependent and non-linear constitutive relationships are approximated with deep neural networks. We assume that inputs and outputs of the neural networks are not directly observable, and therefore common training techniques with input–output pairs for the neural networks are inapplicable. To that end, we develop a novel computational approach to both calibrate parametric and learn neural-network-based constitutive relations of viscoelasticity materials from indirect displacement data in the context of multiple-physics systems. We show that limited displacement data holds sufficient information to quantify the viscoelasticity behavior. We formulate the inverse computation – modeling viscoelasticity properties from observed displacement data – as a PDE-constrained optimization problem and minimize the error functional using a gradient-based optimization method. The gradients are computed by a combination of automatic differentiation and implicit function differentiation rules. The effectiveness of our method is demonstrated through numerous benchmark problems in geomechanics and porous media transport.

97 MATHEMATICS AND COMPUTING↗

A direct-adjoint approach for material point model calibration with application to plasticity

Here, this paper proposes a new approach for the calibration of material parameters in local elastoplastic constitutive models. The calibration is posed as a constrained optimization problem, where the constitutive model evolution equations for a single material point serve as constraints. The objective function quantifies the mismatch between the stress predicted by the model and corresponding experimental measurements. To improve calibration efficiency, a novel direct-adjoint approach is presented to compute the Hessian of the objective function, which enables the use of second-order optimization algorithms. Automatic differentiation is used for gradient and Hessian computations. Two numerical examples are employed to validate the Hessian matrices and to demonstrate that the Newton–Raphson algorithm consistently outperforms gradient-based algorithms such as L-BFGS-B.

36 MATERIALS SCIENCE↗

The distribution-based remapping of the nodal mass and momentum between arbitrary meshes for staggered arbitrary Lagrangian-Eulerian hydrodynamics

We present a new distribution-based remapping of the nodal mass and momentum between arbitrary source (Lagrangian) and arbitrary target (rezoned) meshes for indirect staggered arbitrary Lagrangian-Eulerian hydrodynamics. Here, the method is based on the following ideas: define cell-centered momentum and mass on the source mesh; conservatively remap those cell-centered quantities from source to target meshes; and use local constrained optimization for each cell of the target mesh to conservatively distribute cell mass and momentum to the nodes of the cell. This new method is efficient, conservative, accurate and bounds preserving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extremized nonlinear and linearized responses in soft metamaterials enabled by gradient-based design and grayscale digital light processing

In this study, we develop a gradient-based design approach that exploits grayscale digital light processing (DLP) 3D printing for extremizing the nonlinear and linearized response of soft metamaterials — materials that harness engineered geometric instabilities to undergo large and programmable changes in configuration. Grayscale DLP approaches modulate local mechanical properties at the pixel scale by tuning the light intensity within a single grayscale image, unlocking an exceptionally large design space. To effectively navigate this space, we develop smooth mappings between local light intensity values and global quantities of interest that characterize the behavior of soft metamaterials. Enabling these smooth mappings are robust and differentiable nonlinear finite element simulations powered by a trust region solver. A PDE-constrained optimization problem is then solved to invert these mappings and produce light intensity distributions that endow the printed part with varying stiffness and flexibility in distinctive regions. It is shown that optimizing the distribution of soft and stiff phases throughout a metamaterial structure results in markedly different buckling and self-contact configurations to drive extremized nonlinear compression and linearized vibration responses. Optimized light intensity distributions are translated to grayscale images and directly used to print soft metamaterial samples, showing remarkable agreement between the buckling and self-contact response in simulated and measured deformed configurations.

Additive manufacturing↗

Automatic voltage regulation application for PV inverters in low-voltage distribution grids – A digital twin approach

This paper proposes a hierarchical coordinated control strategy for PV inverters to keep voltages in low-voltage (LV) distribution grids within specified limits. The top layer of the proposed architecture consists of the designed automatic voltage regulation (AVR) application, which has access to voltage measurements and grid parameters from the LV distribution grid, both current and historical. The AVR application solves a constrained optimization problem, which provides a set of local control set-points that bring the voltage across the grid within bounds. The middle layer consists of a local Volt/VAR controller, which is adjusted by the AVR app, while the bottom layer is the inner-loop controller of the PV inverter. The proposed method not only improves the voltage quality in the grid but also manages the reactive power outputs of PV inverters efficiently. Further, a digital twin of the cyber-physical system has also been employed that interacts with the control system to ensure its appropriate operation. The effectiveness of the proposed methodology is demonstrated on a representative low-voltage feeder located in Denmark.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Moments-based interface reconstruction, remap and advection

Here, we present a new moment-of-fluid (MOF 2 ) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to reconstruct a convex material polygon or a union of convex polygons that approximate the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The MOF 2 method allows to exactly reproduce several convex shapes: corners, filaments, and some concave shapes: cell-complements to corners and filaments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. We present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on a variety of meshes. We describe how to perform two-material advection using the MOF 2 method and present the results for the classical advection tests. We also show the examples of material interface remapping needed in the framework of multi-material arbitrary Lagrangian-Eulerian methods, and give a brief description of a procedure that can be used to update the material moments on the Lagrangian stage of those methods.

97 MATHEMATICS AND COMPUTING↗

An adaptive moments-based interface reconstruction using intersection of the cell with one half-plane, two half-planes and a circle

We present a new adaptive moment-of-fluid (A-MOF) interface reconstruction method. It uses the zeroth, first, and second moments of the fragment of material inside a cell of the mesh to construct a shape that approximates the respective material fragment. The new method requires information about the material moments only for the cell under consideration. The adaptive method chooses between shapes obtained by the intersection of the cell with one half-plane, two half-planes, or a circle. The A-MOF method allows to exactly reproduce several convex shapes: corners, filaments, and their concave cell-complements; as well as pieces of the circles and its cell-compliments. Interface reconstruction is formulated as a local (for each cell), non-linear, equality constrained optimization problem, which does not require additional communication and allows for an efficient parallel implementation. In conclusion, we present an extensive set of test problems, both for interface reconstruction on a single cell, and for reconstruction of a variety of shapes on the entire mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A phase-field fracture formulation for generalized standard materials: The interplay between thermomechanics and damage

Accurately modeling fracture of ductile materials poses open challenges in the field of computational mechanics due to the multiphysics nature of their failure processes. Integrating the interplay between thermodynamics and damage into ductile fracture models is vital for predicting critical failure modes. Here, in this paper, we develop a versatile phase-field (PF) framework for modeling ductile fracture, taking into account finite-strain elasto-plasticity. The framework stems from a variational formulation of constitutive relations for generalized standard materials (GSMs), whose response is described by a Helmholtz free energy and a dissipation pseudo-potential. Its variational structure is based on a minimum principle for a functional that expresses the sum of power densities for reversible and irreversible processes. By minimizing this functional with a constraint on a von Mises yield function, we derive the evolution equation for the equivalent plastic strain and an associative flow rule. This constrained optimization problem is analytically solved for a wide class of thermo-viscoplasticity models. The key innovations of the current work include (i) a cubic plastic degradation function that accounts for a non-vanishing damage-dependent yield stress, (ii) closed-form expressions of the Helmholtz free energy and dissipation pseudo-potential for three thermo-viscoplasticity models, (iii) an extended Johnson–Cook plasticity model with a nonlinear hardening law, and (iv) a plastic work heat source that depends on the plastic degradation function and a variable Taylor–Quinney (TQ) coefficient. The capabilities of the proposed framework are tested with the aid of four ductile fracture problems, including the Sandia Fracture Challenge. In each of these problems, we examine the evolution of relevant field variables such as the PF order parameter, the equivalent plastic strain, the temperature, and the internal power dissipation density, in addition to the overall structural response quantified by the force–displacement curve. These numerical studies demonstrate that the proposed framework effectively represents ductile fracture, yielding computational results that exhibit good agreement with experimental data.

36 MATERIALS SCIENCE↗

Machine learning-guided discovery of polymer membranes for CO 2 separation with genetic algorithm

Designing polymer membranes with high gas permeability and selectivity is a difficult multi-task constrained problem due to the trade-off between these two properties. In this work, we present a machine learning (ML) driven genetic algorithm to tackle the design problem of polymer membranes for CO 2 separation from N 2 and O 2 . Using literature data of permeability for three gases, we constructed multiple ML models with different fingerprinting featurization schemes to predict gas permeabilities. Then, we employed a genetic algorithm to design new polymers and evaluated their performance using our ML models. We were able to identify new polymer membranes that are promising for both CO 2 /N 2 and CO 2 /O 2 separations. Further, the top discovered polymers are predicted to have high glass transition temperatures. Similarly, the pyridine functionality was found in ≈20% of the predicted polymers. This framework can be used to design polymers for any application involving constrained optimization. Finally, we outlined the challenges and opportunities with using ML guided data-driven inverse design of polymers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Minimum-Energy Conical Intersections by Compressed Multistate Pair-Density Functional Theory

Compressed multistate pair-density functional theory (CMS-PDFT) is a multistate version of multiconfiguration pair-density functional theory that can capture the correct topology of coupled potential energy surfaces (PESs) around conical intersections. Here, in this work, we develop interstate coupling vectors (ISCs) for CMS-PDFT in the OpenMolcas and PySCF/mrh electronic structure packages. Yet, the main focus of this work is using ISCs to calculate minimum-energy conical intersections (MECIs) by CMS-PDFT. This is performed using the projected constrained optimization method in OpenMolcas, which uses ISCs to restrain the iterations to the conical intersection seam. We optimize the S 1 /S 0 MECIs for ethylene, butadiene, and benzene and show that CMS-PDFT gives smooth PESs in the vicinities of the MECIs. Furthermore, the CMS-PDFT MECIs are in good agreement with the MECI calculated by the more expensive XMS-CASPT2 method.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Learning heterogeneous reaction kinetics from X-ray videos pixel by pixel

Reaction rates at spatially heterogeneous, unstable interfaces are notoriously difficult to quantify, yet are essential in engineering many chemical systems, such as batteries and electrocatalysts. Experimental characterizations of such materials by operando microscopy produce rich image datasets, but data-driven methods to learn physics from these images are still lacking because of the complex coupling of reaction kinetics, surface chemistry and phase separation. Here we show that heterogeneous reaction kinetics can be learned from in situ scanning transmission X-ray microscopy (STXM) images of carbon-coated lithium iron phosphate (LFP) nanoparticles. Combining a large dataset of STXM images with a thermodynamically consistent electrochemical phase-field model, partial differential equation (PDE)-constrained optimization and uncertainty quantification, we extract the free-energy landscape and reaction kinetics and verify their consistency with theoretical models. We also simultaneously learn the spatial heterogeneity of the reaction rate, which closely matches the carbon-coating thickness profiles obtained through Auger electron microscopy (AEM). Across 180,000 image pixels, the mean discrepancy with the learned model is remarkably small (<7%) and comparable with experimental noise. Our results open the possibility of learning nonequilibrium material properties beyond the reach of traditional experimental methods and offer a new non-destructive technique for characterizing and optimizing heterogeneous reactive surfaces.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exact Gaussian processes for massive datasets via non-stationary sparsity-discovering kernels

Abstract A Gaussian Process (GP) is a prominent mathematical framework for stochastic function approximation in science and engineering applications. Its success is largely attributed to the GP’s analytical tractability, robustness, and natural inclusion of uncertainty quantification. Unfortunately, the use of exact GPs is prohibitively expensive for large datasets due to their unfavorable numerical complexity of $$O(N^3)$$ O ( N 3 ) in computation and $$O(N^2)$$ O ( N 2 ) in storage. All existing methods addressing this issue utilize some form of approximation—usually considering subsets of the full dataset or finding representative pseudo-points that render the covariance matrix well-structured and sparse. These approximate methods can lead to inaccuracies in function approximations and often limit the user’s flexibility in designing expressive kernels. Instead of inducing sparsity via data-point geometry and structure, we propose to take advantage of naturally-occurring sparsity by allowing the kernel to discover—instead of induce—sparse structure. The premise of this paper is that the data sets and physical processes modeled by GPs often exhibit natural or implicit sparsities, but commonly-used kernels do not allow us to exploit such sparsity. The core concept of exact, and at the same time sparse GPs relies on kernel definitions that provide enough flexibility to learn and encode not only non-zero but also zero covariances. This principle of ultra-flexible, compactly-supported, and non-stationary kernels, combined with HPC and constrained optimization, lets us scale exact GPs well beyond 5 million data points.

97 MATHEMATICS AND COMPUTING↗

Phenalenyl growth reactions and implications for prenucleation chemistry of aromatics in flames

The energetics and kinetics of phenalene and phenalenyl growth reactions were studied theoretically. Rate constants of phenalene and phenalenyl H-abstraction and C 2 H 2 addition to the formed radicals were evaluated through quantum-chemical and rate-theory calculations. The obtained values, assigned to all π radicals, were tested in deterministic and kinetic Monte Carlo simulations of aromatics growth under conditions of laminar premixed flames. Kekulé and non-Kekulé structures of the polycyclic aromatic hydrocarbons (PAHs) evolving in the stochastic simulations were identified by on-the-fly constrained optimization. The numerical results demonstrated an increased PAH growth and qualitatively reproduced experimental observations of Homann and co-workers of non-decaying PAH concentrations with nearly equal abundances of even and odd carbon-atom PAHs. The analysis revealed that the PAH growth proceeds via alternating and sterically diverse acetylene and methyl HACA additions. Furthermore, the rapid and diverse spreading in the PAH population supports a nucleation model as PAH dimerization, assisted by the non-equilibrium phenomena, forming planar aromatics first and then transitioning to the PAH–PAH stacking with size.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast methods for multisite charge transfer processes. I. Constrained, state averaged CASSCF(1,n) and CASSCF(2n − 1,n) simulations

We design a dynamically weighted state-averaged constrained complete active space self-consistent field (DW-SA-cCASSCF) algorithm to treat electrons or holes moving between n molecular fragments (where n can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider configurations that are mutually single excitations of each other, and we apply a generalized set of constraints to tailor the method for studying charge transfer problems. The constrained optimization problem is efficiently solved using a DIIS-SQP algorithm, thus maintaining computational efficiency. We demonstrate the method for a finite Su–Schrieffer–Heeger chain, successfully reproducing the expected exponential decay of diabatic couplings with distance. When combined with a gradient, the current extension immediately enables efficient nonadiabatic dynamics simulations of complex multi-state charge transfer processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

97 MATHEMATICS AND COMPUTING↗