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 433 records · Page 24

SU-F-J-178: A Computer Simulation Model Observer for Task-Based Image Quality Assessment in Radiation Therapy

Purpose: Traditionally, image quality in radiation therapy is assessed subjectively or by utilizing physically-based metrics. Some model observers exist for task-based medical image quality assessment, but almost exclusively for diagnostic imaging tasks. As opposed to disease diagnosis, the task for image observers in radiation therapy is to utilize the available images to design and deliver a radiation dose which maximizes patient disease control while minimizing normal tissue damage. The purpose of this study was to design and implement a new computer simulation model observer to enable task-based image quality assessment in radiation therapy. Methods: A modular computer simulation framework was developed to resemble the radiotherapy observer by simulating an end-to-end radiation therapy treatment. Given images and the ground-truth organ boundaries from a numerical phantom as inputs, the framework simulates an external beam radiation therapy treatment and quantifies patient treatment outcomes using the previously defined therapeutic operating characteristic (TOC) curve. As a preliminary demonstration, TOC curves were calculated for various CT acquisition and reconstruction parameters, with the goal of assessing and optimizing simulation CT image quality for radiation therapy. Sources of randomness and bias within the system were analyzed. Results: The relationship between CT imaging dose and patient treatment outcome was objectively quantified in terms of a singular value, the area under the TOC (AUTOC) curve. The AUTOC decreases more rapidly for low-dose imaging protocols. AUTOC variation introduced by the dose optimization algorithm was approximately 0.02%, at the 95% confidence interval. Conclusion: A model observer has been developed and implemented to assess image quality based on radiation therapy treatment efficacy. It enables objective determination of appropriate imaging parameter values (e.g. imaging dose). Framework flexibility allows for incorporation of additional modules to include any aspect of the treatment process, and therefore has great potential for both assessment and optimization within radiation therapy.

60 APPLIED LIFE SCIENCES↗

Optimum quantization in dynamic systems.

Criterion for optimum design of quantizer imbedded in closed loop dynamic system is optimization of overall system performance expressed by variational criterion

QUANTIZER↗

On optimal infinite impulse response edge detection filters

The authors outline the design of an optimal, computationally efficient, infinite impulse response edge detection filter. The optimal filter is computed based on Canny's high signal to noise ratio, good localization criteria, and a criterion on the spurious response of the filter to noise. An expression for the width of the filter, which is appropriate for infinite-length filters, is incorporated directly in the expression for spurious responses. The three criteria are maximized using the variational method and nonlinear constrained optimization. The optimal filter parameters are tabulated for various values of the filter performance criteria. A complete methodology for implementing the optimal filter using approximating recursive digital filtering is presented. The approximating recursive digital filter is separable into two linear filters operating in two orthogonal directions. The implementation is very simple and computationally efficient, has a constant time of execution for different sizes of the operator, and is readily amenable to real-time hardware implementation.

Sarkar, Sudeep↗

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↗

Data from: Nucleotide polymorphism and copy number variant detection using exome capture and next generation sequencing in the polyploid grass Panicum virgatum

Switchgrass (Panicum virgatum) is a polyploid, outcrossing grass species native to North America and has recently been recognized as a potential biofuel feedstock crop. Significant phenotypic variation including ploidy is present across the two primary ecotypes of switchgrass, referred to as upland and lowland switchgrass. The tetraploid switchgrass genome is approximately 1400 Mbp, split between two subgenomes, with significant repetitive sequence content limiting the efficiency of re-sequencing approaches for determining genome diversity. To characterize genetic diversity in upland and lowland switchgrass as a first step in linking genotype to phenotype, we designed an exome capture probe set based on transcript assemblies that represent ~50 Mb of annotated switchgrass exome sequences. We then evaluated and optimized the probe set using solid phase comparative genome hybridization and liquid phase exome capture followed by next generation sequencing. Using the optimized probe set, we assessed variation in the exomes of eight switchgrass genotypes representing tetraploid lowland and octoploid upland cultivars to benchmark our exome capture probe set design. We identified ample variation in the switchgrass genome including 1,395,501 single nucleotide polymorphisms (SNPs), 8,173 putative copy number variants and 3,336 presence/absence variants. While the majority of the SNPs (84%) detected were biallelic, a substantial number were tri-allelic with limited occurrence of tetra-allelic polymorphisms consistent with the heterozygous and polyploid nature of the switchgrass genome. Collectively, these data demonstrate the efficacy of exome capture for discovery of genome variation in a polyploid species with a large, repetitive and heterozygous genome.

09 BIOMASS FUELS↗

Nucleotide polymorphism and copy number variant detection using exome capture and next-generation sequencing in the polyploid grass Panicum virgatum

