Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Inverse 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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS2019

Is There an Optimal CO2 Partial Column for Flux Inversions?

The fidelity of flux estimates from an atmospheric inversion depends on the ability of atmospheric transport models to simulate the measured quantity. For species such as CO2, with surface fluxes and a large network of surface measurements, this means correctly simulating the dynamics of the planetary boundary layer (PBL), which is one of the most uncertain aspects of atmospheric transport modeling. In contrast, the simulated total column average mole fraction of CO2 (XCO2) is largely insensitive to simulated PBL dynamics. Therefore, measurements of XCO2 provided by current and future short wave infrared (SWIR) greenhouse gas (GHG) satellites such as GOSAT and the OCO family would seem to be more appropriate to flux inversions, as far as minimizing transport model errors (the "noise") is concerned. Unfortunately, the flux-induced variation of CO2 (the "signal") is the largest within the PBL and smallest in XCO2. Therefore, assimilating XCO2 as opposed to PBL CO2 need not give us the strongest "signal to noise" in flux inversions. Recent work on GOSAT and OCO2 retrievals suggest that SWIR satellite spectra may be used to estimate a lower partial column CO2, which could be assimilated in a flux inversion, instead of XCO2.Here we report on a study to assess whether there is an optimal partial column average CO2, intermediate between PBL CO2 and XCO2, whose assimilation might yield the best signal to noise in flux inversions, where (as before) "signal" is the flux-induced variation and "noise" is the error in transport modeling. We simulate atmospheric CO2 with five different global transport models and a common surface CO2 flux over ten years. We consider the spread across the five models to be a proxy for transport model error (the "noise"), and the common variation of CO2 in all five models to be a proxy for the "signal". We compare these signals and noises at different spatiotemporal scales for different partial column specifications to investigate whether there exists an optimal partial column that has large surface flux-driven variations and yet is relatively insensitive to errors in transport models. Finally, we comment on the feasibility of estimating such a partial column from current and future SWIR GHG satellites in the light of recent work on vertically resolved CO2 from current SWIR GHG satellites.

Basu, Sourish↗
DOE OSTI2019

Direct and Inverse Problems of Thermomechanics Concerning the Optimization and Identification of the Thermal Stressed State of Deformed Solids

We describe the main stages of the development of investigations originated by Prof. Vihak in the fields of the theory and methods of optimal control over the thermal processes and thermal stressed state of deformed solids, theory of inverse problems of heat conduction and thermomechanics, and the mathematical methods in the mechanics of deformable solids. We indicate the existence of close relationship between the obtained theoretical results and the applied problems of thermal power engineering motivating investigations of this kind. We describe a significant contribution made by the researchers of the Pidstryhach Institute for Applied Problems in Mechanics and Mathematics of the Ukrainian National Academy of Sciences to the development of investigations in these fields. The prospects of further development of these studies are analyzed and some facts from the life and creative activity of Prof. V. М. Vihak are presented.

42 ENGINEERING↗
DOE OSTI2021

Reinforcement learning in discrete action space applied to inverse defect design

Abstract Reinforcement learning (RL) algorithms that include Monte Carlo Tree Search (MCTS) have found tremendous success in computer games such as Go, Shiga and Chess. Such learning algorithms have demonstrated super-human capabilities in navigating through an exhaustive discrete action search space. Motivated by their success in computer games, we demonstrate that RL can be applied to inverse materials design problems. We deploy RL for a representative case of the optimal atomic scale inverse design of extended defects via rearrangement of chalcogen (e.g. S) vacancies in 2D transition metal dichalcogenides (e.g. MoS 2 ). These defect rearrangements and their dynamics are important from the perspective of tunable phase transition in 2D materials i.e. 2H (semi-conducting) to 1T (metallic) in MoS 2 . We demonstrate the ability of MCTS interfaced with a reactive molecular dynamics simulator to efficiently sample the defect phase space and perform inverse design—starting from randomly distributed S vacancies, the optimal defect rearrangement of defects corresponds a line defect of S vacancies. We compare MCTS performance with evolutionary optimization i.e. genetic algorithms and show that MCTS converges to a better optimal solution (lower objective) and in fewer evaluations compared to GA. We also comprehensively evaluate and discuss the effect of MCTS hyperparameters on the convergence to solution. Overall, our study demonstrates the effectives of using RL approaches that operate in discrete action space for inverse defect design problems.

