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 91 records · Page 5

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗

Floating Wind Farm Layout Optimization Considering Moorings and Seabed Variations

This paper presents a method for optimizing the layout of floating wind farms that accounts for realistic seabed variations and the consequent adjustments to the mooring systems required for different turbine positions. The mooring lines of floating wind farms create large spatial constraints that are depth-dependent, since mooring designs must adapt to variations in seabed conditions over the array area. We develop a layout optimization methodology that addresses this, adjusting mooring system designs based on the local seabed characteristics as the layout changes and using steady-state models for the wake effects and mooring lines. The approach includes design algorithms that adjust the anchor positions and line length to achieve the desired mooring line profile for different water depths, and a layout optimization framework that implements spatial constraints between the turbines, mooring lines, and lease area boundaries. Demonstrating the method on several cases shows the effect of the seabed and spatial-constraint factors, as well as their interactions, on the optimal array layout. This demonstration paves the way for scaling up the method, using more powerful optimization algorithms to handle larger farm sizes and situations with more intensely varied seabed conditions.

17 WIND ENERGY↗

Diagnosing Barren Plateaus with Tools from Quantum Optimal Control

Variational Quantum Algorithms (VQAs) have received considerable attention due to their potential for achieving near-term quantum advantage. However, more work is needed to understand their scalability. One known scaling result for VQAs is barren plateaus, where certain circumstances lead to exponentially vanishing gradients. It is common folklore that problem-inspired ansatzes avoid barren plateaus, but in fact, very little is known about their gradient scaling. In this work we employ tools from quantum optimal control to develop a framework that can diagnose the presence or absence of barren plateaus for problem-inspired ansatzes. Such ansatzes include the Quantum Alternating Operator Ansatz (QAOA), the Hamiltonian Variational Ansatz (HVA), and others. With our framework, we prove that avoiding barren plateaus for these ansatzes is not always guaranteed. Specifically, we show that the gradient scaling of the VQA depends on the degree of controllability of the system, and hence can be diagnosed through the dynamical Lie algebra $\mathfrak{g}$ obtained from the generators of the ansatz. We analyze the existence of barren plateaus in QAOA and HVA ansatzes, and we highlight the role of the input state, as different initial states can lead to the presence or absence of barren plateaus. Taken together, our results provide a framework for trainability-aware ansatz design strategies that do not come at the cost of extra quantum resources. Moreover, we prove no-go results for obtaining ground states with variational ansatzes for controllable system such as spin glasses. Our work establishes a link between the existence of barren plateaus and the scaling of the dimension of $\mathfrak{g}$.

97 MATHEMATICS AND COMPUTING↗

Dynamics-Based Peptide–MHC Binding Optimization by a Convolutional Variational Autoencoder: A Use-Case Model for CASTELO

An unsolved challenge in the development of antigen-specific immunotherapies is determining the optimal antigens to target. Comprehension of antigen–major histocompatibility complex (MHC) binding is paramount toward achieving this goal. Here, we apply CASTELO, a combined machine learning-molecular dynamics (ML-MD) approach, to identify per-residue antigen binding contributions and then design novel antigens of increased MHC-II binding affinity for a type 1 diabetes-implicated system. We build upon a small-molecule lead optimization algorithm by training a convolutional variational autoencoder (CVAE) on MD trajectories of 48 different systems across four antigens and four HLA serotypes. We develop several new machine learning metrics including a structure-based anchor residue classification model as well as cluster comparison scores. ML-MD predictions agree well with experimental binding results and free energy perturbation-predicted binding affinities. Moreover, ML-MD metrics are independent of traditional MD stability metrics such as contact area and root-mean-square fluctuations (RMSF), which do not reflect binding affinity data. Finally, our work supports the role of structure-based deep learning techniques in antigen-specific immunotherapy design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Blocked Linear Method for Optimizing Large Parameter Sets in Variational Monte Carlo

We present a modification to variational Monte Carlo’s linear method optimization scheme that addresses a critical memory bottleneck while maintaining compatibility with both the traditional ground state variational principle and our recently-introduced variational principle for excited states. For wave function ansatzes with tens of thousands of variables, our modification reduces the required memory per parallel process from tens of gigabytes to hundreds of megabytes, making the methodology a much better fit for modern supercomputer architectures in which data communication and per-process memory consumption are primary concerns. We verify the efficacy of the new optimization scheme in small molecule tests involving both the Hilbert space Jastrow antisymmetric geminal power ansatz and real space multi-Slater Jastrow expansions. Satisfied with its performance, we have added the optimizer to the QMCPACK software package, with which we demonstrate on a hydrogen ring a prototype approach for making systematically convergent, non-perturbative predictions of Mott-insulators’ optical band gaps.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗

Dosimetric Evaluation of Incorporating Patient Geometric Variations Into Adaptive Plan Optimization Through Probabilistic Treatment Planning in Head and Neck Cancers

Four-dimensional (4D) adaptive radiation therapy (ART) treatment planning is an alternative to the conventional margin-based treatment planning approach. In 4D ART, interfraction patient geometric variations, gathered from computed tomography (CT) or cone beam CT (CBCT) images acquired during the patient treatment course, are directly incorporated into the adaptive plan optimization using a probabilistic treatment planning method. The goal of the present planning study was to evaluate the dosimetric differences between 4D ART and conventional margin-based adaptive planning strategies for head and neck cancers. In addition, we examined whether the dose differences achieved with 4D ART would translate into clinically relevant toxicity reductions using the existing normal tissue complication probability (NTCP) models.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Optimal control to handle variations in moisture content and reactor in-feed rate