Switchgrass (Panicum virgatum) is a polyploid, outcrossing grass species native to North America and has recently been recognized as a potential biofuel feedstock crop. Significant phenotypic variation including ploidy is present across the two primary ecotypes of switchgrass, referred to as upland and lowland switchgrass. The tetraploid switchgrass genome is approximately 1400 Mbp, split between two subgenomes, with significant repetitive sequence content limiting the efficiency of re-sequencing approaches for determining genome diversity. To characterize genetic diversity in upland and lowland switchgrass as a first step in linking genotype to phenotype, we designed an exome capture probe set based on transcript assemblies that represent approximately 50 Mb of annotated switchgrass exome sequences. We then evaluated and optimized the probe set using solid phase comparative genome hybridization and liquid phase exome capture followed by next-generation sequencing. Using the optimized probe set, we assessed variation in the exomes of eight switchgrass genotypes representing tetraploid lowland and octoploid upland cultivars to benchmark our exome capture probe set design. We identified ample variation in the switchgrass genome including 1 395 501 single nucleotide polymorphisms (SNPs), 8173 putative copy number variants and 3336 presence/absence variants. While the majority of the SNPs (84%) detected was bi-allelic, a substantial number was tri-allelic with limited occurrence of tetra-allelic polymorphisms consistent with the heterozygous and polyploid nature of the switchgrass genome. Collectively, these data demonstrate the efficacy of exome capture for discovery of genome variation in a polyploid species with a large, repetitive and heterozygous genome.

54 ENVIRONMENTAL SCIENCES↗

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Nonlocal Feature-Driven Exemplar-Based Approach for Image Inpainting

Here, we present a nonlocal variational image completion technique which admits simultaneous inpainting of multiple structures and textures in a unified framework. The recovery of geometric structures is achieved by using general convolution operators as a measure of behavior within an image. These are combined with a nonlocal exemplar-based approach to exploit the self-similarity of an image in the selected feature domains and to ensure the inpainting of textures. We also introduce an anisotropic patch distance metric to allow for better control of the feature selection within an image and present a nonlocal energy functional based on this metric. Finally, we derive an optimization algorithm for the proposed variational model and examine its validity experimentally with various test images.

97 MATHEMATICS AND COMPUTING↗

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Phase II Final Report Computer Optimization of Electron Guns

This program implemented advanced computer optimization into an adaptive mesh, finite element, 3D, charged particle code. The routines can optimize electron gun performance to achieve a specified current, beam size, and perveance. It can also minimize beam ripple and electric field gradients. The magnetics optimization capability allows design of coil geometries and magnetic material configurations to achieve a specified axial magnetic field profile. The optimization control program, built into the charged particle code Beam Optics Analyzer (BOA) utilizes a 3D solid modeling package to modify geometry using design tables. Parameters within the graphical user interface (currents, voltages, etc.) can be directly modified within BOA. The program implemented advanced post processing capability for the optimization routines as well as the user. A Graphical User Interface allows the user to set up goal functions, select variables, establish ranges of variation, and define performance criteria. The optimization capability allowed development of a doubly convergent multiple beam gun that could not be designed using previous techniques.

43 PARTICLE ACCELERATORS↗

Multi-State Load Models for Distribution System Analysis

Recent work in the field of distribution system analysis has shown that the traditional method of peak load analysis is not adequate for the analysis of emerging distribution system technologies. Voltage optimization, demand response, electric vehicle charging, and energy storage are examples of technologies with characteristics having daily, seasonal, and/or annual variations. In addition to the seasonal variations, emerging technologies such as demand response and plug in electric vehicle charging have the potential to send control signals to the end use loads which will affect how they consume energy. In order to support time-series analysis over different time frames and to incorporate potential control signal inputs it is necessary to develop detailed end use load models which accurately represent the load under various conditions, and not just during the peak load period. This paper will build on previous work on detail end use load modeling in order to outline the method of general multi-state load models for distribution system analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Explainable and Differentiable Reinforcement Learning for Multi-objective Optimization in Particle Accelerators

Operating particle accelerators involves optimizing multiple goals simultaneously, which can be challenging due to trade-offs among objectives. While evolutionary algorithms like the genetic algorithm (GA) have been used for various Multi-Objective Optimization (MOO) tasks, they are not inherently suited for complex control problems. This talk highlights two variations of Reinforcement Learning (RL) for concurrently optimizing heat load and trip rates at the Continuous Electron Beam Accelerator Facility (CEBAF). The problem involves strict constraints on individual states, actions, and overall energy requirements of the beam. First, this talk highlights how differentiability can be harnessed through a Deep Differentiable Reinforcement Learning (DDRL) approach to address MOO issues within particle accelerators. We examine the DDRL method alongside Model Free Reinforcement Learning (MFRL), GA, and Bayesian Optimization (BO). The performance of these methods is assessed by generating a Pareto-front for two objectives. Our findings indicate that DDRL excels in handling high-dimensional problems more effectively than MFRL, BO, and GA. Next, we will show integration of explainable physics-based constraints into RL algorithms to enhance trans- parency and trust in decision-making processes by enabling users to verify that agents adhere to established physical principles. This surrogate function can be modeled using neural networks or sparse dictionary mod- els. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment provided but the surrogate model. In addi- tion, we find that the introduction of a mathematical functional dictionary based surrogate model enables our reinforcement learning algorithms to reliably converge for difficult high-dimensional accelerator controls environments.

