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,603 records · Page 89

Optimal Power Management of Battery Energy Storage Systems via Ensemble Kalman Inversion

Optimal power management of battery energy storage systems (BESS) is crucial for their safe and efficient operation. Numerical optimization techniques are frequently utilized to solve the optimal power management problems. However, these techniques often fall short of delivering real-time solutions for large-scale BESS due to their computational complexity. To address this issue, this paper proposes a computationally efficient approach. We introduce a new set of decision variables called power-sharing ratios corresponding to each cell, indicating their allocated power share from the output power demand. We then formulate an optimal power management problem to minimize the system-wide power losses while ensuring compliance with safety, balancing, and power supply-demand match constraints. To efficiently solve this problem, a parametrized control policy is designed and leveraged to transform the optimal power management problem into a parameter estimation problem. We then implement the ensemble Kalman inversion to estimate the optimal parameter set. The proposed approach significantly reduces computational requirements due to 1) the much lower dimensionality of the decision parameters and 2) the estimation treatment of the optimal power management problem. Finally, we conduct extensive simulations to validate the effectiveness of the proposed approach. The results show promise in accuracy and computation time compared with explored numerical optimization techniques.

Farakhor, Amir↗

A GENERALIZED STOCHASTIC COLLOCATION APPROACH TO CONSTRAINED OPTIMIZATION FOR RANDOM DATA IDENTIFICATION PROBLEMS

We present a scalable, parallel mechanism for stochastic identification/control for problems constrained by partial differential equations with random input data. Several identification objectives will be discussed that either minimize the expectation of a tracking cost functional or minimize the difference of desired statistical quantities in the appropriate $L^p$ norm, and the distributed parameters/control can both deterministic or stochastic. Given an objective we prove the existence of an optimal solution, establish the validity of the Lagrange multiplier rule and obtain a stochastic optimality system of equations. The modeling process may describe the solution in terms of high dimensional spaces, particularly in the case when the input data (coefficients, forcing terms, boundary conditions, geometry, etc) are affected by a large amount of uncertainty. For higher accuracy, the computer simulation must increase the number of random variables (dimensions), and expend more effort approximating the quantity of interest in each individual dimension. Hence, we introduce a novel stochastic parameter identification algorithm that integrates an adjoint-based deterministic algorithm with the sparse grid stochastic collocation FEM approach. This allows for decoupled, moderately high dimensional, parameterized computations of the stochastic optimality system, where at each collocation point, deterministic analysis and techniques can be utilized. The advantage of our approach is that it allows for the optimal identification of statistical moments (mean value, variance, covariance, etc.) or even the whole probability distribution of the input random fields, given the probability distribution of some responses of the system (quantities of physical interest). Our rigorously derived error estimates, for the fully discrete problems, will be described and used to compare the efficiency of the method with several other techniques. Numerical examples illustrate the theoretical results and demonstrate the distinctions between the various stochastic identification objectives.

Webster, Clayton G↗

A branch-and-price algorithm for a team orienteering problem with fixed-wing drones

This paper formulates a team orienteering problem with multiple fixed-wing drones and develops a branch-and-price algorithm to solve the problem to optimality. Fixed-wing drones, unlike rotary drones, have kinematic constraints associated with them, thereby preventing them to make on-the-spot turns and restricting them to a minimum turn radius. This paper presents the implications of these constraints on the drone routing problem formulation and proposes a systematic technique to address them in the context of the team orienteering problem. Furthermore, a novel branch-and-price algorithm with branching techniques specific to the constraints imposed due to fixed-wing drones are proposed. Extensive computational experiments on benchmark instances corroborating the effectiveness of the algorithms are also presented.

42 ENGINEERING↗

Parallel Solver Framework for Mixed-Integer PDE-Constrained Optimization

