Search NASA⌕ Search

SEARCH · Search NASA

Results for “variational 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 253 records · Page 14

Distribution of solutions of the fastest apparent convergence condition in optimized perturbation theory and its relation to anti-Stokes lines

We discuss fundamental properties of the fastest apparent convergence (FAC) condition which is used as a variational criterion in optimized perturbation theory (OPT). We examine an integral representation of the FAC condition and a distribution of the zeros of the integral in a complex artificial parameter space on the basis of theory of Lefschetz thimbles. We find that the zeros accumulate on a certain line segment known as an anti-Stokes line in the limit K→∞, where K is a truncation order of a perturbation series. This phenomenon gives an underlying mechanism that physical quantities calculated by OPT can be insensitive to the choice of the artificial parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗

Surrogate Optimization for Quantum Circuits

Variational quantum Eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has yet to be realized with few claims of quantum advantage and high resource estimates mainly due to the need for optimization in the presence of noise. Finding algorithms and methods to improve the convergence is essential to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal we look to use modern approaches recently developed in circuit simulations and stochastic classical optimization that can be combined in a surrogate optimization approach to classical circuits. Using an approximate state vector simulator, we efficiently calculate an approximate Hessian, fed as an input for a detailed quantum circuit simulator. We demonstrate the capabilities of such an approach with and without sampling noise. We also show that this method outperforms Powell in the presence of quantum circuit shot noise by a factor of 2-4

quantum computing↗

A finite element based method for solution of optimal control problems

A temporal finite element based on a mixed form of the Hamiltonian weak principle is presented for optimal control problems. The mixed form of this principle contains both states and costates as primary variables that are expanded in terms of elemental values and simple shape functions. Unlike other variational approaches to optimal control problems, however, time derivatives of the states and costates do not appear in the governing variational equation. Instead, the only quantities whose time derivatives appear therein are virtual states and virtual costates. Also noteworthy among characteristics of the finite element formulation is the fact that in the algebraic equations which contain costates, they appear linearly. Thus, the remaining equations can be solved iteratively without initial guesses for the costates; this reduces the size of the problem by about a factor of two. Numerical results are presented herein for an elementary trajectory optimization problem which show very good agreement with the exact solution along with excellent computational efficiency and self-starting capability. The goal is to evaluate the feasibility of this approach for real-time guidance applications. To this end, a simplified two-stage, four-state model for an advanced launch vehicle application is presented which is suitable for finite element solution.

Bless, Robert R.↗

Muon Capture for the IDS Neutrino Factory

We have developed a new method for capture, bunching and phase-energy rotation of secondary beams from a proton source, using high-frequency rf systems. The method is the baseline for muon capture in the International scoping study for a neutrino factory. In this method, a proton bunch on a target creates secondaries that drift into a capture transport channel. A sequence of rf cavities forms the resulting muon beams into strings of bunches of differing energies, aligns the bunches to (nearly) equal central energies, and initiates ionization cooling. For the International Design Study the method must be optimized for performance and cost, and variations will be explored. In this paper we present results of optimization and variation studies toward obtaining the maximum number of muons for a neutrino factory, as well as for a future muon collider.

43 PARTICLE ACCELERATORS↗

Geologic Reservoir Content Model from Low-Temperature Geothermal Play Fairway Analysis for the Appalachian Basin

This dataset contains the known hydrocarbon reservoirs within the study area of the Geothermal Play Fairway Analysis for the Appalachian Basin (GPFA-AB) as part of Phase 1, Natural Reservoirs Quality Analysis. The final values for Reservoir Productivity Index (RPI) and uncertainty (in terms of coefficient of variation, CV) are included. RPI is in units of liters per MegaPascal-second (L/MPa-s), quantified using permeability, thickness of formation, and depth. A higher RPI is more optimal. Coefficient of Variation (CV) is the ratio of the standard deviation to the mean RPI for each reservoir. A lower CV is more optimal. Details on these metrics can be found in the Reservoirs_Methodology_Memo.pdf uploaded in the associated "Natural Reservoir Analysis" dataset linked below.

15 GEOTHERMAL ENERGY↗

Mathematical Optimization Techniques

The papers collected in this volume were presented at the Symposium on Mathematical Optimization Techniques held in the Santa Monica Civic Auditorium, Santa Monica, California, on October 18-20, 1960. The objective of the symposium was to bring together, for the purpose of mutual education, mathematicians, scientists, and engineers interested in modern optimization techniques. Some 250 persons attended. The techniques discussed included recent developments in linear, integer, convex, and dynamic programming as well as the variational processes surrounding optimal guidance, flight trajectories, statistical decisions, structural configurations, and adaptive control systems. The symposium was sponsored jointly by the University of California, with assistance from the National Science Foundation, the Office of Naval Research, the National Aeronautics and Space Administration, and The RAND Corporation, through Air Force Project RAND.