The variations in feedstock characteristics, such as moisture and particle size distribution, lead to an inconsistent flow of feedstock from the biomass pre-processing system to the reactor in-feed system. These inconsistencies result in low on-stream times at the reactor in-feed equipment. This research develops an optimal process control method for a biomass pre-processing system comprised of milling and densification operations to provide the consistent flow of feedstock to a reactor's throat. This method uses a mixed-integer optimization model to identify optimal bale sequencing, equipment in-feed rate, and buffer location and size in the biomass pre-processing system. This method, referred to as the hybrid process control (HPC), aims to maximize throughput over time. We compare HPC with a baseline feed forward process control. Our case study based on switchgrass finds that HPC reduces the variation of a reactor's feeding rate by up to 100% without increasing the operating cost of the biomass pre-processing system for biomass with moisture ranging from 10 to 25%. Additionally, HPC reduces the cost of processing biomass by 0.36%–2.22%, and reduces processing time by 0.35%-2.24%. Furthermore, a biorefinery can adapt HPC to achieve its design capacity.

09 BIOMASS FUELS↗

IDR Muon Capture Front End and Variations

The (International Design Report) IDR neutrino factory scenario for capture, bunching, phase-energy rotation and initial cooling of {mu}'s produced from a proton source target is explored. It requires a drift section from the target, a bunching section and a {phi}-{delta}E rotation section leading into the cooling channel. The rf frequency changes along the bunching and rotation transport in order to form the 's into a train of equal-energy bunches suitable for cooling and acceleration. Optimization and variations are discussed. An important concern is rf limitations within the focusing magnetic fields; mitigation procedures are described. The method can be extended to provide muons for a {mu}{sup +}-{mu}{sup -} Collider; variations toward optimizing that extension are discussed.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

IDR muon capture front end and variations

The (International Design Report) IDR neutrino factory scenario for capture, bunching, phase-energy rotation and initial cooling of {mu}'s produced from a proton source target is explored. It requires a drift section from the target, a bunching section and a {phi}-{delta}E rotation section leading into the cooling channel. The rf frequency changes along the bunching and rotation transport in order to form the {mu}'s into a train of equal-energy bunches suitable for cooling and acceleration. Optimization and variations are discussed. An important concern is rf limitations within the focusing magnetic fields; mitigation procedures are described. The method can be extended to provide muons for a {mu}{sup +}-{mu}{sup -} Collider; variations toward optimizing that extension are discussed.

43 PARTICLE ACCELERATORS↗

Optimizing principal component models for representing interfraction variation in lung cancer radiotherapy

Purpose: To optimize modeling of interfractional anatomical variation during active breath-hold radiotherapy in lung cancer using principal component analysis (PCA). Methods: In 12 patients analyzed, weekly CT sessions consisting of three repeat intrafraction scans were acquired with active breathing control at the end of normal inspiration. The gross tumor volume (GTV) and lungs were delineated and reviewed on the first week image by physicians and propagated to all other images using deformable image registration. PCA was used to model the target and lung variability during treatment. Four PCA models were generated for each specific patient: (1) Individual models for the GTV and each lung from one image per week (week to week, W2W); (2) a W2W composite model of all structures; (3) individual models using all images (weekly plus repeat intrafraction images, allscans); and (4) composite model with all images. Models were reconstructed retrospectively (using all available images acquired) and prospectively (using only data acquired up to a time point during treatment). Dominant modes representing at least 95% of the total variability were used to reconstruct the observed anatomy. Residual reconstruction error between the model-reconstructed and observed anatomy was calculated to compare the accuracy of the models. Results: An average of 3.4 and 4.9 modes was required for the allscans models, for the GTV and composite models, respectively. The W2W model required one less mode in 40% of the patients. For the retrospective composite W2W model, the average reconstruction error was 0.7{+-}0.2 mm, which increased to 1.1{+-}0.5 mm when the allscans model was used. Individual and composite models did not have significantly different errors (p=0.15, paired t-test). The average reconstruction error for the prospective models of the GTV stabilized after four measurements at 1.2{+-}0.5 mm and for the composite model after five measurements at 0.8{+-}0.4 mm. Conclusions: Retrospective PCA models were capable of reconstructing original GTV and lung shapes and positions within several millimeters with three to four dominant modes, on average. Prospective models achieved similar accuracy after four to five measurements.

60 APPLIED LIFE SCIENCES↗

Stability of solution mappings for parametric bilevel vector equilibrium problems

In this paper, we first revisit the parametric bilevel vector equilibrium problems in Hausdorff topological vector spaces. Then we study the stability conditions such as (Hausdorff) upper semicontinuity, (Hausdorff) lower semicontinuity, outer-continuity and outer-openness of solutions for such problems. Many examples are provided to illustrate the essentialness of the imposed assumptions. For the applications, we obtain the stability results for the parametric vector variational inequality problems with equilibrium constraints and parametric vector optimization problems with equilibrium constraints.

97 MATHEMATICS AND COMPUTING↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