ROL-PEBBL is a C++, MPI-based parallel code for mixed-integer PDE-constrained optimization (MIPDECO). In these problems we wish to optimize (control, design, etc.) physical systems, which must obey the laws of physics, when some of the decision variables must take integer values. ROL-PEBBL combines a code to efficiently search over integer choices (PEBBL = Parallel Enumeration Branch-and-Bound Library) and a code for efficient nonlinear optimization, including PDE-constrained optimization (ROL = Rapid Optimization Library). In this report, we summarize the design of ROL-PEBBL and initial applications/results. For an artificial source-inversion problem, finding sources of pollution on a grid from sparse samples, ROL-PEBBLs solution for the nest grid gave the best optimization guarantee for any general solver that gives both a solution and a quality guarantee.

97 MATHEMATICS AND COMPUTING↗

Finite-Dimensional Representations for Controlled Diffusions with Delay

We study stochastic delay differential equations (SDDE) where the coefficients depend on the moving averages of the state process. As a first contribution, we provide sufficient conditions under which the solution of the SDDE and a linear path functional of it admit a finite-dimensional Markovian representation. As a second contribution, we show how approximate finite-dimensional Markovian representations may be constructed when these conditions are not satisfied, and provide an estimate of the error corresponding to these approximations. These results are applied to optimal control and optimal stopping problems for stochastic systems with delay.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗

Terahertz generation by two cross focused Gaussian laser beams in magnetized plasma

This paper presents a theoretical model for terahertz (THz) radiation generation by two cross-focused Gaussian laser beams in a collisionless magnetoplasma. The plasma is redistributed due to the ponderomotive nonlinearity which leads to the cross focusing of the laser beams. The focusing of the copropagating laser beams increases with increasing the externally applied static magnetic field which is perpendicular to the wave propagation direction. The nonlinear current at THz frequency arises on account of nonlinear ponderomotive force as a result of beating of the two lasers. The generated THz radiation amplitude increases significantly with increasing magnetic field. The cross focusing of two laser beams enhances the THz yield. Optimization of laser-plasma parameters gives the radiated normalized THz power of the order of 10 kW.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

CONORBIT: constrained optimization by radial basis function interpolation in trust regions

Here, this paper presents CONORBIT (CONstrained Optimization by Radial Basis function Interpolation in Trust regions), a derivative-free algorithm for constrained black-box optimization where the objective and constraint functions are computationally expensive. CONORBIT employs a trust-region framework that uses interpolating radial basis function (RBF) models for the objective and constraint functions, and is an extension of the ORBIT algorithm. It uses a small margin for the RBF constraint models to facilitate the generation of feasible iterates, and extensive numerical tests confirm that such a margin is helpful in improving performance. CONORBIT is compared with other algorithms on 27 test problems, a chemical process optimization problem, and an automotive application. Numerical results show that CONORBIT performs better than COBYLA, a sequential penalty derivative-free method, an augmented Lagrangian method, a direct search method, and another RBF-based algorithm on the test problems and on the automotive application.

97 MATHEMATICS AND COMPUTING↗

MODELING MAGNETIC FIELD STRUCTURE OF A SOLAR ACTIVE REGION CORONA USING NONLINEAR FORCE-FREE FIELDS IN SPHERICAL GEOMETRY

We test a nonlinear force-free field (NLFFF) optimization code in spherical geometry using an analytical solution from Low and Lou. Several tests are run, ranging from idealized cases where exact vector field data are provided on all boundaries, to cases where noisy vector data are provided on only the lower boundary (approximating the solar problem). Analytical tests also show that the NLFFF code in the spherical geometry performs better than that in the Cartesian one when the field of view of the bottom boundary is large, say, 20 Degree-Sign Multiplication-Sign 20 Degree-Sign . Additionally, we apply the NLFFF model to an active region observed by the Helioseismic and Magnetic Imager on board the Solar Dynamics Observatory (SDO) both before and after an M8.7 flare. For each observation time, we initialize the models using potential field source surface (PFSS) extrapolations based on either a synoptic chart or a flux-dispersal model, and compare the resulting NLFFF models. The results show that NLFFF extrapolations using the flux-dispersal model as the boundary condition have slightly lower, therefore better, force-free, and divergence-free metrics, and contain larger free magnetic energy. By comparing the extrapolated magnetic field lines with the extreme ultraviolet (EUV) observations by the Atmospheric Imaging Assembly on board SDO, we find that the NLFFF performs better than the PFSS not only for the core field of the flare productive region, but also for large EUV loops higher than 50 Mm.