Bellman, R.↗

Optimal short-range trajectories for helicopters

An optimal flight path algorithm using a simplified altitude state model and a priori climb cruise descent flight profile was developed and applied to determine minimum fuel and minimum cost trajectories for a helicopter flying a fixed range trajectory. In addition, a method was developed for obtaining a performance model in simplified form which is based on standard flight manual data and which is applicable to the computation of optimal trajectories. The entire performance optimization algorithm is simple enough that on line trajectory optimization is feasible with a relatively small computer. The helicopter model used is the Silorsky S-61N. The results show that for this vehicle the optimal flight path and optimal cruise altitude can represent a 10% fuel saving on a minimum fuel trajectory. The optimal trajectories show considerable variability because of helicopter weight, ambient winds, and the relative cost trade off between time and fuel. In general, reasonable variations from the optimal velocities and cruise altitudes do not significantly degrade the optimal cost. For fuel optimal trajectories, the optimum cruise altitude varies from the maximum (12,000 ft) to the minimum (0 ft) depending on helicopter weight.

Slater, G. L.↗

Optimal short range trajectories for helicopters

An optimal flight path algorithm using a simplified altitude state model and an apriori climb-cruise-descent flight profile has been developed and applied to determine minimum fuel and minimum cost trajectories for a helicopter flying a fixed range trajectory. The performance model is based on standard flight manual data and is such that on-line trajectory optimization is feasible with a relatively small computer. The results show that the optimal flight path and optimal cruise altitude can represent a 10 percent fuel saving on a minimum fuel trajectory. The optimal trajectories show considerable variability due to helicopter weight, ambient winds and the relative cost trade-off between time and fuel. In general, 'reasonable' variations from the optimal velocities and cruise altitudes do not significantly degrade the optimal cost.

Slater, G. L.↗

A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions

Neural network wavefunctions optimized using the variational Monte Carlo method have been shown to produce highly accurate results for the electronic structure of atoms and small molecules, but the high cost of optimizing such wavefunctions prevents their application to larger systems. We propose the Subsampled Projected-Increment Natural Gradient Descent (SPRING) optimizer to reduce this bottleneck. SPRING combines ideas from the recently introduced minimum-step stochastic reconfiguration optimizer (MinSR) and the classical randomized Kaczmarz method for solving linear least-squares problems. We demonstrate that SPRING outperforms both MinSR and the popular Kronecker-Factored Approximate Curvature method (KFAC) across a number of small atoms and molecules, given that the learning rates of all methods are optimally tuned. For example, on the oxygen atom, SPRING attains chemical accuracy after forty thousand training iterations, whereas both MinSR and KFAC fail to do so even after one hundred thousand iterations.

97 MATHEMATICS AND COMPUTING↗

A simple introduction to the SiMPL method for density-based topology optimization

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as “the simple method”) optimizes a design using only first-order derivative information of the objective function. The bound constraints on the density field are enforced with the help of the (negative) Fermi–Dirac entropy, which is also used to define a non-symmetric distance function called a Bregman divergence on the set of admissible designs. This Bregman divergence leads to a simple update rule that is further simplified with the help of a so-called latent variable. Because the SiMPL method involves discretizing the latent variable, it produces a sequence of pointwise-feasible iterates, even when high-order finite elements are used in the discretization. Numerical experiments demonstrate that the method outperforms other popular first-order optimization algorithms. In conclusion, to outline the general applicability of the technique, we include examples with (self-load) compliance minimization and compliant mechanism optimization problems.

Calculus of Variations and Optimization↗

On Building Predictive Digital Twin Incorporating Wave Predicting Capabilities: Case Study on UMaine Experimental Campaign - FOCAL

The response of floating wind turbines (FWT) are susceptible to stochastic wave variations. For the optimal operation of FWT, a comprehensive understanding of the phaseresolved wave dynamics and the consequential system response is crucial for real-time monitoring and control. A multi-variate, multi-step, long short term memory (MLSTM), a type of recurrent neural network (RNN) is used to capture complex system dynamics for real-time application. Results indicate that the integration of a wave prediction-reconstruction (WRP) model substantially enhances prediction accuracy by 50% on average relative to the baseline model. The improvement is consistent across various wave extremity and prediction horizons, thereby significantly broadening the scope for timely and precise predictive capabilities.

17 WIND ENERGY↗

Viscous aerodynamic design using the adjoint variable approach

