Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization problems”

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 1,639 records · Page 91

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

State elimination for mixed‐integer optimal control of partial differential equations by semigroup theory

Abstract Mixed‐integer optimal control problems governed by partial differential equations (MIPDECOs) are powerful modeling tools but also challenging in terms of theory and computation. We propose a highly efficient state elimination approach for MIPDECOs that are governed by partial differential equations that have the structure of an abstract ordinary differential equation in function space. This allows us to avoid repeated calculations of the states for all time steps, and our approach is applied only once before starting the optimization. The presentation of theoretical results is complemented by numerical experiments.

97 MATHEMATICS AND COMPUTING↗

On the robust optimization to the uncertain vaccination strategy problem

In order to prevent an epidemic of infectious diseases, the vaccination coverage needs to be minimized and also the basic reproduction number needs to be maintained below 1. This means that as we get the vaccination coverage as minimum as possible, thus we need to prevent the epidemic to a small number of people who already get infected. In this paper, we discuss the case of vaccination strategy in term of minimizing vaccination coverage, when the basic reproduction number is assumed as an uncertain parameter that lies between 0 and 1. We refer to the linear optimization model for vaccination strategy that propose by Becker and Starrzak (see [2]). Assuming that there is parameter uncertainty involved, we can see Tanner et al (see [9]) who propose the optimal solution of the problem using stochastic programming. In this paper we discuss an alternative way of optimizing the uncertain vaccination strategy using Robust Optimization (see [3]). In this approach we assume that the parameter uncertainty lies within an ellipsoidal uncertainty set such that we can claim that the obtained result will be achieved in a polynomial time algorithm (as it is guaranteed by the RO methodology). The robust counterpart model is presented.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Quasi-Stochastic Approximation and Off-Policy Reinforcement Learning: Preprint

The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning and often an efficient approach to solving (or approximating the solution to) complex optimal control problems. In many cases, however, practitioners are unable to apply these techniques because of an inherent high variance. This paper aims to provide a general foundation for 'quasi-stochastic approximation,' in which all of the processes under consideration are deterministic, much like quasi-Monte Carlo for variance reduction in simulation. The variance reduction can be substantial, subject to tuning of pertinent parameters in the algorithm. This paper introduces a new coupling argument to establish the optimal rate of convergence provided the gain is sufficiently large. These results are established for linear models and tested also in nonideal settings. A major application of these general results is a new class of reinforcement learning algorithms for deterministic state space models. In this setting, the main contribution is a class of algorithms for approximating the value function for a given policy, using a different policy designed to introduce exploration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Control of optical bistability and third-order nonlinearity via tunneling induced quantum interference in triangular quantum dot molecules

The optical bistability of a triangular quantum dot molecules embedded inside a unidirectional ring cavity is studied. The type, the threshold and the hysteresis loop of the optical bistability curves can be modified by the tunneling parameters, as well as the probe laser field. The linear and nonlinear susceptibilities of the medium are also studied to interpret the corresponding results. The physical interpretation is that the tunneling can induce the quantum interference, which modifies the linear and the nonlinear response of the medium. As a consequence, the characteristics of the optical bistability are changed. The scheme proposed here can be utilized for optimizing and controlling the optical switching process.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Progress on optimization of the nonlinear beam dynamics in the MEIC collider rings

One of the key design features of the Medium-energy Electron-Ion Collider (MEIC) proposed by Jefferson Lab is a small beta function at the interaction point (IP) allowing one to achieve a high luminosity of up to 10 34 cm -2 s -1 . The required strong beam focusing unavoidably causes large chromatic effects such as chromatic tune spread and beam smear at the IP, which need to be compensated. This paper reports recent progress in our development of a chromaticity correction scheme for the ion ring including optimization of dynamic aperture and momentum acceptance.

43 PARTICLE ACCELERATORS↗

The Early Exercise Premium Representation for American Options on Multiply Assets

In the paper we consider the problem of valuation of American options written on dividend-paying assets whose price dynamics follow the classical multidimensional Black and Scholes model. We provide a general early exercise premium representation formula for options with payoff functions which are convex or satisfy mild regularity assumptions. Examples include index options, spread options, call on max options, put on min options, multiply strike options and power-product options. In the proof of the formula we exploit close connections between the optimal stopping problems associated with valuation of American options, obstacle problems and reflected backward stochastic differential equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Bifurcation, chaos, and scan instability in dynamic atomic force microscopy