Rajput, Kishansingh [Thomas Jefferson National Acc↗

Excited State Orbital Optimization via Minimizing the Square of the Gradient: General Approach and Application to Singly and Doubly Excited States via Density Functional Theory

We present a general approach to converge excited state solutions to any quantum chemistry orbital optimization process, without the risk of variational collapse. The resulting square gradient minimization (SGM) approach only requires analytic energy/Lagrangian orbital gradients and merely costs 3 times as much as ground state orbital optimization (per iteration), when implemented via a finite difference approach. SGM is applied to both single determinant ΔSCF and spin-purified restricted open-shell Kohn-Sham (ROKS) approaches to study the accuracy of orbital optimized DFT excited states. It is found that SGM can converge challenging states where the maximum overlap method (MOM) or analogues either collapse to the ground state or fail to converge. We also report that ΔSCF/ROKS predict highly accurate excitation energies for doubly excited states (which are inaccessible via TDDFT). Singly excited states obtained via ROKS are also found to be quite accurate, especially for Rydberg states that frustrate (semi)local TDDFT. Our results suggest that orbital optimized excited state DFT methods can be used to push past the limitations of TDDFT to doubly excited, charge-transfer, or Rydberg states, making them a useful tool for the practical quantum chemist's toolbox for studying excited states in large systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effects of inclination and eccentricity on optimal trajectories between earth and Venus

The true optimal transfers, including the effects of the inclination and eccentricity of the planets' orbits, between earth and Venus are presented as functions of the corresponding idealized Hohmann transfers. The method of determining the optimal transfers using the calculus of variations is presented. For every possible Hohmann window, specified as a continuous function of the longitude of perihelion of the Hohmann trajectory, the corresponding numerically exact optimal two-impulse transfers are given in graphical form. The cases for which the optimal two-impulse transfer is the absolute optimal, and those for which a three-impulse transfer provides the absolute optimal transfer are indicated. This information furnishes everything necessary for quick and accurate orbit calculations for preliminary Venus mission analysis. This makes it possible to use the actual optimal transfers for advanced planning in place of the standard Hohmann transfers.

Gravier, J.-P.↗

A Deep Quench Approach to the Optimal Control of an Allen–Cahn Equation with Dynamic Boundary Conditions and Double Obstacles

In this paper, we investigate optimal control problems for Allen-Cahn variational inequalities with a dynamic boundary condition involving double obstacle potentials and the Laplace-Beltrami operator. The approach covers both the cases of distributed controls and of boundary controls. The cost functional is of standard tracking type, and box constraints for the controls are prescribed. We prove existence of optimal controls and derive first-order necessary conditions of optimality. The general strategy is the following: we use the results that were recently established by two of the authors for the case of (differentiable) logarithmic potentials and perform a so-called “deep quench limit”. Using compactness and monotonicity arguments, it is shown that this strategy leads to the desired first-order necessary optimality conditions for the case of (non-differentiable) double obstacle potentials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Impact of Airspace Charges on Transatlantic Aircraft Trajectories

Aircraft flying over the airspace of different countries are subject to over-flight charges. These charges vary from country to country. Airspace charges, while necessary to support the communication, navigation and surveillance services, may lead to aircraft flying routes longer than wind-optimal routes and produce additional carbon dioxide and other gaseous emissions. This paper develops an optimal route between city pairs by modifying the cost function to include an airspace cost whenever an aircraft flies through a controlled airspace without landing or departing from that airspace. It is assumed that the aircraft will fly the trajectory at a constant cruise altitude and constant speed. The computationally efficient optimal trajectory is derived by solving a non-linear optimal control problem. The operational strategies investigated in this study for minimizing aircraft fuel burn and emissions include flying fuel-optimal routes and flying cost-optimal routes that may completely or partially reduce airspace charges en route. The results in this paper use traffic data for transatlantic flights during July 2012. The mean daily savings in over-flight charges, fuel cost and total operation cost during the period are 17.6 percent, 1.6 percent, and 2.4 percent respectively, along the cost- optimal trajectories. The transatlantic flights can potentially save $600,000 in fuel cost plus $360,000 in over-flight charges daily by flying the cost-optimal trajectories. In addition, the aircraft emissions can be potentially reduced by 2,070 metric tons each day. The airport pairs and airspace regions that have the highest potential impacts due to airspace charges are identified for possible reduction of fuel burn and aircraft emissions for the transatlantic flights. The results in the paper show that the impact of the variation in fuel price on the optimal routes is to reduce the difference between wind-optimal and cost-optimal routes as the fuel price increases. The additional fuel consumption is quantified using the 30 percent variation in fuel prices during March 2014 to March 2015.

aircraft scheduling↗