79 ASTRONOMY AND ASTROPHYSICS↗

Multistage Stabilized Continuation for Indirect Optimal Control of Three-Dimensional Hypersonic Trajectories

This work presents the development of a multistaged stabilized continuation for the three-dimensional unpowered hypersonic trajectory planning problem using indirect optimal control methods. The stabilized continuation method is noniterative and guaranteed to terminate within a finite number of floating point operations, thereby making it well suited for onboard autonomous implementations. Here, we present a multistage formulation of the stabilized continuation scheme that involves starting with a “loose” integration tolerance during the first stage and ramping up toward a “strict” integration tolerance through subsequent stages. An important benefit of this approach is that even when the solution to the underlying optimal control problem is numerically unstable, such as with the hypersonic vehicle footprint generation problem, the stabilized continuation algorithm is shown to be successful in finding a solution while providing some additional insights into the underlying cause of the numerical instability.

33 ADVANCED PROPULSION SYSTEMS↗

Controlling the high frequency response of H{sub 2} by ultra-short tailored laser pulses: A time-dependent configuration interaction study

We combine the stochastic pulse optimization (SPO) scheme with the time-dependent configuration interaction singles method in order to control the high frequency response of a simple molecular model system to a tailored femtosecond laser pulse. For this purpose, we use H{sub 2} treated in the fixed nuclei approximation. The SPO scheme, as similar genetic algorithms, is especially suited to control highly non-linear processes, which we consider here in the context of high harmonic generation. Here, we will demonstrate that SPO can be used to realize a “non-harmonic” response of H{sub 2} to a laser pulse. Specifically, we will show how adding low intensity side frequencies to the dominant carrier frequency of the laser pulse and stochastically optimizing their contribution can create a high-frequency spectral signal of significant intensity, not harmonic to the carrier frequency. At the same time, it is possible to suppress the harmonic signals in the same spectral region, although the carrier frequency is kept dominant during the optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

A system-level cost-of-energy wind farm layout optimization with landowner modeling

This work applies an enhanced levelized wind farm cost model, including landowner remittance fees, to determine optimal turbine placements under three landowner participation scenarios and two land-plot shapes. Instead of assuming a continuous piece of land is available for the wind farm construction, as in most layout optimizations, the problem formulation represents landowner participation scenarios as a binary string variable, along with the number of turbines. The cost parameters and model are a combination of models from the National Renewable Energy Laboratory (NREL), Lawrence Berkeley National Laboratory, and Windustiy. The system-level cost-of-energy (COE) optimization model is also tested under two land-plot shapes: equally-sized square land plots and unequal rectangle land plots. The optimal COEs results are compared to actual COE data and found to be realistic. The results show that landowner remittances account for approximately 10% of farm operating costs across all cases. Irregular land-plot shapes are easily handled by the model. We find that larger land plots do not necessarily receive higher remittance fees. The model can help site developers identify the most crucial land plots for project success and the optimal positions of turbines, with realistic estimates of costs and profitability. (C) 2013 Elsevier Ltd. All rights reserved.

36 MATERIALS SCIENCE↗

Stochastic bifurcation and fractal and chaos control of a giant magnetostrictive film-shape memory alloy composite cantilever plate subjected to in-plane harmonic and stochastic excitation