42 ENGINEERING↗
DOE OSTI2018

Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems

We develop a framework for goal-oriented optimal design of experiments (GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This framework differs from classical Bayesian optimal design of experiments (ODE) in the following sense: we seek experimental designs that minimize the posterior uncertainty in the experiment end-goal, e.g. a quantity of interest (QoI), rather than the estimated parameter itself. This is suitable for scenarios in which the solution of an inverse problem is an intermediate step and the estimated parameter is then used to compute a QoI. In such problems, a GOODE approach has two benefits: the designs can avoid wastage of experimental resources by a targeted collection of data, and the resulting design criteria are computationally easier to evaluate due to the often low-dimensionality of the QoIs. We present two modified design criteria, A-GOODE and D-GOODE, which are natural analogues of classical Bayesian A- and D-optimal criteria. We analyze the connections to other ODE criteria, and provide interpretations for the GOODE criteria by using tools from information theory. Then, we develop an efficient gradient-based optimization framework for solving the GOODE optimization problems. Additionally, we present comprehensive numerical experiments testing the various aspects of the presented approach. The driving application is the optimal placement of sensors to identify the source of contaminants in a diffusion and transport problem. As a result, we enforce sparsity of the sensor placements using an L1-norm penalty approach, and propose a practical strategy for specifying the associated penalty parameter.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Modeling the Absorbing Aerosol Index

We propose a scheme to model the absorbing aerosol index and improve the biomass carbon inventories by optimizing the difference between TOMS aerosol index (AI) and modeled AI with an inverse model. Two absorbing aerosol types are considered, including biomass carbon and mineral dust. A priori biomass carbon source was generated by Liousse et al [1996]. Mineral dust emission is parameterized according to surface wind and soil moisture using the method developed by Ginoux [2000]. In this initial study, the coupled CCM1 and GRANTOUR model was used to determine the aerosol spatial and temporal distribution. With modeled aerosol concentrations and optical properties, we calculate the radiance at the top of the atmosphere at 340 nm and 380 nm with a radiative transfer model. The contrast of radiance at these two wavelengths will be used to calculate AI. Then we compare the modeled AI with TOMS AI. This paper reports our initial modeling for AI and its comparison with TOMS Nimbus 7 AI. For our follow-on project we will model the global AI with aerosol spatial and temporal distribution recomputed from the IMPACT model and DAO GEOS-1 meteorology fields. Then we will build an inverse model, which applies a Bayesian inverse technique to optimize the agreement of between model and observational data. The inverse model will tune the biomass burning source strength to reduce the difference between modelled AI and TOMS AI. Further simulations with a posteriori biomass carbon sources from the inverse model will be carried out. Results will be compared to available observations such as surface concentration and aerosol optical depth.

Penner, Joyce↗
NASA NTRS1992

Trajectory optimization for the National Aerospace Plane

The primary objective of this research is to develop an efficient and robust trajectory optimization tool for the optimal ascent problem of the National Aerospace Plane (NASP). This report is organized in the following order to summarize the complete work: Section two states the formulation and models of the trajectory optimization problem. An inverse dynamics approach to the problem is introduced in Section three. Optimal trajectories corresponding to various conditions and performance parameters are presented in Section four. A midcourse nonlinear feedback controller is developed in Section five. Section six demonstrates the performance of the inverse dynamics approach and midcourse controller during disturbances. Section seven discusses rocket assisted ascent which may be beneficial when orbital altitude is high. Finally, Section eight recommends areas of future research.

Lu, Ping↗
DOE OSTI2021

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A memory-distributed quasi-Newton solver for nonlinear programming problems with a small number of general constraints

We approach the problem of parallelizing state-of-the-art nonlinear programming optimization algorithms.Specifically, we focus on parallelizing quasi-Newton interior-point methods that use limited-memory secant Hessian approximations. Such interior-point methods are known to have better convergence properties and to be more effective on large-scale problems than gradient-based and derivative-free optimization algorithms. We target nonlinear and potentially nonconvex optimization problems with an arbitrary number of bound constraints and a small number of general equality and inequality constraints on the optimization variables. These problems occur for example in the form of optimal control, optimal design, and inverse problems governed by ordinary or partial differential equations, whenever they are expressed in a “reduced-space” optimization approach. We introduce and analyze the time and space complexity of a decomposition method for solving the quasi-Newton linear systems that leverages the fact that the quasi-Newton Hessian matrix has a small number of dense blocks that border a low-rank update of a diagonal matrix. This enables an efficient parallelization on memory-distributed computers of the iterations of the optimization algorithm, a state-of-the-art filter line-search interior-point algorithm by Wächter et. al. We illustrate the efficiency of the proposed method by solving structural topology optimization problems on up to 4608 cores on a parallel machine.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

MO-FG-BRA-08: Swarm Intelligence-Based Personalized Respiratory Gating in Lung SAbR

Purpose: Respiratory gating is widely deployed as a clinical motion-management strategy in lung radiotherapy. In conventional gating, the beam is turned on during a pre-determined phase window; typically, around end-exhalation. In this work, we challenge the notion that end-exhalation is always the optimal gating phase. Specifically, we use a swarm-intelligence-based, inverse planning approach to determine the optimal respiratory phase and MU for each beam with respect to (i) the state of the anatomy at each phase and (ii) the time spent in that state, estimated from long-term monitoring of the patient’s breathing motion. Methods: In a retrospective study of five lung cancer patients, we compared the dosimetric performance of our proposed personalized gating (PG) with that of conventional end-of-exhale gating (CEG) and a previously-developed, fully 4D-optimized plan (combined with MLC tracking delivery). For each patient, respiratory phase probabilities (indicative of the time duration of the phase) were estimated over 2 minutes from lung tumor motion traces recorded previously using the Synchrony system (Accuray Inc.). Based on this information, inverse planning optimization was performed to calculate the optimal respiratory gating phase and MU for each beam. To ensure practical deliverability, each PG beam was constrained to deliver the assigned MU over a time duration comparable to that of CEG delivery. Results: Maximum OAR sparing for the five patients achieved by the PG and the 4D plans compared to CEG plans was: Esophagus Dmax [PG:57%, 4D:37%], Heart Dmax [PG:71%, 4D:87%], Spinal cord Dmax [PG:18%, 4D:68%] and Lung V13 [PG:16%, 4D:31%]. While patients spent the most time in exhalation, the PG-optimization chose end-exhale only for 28% of beams. Conclusion: Our novel gating strategy achieved significant dosimetric improvements over conventional gating, and approached the upper limit represented by fully 4D optimized planning while being significantly simpler and more clinically translatable. This work was partially supported through research funding from National Institutes of Health (R01CA169102) and Varian Medical Systems, Palo Alto, CA, USA.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Inverse mapping of properties to composition through generative modeling for designing molten salts

Generative modeling (GM) has been increasingly used for the inverse design and optimization of materials, yet its application to molten salt mixtures remains unexplored despite how a successful approach to the inverse design of molten salts would contribute to efficiently exploiting their customizability and unlocking their advantages in applications, such as energy production and energy storage. This work presents a workflow for the inverse design of molten salts with targeted density values, addressing the challenge of representing these complex mixtures in GM. A dataset of critically evaluated molten salt densities is used to train a variational autoencoder coupled with a predictive deep neural network, which then can be used to generate new molten salt compositions with desired density values. The effectiveness of the approach is demonstrated by designing mixtures with distinct densities and validating the predicted values using ab initio molecular dynamics simulations.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2015

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