The use of classical optimal control methods, in particular variational methods, to solve the airfoil optimization problem, by deriving a set of adjoint (costate) equations and boundary conditions has already been done for inviscid (potential and Euler flows) and two dimensional, steady state, incompressible flow governed by the Navier-Stokes equations. The interior and boundary terms of the volume integral have been derived (in this work) for the steady Navier-Stokes equations in three dimensions for a viscous, compressible heat conducting fluid. This can be used to derive the adjoint equations and numerical boundary conditions for general classes of problems and hence paves the way for a solution to the aerodynamic optimization problem for compressible viscous flows. The next steps to the realization of that goal are projected as below. The usual square integral pressure functional as an objective function is being replaced by a more realistic drag functional subject to a lift constraint. The feasibility of attempting the more difficult time dependent problem is being investigated. It remains to get the full system of adjoint equations and boundary conditions with the new functional. The state and adjoint equations must be discretized and coded. An appropriate optimization program must be used (steepest descents seems inadequate) and various known airfoil shapes should be recovered in test cases of the computer program.

DeRise, George↗

Numerical gate synthesis for quantum heuristics on bosonic quantum processors

There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ( > 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Total variation vs L1 regularization: a comparison of compressive sensing optimization methods for chemical detection

One of the fundamental assumptions of compressive sensing (CS) is that a signal can be reconstructed from a small number of samples by solving an optimization problem with the appropriate regularization term. Two standard regularization terms are the L1 norm and the total variation (TV) norm. We present a comparison of CS reconstruction results based on these two approaches in the context of chemical detection, and we demonstrate that optimization based on the L1 norm outperforms optimization based on the TV norm. Our comparison is driven by CS sampling, reconstruction, and chemical detection in two real-world datasets: the Physical Sciences Inc. Fabry-Perot interferometer sensor multispectral dataset and the Johns Hopkins Applied Physics Lab FTIR-based longwave infrared sensor hyperspectral dataset. Both datasets contain the release of a chemical simulant such as glacial acetic acid, triethyl phosphate, and sulfur hexafluoride. For chemical detection we use the adaptive coherence estimator (ACE) and bulk coherence, and we propose algorithmic ACE thresholds to define the presence or absence of a chemical of interest in both un-compressed data cubes and reconstructed data cubes. The un-compressed data cubes provide an approximate ground truth. We demonstrate that optimization based on either the L1 norm or TV norm results in successful chemical detection at a compression rate of 90%, but we show that L1 optimization is preferable. We present quantitative comparisons of chemical detection on reconstructions from the two methods, with an emphasis on the number of pixels with an ACE value above the threshold.

Hyperspectral imagery, L1-norm, total variation, A↗

Optimizing CdTe Solar Cell Performance: Impact of Variations in Minority-Carrier Lifetime and Carrier Density Profile

Using numerical simulations, we study the combined effects of nonuniform minority-carrier lifetime t and carrier density NA on device performance. In a uniformly doped device, maximum open-circuit voltage V oc is obtained for high t and high NA . The fill-factor (FF) is mainly dependent on the lifetime. When the lifetime is low, and NA is high, the FF suffers losses due to voltage-dependant carrier collection. For a low carrier density and low lifetime, the electric field strength is low, recombination is a competitive process to drift, and the FF is reduced. Simulations predict that it might be possible to increase the device efficiency with lower carrier density, if the back of the absorber is highly doped. This configuration increases the built-in potential and the electric field close to the junction region, while keeping the space-charge region wide. In addition, a device with such a profile is very tolerant toward lifetime variations of the highly doped layer. With our simulation parameters, when the absorber properties are uniform, efficiencies >;18% require experimentally unrealistic doping and lifetime values. If the back of the absorber is doped significantly higher than the rest, such efficiencies can be achieved with realistic values of doping and lifetime.

14 SOLAR ENERGY↗

Improving the Accuracy of Variational Quantum Eigensolvers with Fewer Qubits Using Orbital Optimization

Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To date, experimental demonstrations of algorithms such as the Variational Quantum Eigensolver (VQE) have been limited to small molecules using minimal basis sets for this reason. In this work we propose incorporating an orbital optimization scheme into quantum eigensolvers wherein a parametrized partial unitary transformation is applied to the basis functions set in order to reduce the number of qubits required for a given problem. The optimal transformation is found by minimizing the ground state energy with respect to this partial unitary matrix. Through numerical simulations of small molecules up to 16 spin orbitals, we demonstrate that this method has the ability to greatly extend the capabilities of near-term quantum computers with regard to the electronic structure problem. Finally, we find that VQE paired with orbital optimization consistently achieves lower ground state energies than traditional VQE when using the same number of qubits and even frequently achieves lower ground state energies than VQE methods using more qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal insensitive-controller synthesis

Proof of two theorems is included in report: local sufficiency condition for existence of insensitive controllers in the case of sufficiently small parameter variations; and necessary condition for optimal controller corresponding to point in boundary of domain of admissible parameter variations to be optimal insensitive controller.

Harvey, C. A.↗