The dynamical motion at any point on the cantilever of an atomic force microscope can be expressed quite generally as a superposition of simple harmonic oscillators corresponding to the vibrational modes allowed by the cantilever shape. Central to the dynamical equations is the representation of the cantilever-sample interaction force as a polynomial expansion with coefficients that account for the interaction force “stiffness,” the cantilever-to-sample energy transfer, and the displacement amplitude of cantilever oscillation. Renormalization of the cantilever beam model shows that for a given cantilever drive frequency cantilever dynamics can be accurately represented by a single nonlinear mass-spring model with frequency-dependent stiffness and damping coefficients [S. A. Cantrell and J. H. Cantrell, J. Appl. Phys. 110, 094314 (2011)]. Application of the Melnikov method to the renormalized dynamical equation is shown to predict a cascade of period doubling bifurcations with increasing cantilever drive force that terminates in chaos. The threshold value of the drive force necessary to initiate bifurcation is shown to depend strongly on the cantilever setpoint and drive frequency, effective damping coefficient, nonlinearity of the cantilever-sample interaction force, and the displacement amplitude of cantilever oscillation. The model predicts the experimentally observed interruptions of the bifurcation cascade for cantilevers of sufficiently large stiffness. Operational factors leading to the loss of image quality in dynamic atomic force microscopy are addressed, and guidelines for optimizing scan stability are proposed using a quantitative analysis based on system dynamical parameters and choice of feedback loop parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A deterministic method for PWR loading pattern optimization

A new deterministic approach to core loading optimization is presented. Selection of fuel enrichment and burnable poison (BP) arrangement in a pressurized water reactor (PWR) core are optimally determined subject to power peaking factor (PF) constraints. The deterministic approach is based on the method of Lagrange multipliers and the direct adjoining approach for the inequality power PF constraint. The optimality conditions are derived using calculus of variations resulting in the presence of jump conditions and a linear control Hamiltonian. The optimal control problems are addressed by simultaneously minimizing the Hamiltonian using the gradient method and performing Newton's method in different regions of the core to produce viable solutions for the controls. Without active control of the power profile in PWRs during depletion, our methodology is able to satisfy the power PF constraint at all times by proper loading selection at the beginning of cycle (BOC). This is achieved by promoting the proper burnup path forward in time during the calculation of the forward optimality conditions. Here this information is utilized in the adjoint burnup calculation, which acts to propagate the optimal control path back to the BOC during the calculation of the adjoint optimality conditions. The methodology has been developed into a new code DMCO (Deterministic Multi-Control Optimization) which can produce two-dimensional two-group depletion results in approximately seven minutes per optimization iteration on a personal computer. No application of heuristics is required and the code is capable of finding solutions from initial control distributions. A preliminary case study is presented for the Westinghouse AP600 first cycle fuel loading design which achieved an extended fuel cycle while satisfying power PF constraints.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Asymptotic safety on the lattice: The nonlinear O(N) sigma model

We study the non-perturbative renormalization group flow of the nonlinear O(N) sigma model in two and three spacetime dimensions using a scheme that combines an effective local Hybrid Monte Carlo update routine, blockspin transformations and a Monte Carlo demon method. In two dimensions our results verify perturbative renormalizability. In three dimensions, we determine the flow diagram of the theory for various N and different truncations and find a non-trivial fixed point, which indicates non-perturbative renormalizability. It is related to the well-studied phase transition of the O(N) universality class and characterizes the continuum physics of the model. We compare the obtained renormalization group flows with recent investigations by means of the Functional Renormalization Group. - Highlights: • We compute the global flow diagram from lattice simulations. • Truncation of the effective action may lead to artificial fixed points. • Our optimization scheme effectively reduces truncation errors. • The Wilson–Fisher fixed point is identified as a non-trivial UV fixed point. • Asymptotic safety is realized for the 3D nonlinear sigma model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Equation-based languages – A new paradigm for building energy modeling, simulation and optimization

Most of the state-of-the-art building simulation programs implement models in imperative programming languages. This complicates modeling and excludes the use of certain efficient methods for simulation and optimization. In contrast, equation-based modeling languages declare relations among variables, thereby allowing the use of computer algebra to enable much simpler schematic modeling and to generate efficient code for simulation and optimization. We contrast the two approaches in this paper. We explain how such manipulations support new use cases. In the first of two examples, we couple models of the electrical grid, multiple buildings, HVAC systems and controllers to test a controller that adjusts building room temperatures and PV inverter reactive power to maintain power quality. In the second example, we contrast the computing time for solving an optimal control problem for a room-level model predictive controller with and without symbolic manipulations. As a result, exploiting the equation-based language led to 2, 200 times faster solution

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Operation of Natural Gas Pipeline Networks With Storage Under Transient Flow Conditions

Here, we formulate a nonlinear optimal control problem for intraday operation of a natural gas pipeline network that includes storage reservoirs. The dynamics of compressible gas flow through pipes, compressors, reservoirs, and wells are considered. In particular, a reservoir is modeled as a rigid, hollow container that stores gas under isothermal conditions and uniform density, and a well is modeled as a vertical pipe. For each pipe, flow dynamics are described by a coupled partial differential equation (PDE) system in density and mass flux variables, with momentum dissipation modeled using the Darcy–Wiesbach friction approximation. Compressors are modeled as scaling up the pressure of gas between the inlet and outlet. The governing equations for all network components are spatially discretized and assembled into a nonlinear differential-algebraic equation (DAE) system, which synthesizes above-ground pipeline and subsurface reservoir dynamics into a single reduced-order model. We seek to maximize an objective function that quantifies economic profit and network efficiency subject to the flow equations and inequalities that represent operating limitations. The problem is solved using a primal–dual interior point solver, and the solutions are validated in computational experiments and simulations on several pipeline test networks to demonstrate the effectiveness of the proposed methodology.