Stochastic bifurcation and fractal and chaos control of a giant magnetostrictive film–shape memory alloy (GMF–SMA) composite cantilever plate subjected to in-plane harmonic and stochastic excitation were studied. Van der Pol items were improved to interpret the hysteretic phenomena of both GMF and SMA, and the nonlinear dynamic model of a GMF–SMA composite cantilever plate subjected to in-plane harmonic and stochastic excitation was developed. The probability density function of the dynamic response of the system was obtained, and the conditions of stochastic Hopf bifurcation were analyzed. The conditions of noise-induced chaotic response were obtained in the stochastic Melnikov integral method, and the fractal boundary of the safe basin of the system was provided. Finally, the chaos control strategy was proposed in the stochastic dynamic programming method. Numerical simulation shows that stochastic Hopf bifurcation and chaos appear in the parameter variation process. The boundary of the safe basin of the system has fractal characteristics, and its area decreases when the noise intensifies. The system reliability was improved through stochastic optimal control, and the safe basin area of the system increased.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Frequency up-conversion in nonpolar a-plane GaN/AlGaN based multiple quantum wells optimized for applications with silicon solar cells

We have described a method for structural parameters optimization of GaN/AlGaN multiple quantum well based up-converter for silicon solar cells. It involves a systematic tuning of individual step quantum wells by use of the genetic algorithm for global optimization. In quantum well structures, the up-conversion process can be achieved by utilizing nonlinear optical effects based on intersubband transitions. Both single and double step quantum wells have been tested in order to maximize the second order susceptibility derived from the density matrix formalism. The results obtained for single step wells proved slightly better and have been further pursued to obtain a more complex design, optimized for conversion of an entire range of incident photon energies.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Data-driven optimized control of the COVID-19 epidemics

Optimizing the impact on the economy of control strategies aiming at containing the spread of COVID-19 is a critical challenge. We use daily new case counts of COVID-19 patients reported by local health administrations from different Metropolitan Statistical Areas (MSAs) within the US to parametrize a model that well describes the propagation of the disease in each area. We then introduce a time-varying control input that represents the level of social distancing imposed on the population of a given area and solve an optimal control problem with the goal of minimizing the impact of social distancing on the economy in the presence of relevant constraints, such as a desired level of suppression for the epidemics at a terminal time. We find that with the exception of the initial time and of the final time, the optimal control input is well approximated by a constant, specific to each area, which contrasts with the implemented system of reopening ‘in phases’. For all the areas considered, this optimal level corresponds to stricter social distancing than the level estimated from data. Proper selection of the time period for application of the control action optimally is important: depending on the particular MSA this period should be either short or long or intermediate. We also consider the case that the transmissibility increases in time (due e.g. to increasingly colder weather), for which we find that the optimal control solution yields progressively stricter measures of social distancing. We finally compute the optimal control solution for a model modified to incorporate the effects of vaccinations on the population and we see that depending on a number of factors, social distancing measures could be optimally reduced during the period over which vaccines are administered to the population.

60 APPLIED LIFE SCIENCES↗

End-to-end GPU acceleration of low-order-refined preconditioning for high-order finite element discretizations

In this article, we present algorithms and implementations for the end-to-end GPU acceleration of matrix-free low-order-refined preconditioning of high-order finite element problems. The methods described here allow for the construction of effective preconditioners for high-order problems with optimal memory usage and computational complexity. The preconditioners are based on the construction of a spectrally equivalent low-order discretization on a refined mesh, which is then amenable to, for example, algebraic multigrid preconditioning. The constants of equivalence are independent of mesh size and polynomial degree. For vector finite element problems in H(curl) and H(div) (e.g., for electromagnetic or radiation diffusion problems), a specially constructed interpolation–histopolation basis is used to ensure fast convergence. Detailed performance studies are carried out to analyze the efficiency of the GPU algorithms. The kernel throughput of each of the main algorithmic components is measured, and the strong and weak parallel scalability of the methods is demonstrated. The different relative weighting and significance of the algorithmic components on GPUs and CPUs is discussed. Results on problems involving adaptively refined nonconforming meshes are shown, and the use of the preconditioners on a large-scale magnetic diffusion problem using all spaces of the finite element de Rham complex is illustrated.

97 MATHEMATICS AND COMPUTING↗