03 NATURAL GAS↗

An Evolutionary Algorithm to Personalize Stool-Based Colorectal Cancer Screening

Fecal immunochemical testing (FIT) is an established method for colorectal cancer (CRC) screening. Measured FIT-concentrations are associated with both present and future risk of CRC, and may be used for personalized screening. However, evaluation of personalized screening is computationally challenging. In this study, a broadly applicable algorithm is presented to efficiently optimize personalized screening policies that prescribe screening intervals and FIT-cutoffs, based on age and FIT-history. We present a mathematical framework for personalized screening policies and a bi-objective evolutionary algorithm that identifies policies with minimal costs and maximal health benefits. The algorithm is combined with an established microsimulation model (MISCAN-Colon), to accurately estimate the costs and benefits of generated policies, without restrictive Markov assumptions. The performance of the algorithm is demonstrated in three experiments. In Experiment 1, a relatively small benchmark problem, the optimal policies were known. The algorithm approached the maximum feasible benefits with a relative difference of 0.007%. Experiment 2 optimized both intervals and cutoffs, Experiment 3 optimized cutoffs only. Optimal policies in both experiments are unknown. Compared to policies recently evaluated for the USPSTF, personalized screening increased health benefits up to 14 and 4.3%, for Experiments 2 and 3, respectively, without adding costs. Generated policies have several features concordant with current screening recommendations. The method presented in this paper is flexible and capable of optimizing personalized screening policies evaluated with computationally-intensive but established simulation models. It can be used to inform screening policies for CRC or other diseases. For CRC, more debate is needed on what features a policy needs to exhibit to make it suitable for implementation in practice.

60 APPLIED LIFE SCIENCES↗

Nonlinear optimization for a tumor invasion PDE model

In this work, we introduce a methodology to approximate unknown parameters that appear on a non-linear reaction–diffusion model of tumor invasion. These equations consider that tumor-induced alteration of micro-environmental pH furnishes a mechanism for cancer invasion. A coupled system reaction–diffusion explaining this model is given by three partial differential equations for the non-dimensional spatial distribution and temporal evolution of the density of normal tissue, the neoplastic tissue growth and the excess concentration of H{sup +} ions. The tumor model parameters have a corresponding biological meaning: the reabsorption rate, the destructive influence of H{sup +} ions in the healthy tissue, the growth rate of tumor tissue and the diffusion coefficient. We propose to solve the direct problem using the Finite Element Method (FEM) and minimize an appropriate functional including both the real data (obtained via in-vitro experiments and fluorescence ratio imaging microscopy) and the numerical solution. The gradient of the functional is computed by the adjoint method.

60 APPLIED LIFE SCIENCES↗

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↗

Manufacturing and stiffness constraints for topology optimized periodic structures

Topology optimization (TO) is commonly applied to design the unit cells of periodic structures. For example, metamaterials, lattice structures, phononic crystals (PhC), and photonic crystals (PC) have all been previously designed via TO. Unfortunately, the optimal structures for certain design objectives, e.g., bandgaps, are often impossible to manufacture as they have disconnected regions or “islands” of solid material (ISM) that are not self-supporting. Additionally, designs with enclosed void space (EVS) are problematic for additive manufacturing (AM) since support material or pre-sintered powder cannot be removed after manufacturing. We present a series of constraints that may be incorporated into any TO framework to ensure structures are self-supporting without enclosed voids. Additionally, we employ homogenization-based constraints that allow the designer to tune the elastic stiffness and isotropy of the optimized design. The proposed constraints are evaluated on example microstructures and utilized in a simple optimization test problem to highlight their abilities and limitations so that guidelines for appropriate combinations of constraints may be proposed. Effective constraint combinations are demonstrated on the design of 3D photonic crystals for maximum bandgap subject to manufacturing and stiffness constraints.

42 ENGINEERING↗

Control of Three Degrees-of-Freedom Wave Energy Converters Using Pseudo-Spectral Methods

This study presents a solution to the optimal control problem of a three degrees-of-freedom (3DOF) wave energy converter (WEC). The three modes are the heave, pitch, and surge. The dynamic model is characterized by a coupling between the pitch and surge modes, while the heave is decoupled. The heave, however, excites the pitch motion through nonlinear parametric excitation in the pitch mode. This paper uses Fourier series (FS) as basis functions to approximate the states and the control. A simplified model is first used where the parametric excitation term is neglected and a closed-form solution for the optimal control is developed. For the parametrically excited case, a sequential quadratic programming approach is implemented to solve for the optimal control numerically. Numerical results show that the harvested energy from three modes is greater than three times the harvested energy from the heave mode alone. Moreover, the harvested energy using a control that accounts for the parametric excitation is significantly higher than the energy harvested when neglecting this nonlinear parametric excitation term.

16 TIDAL AND WAVE POWER↗