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 109 records · Page 6

Computational Methods for Analyzing Fluid Flow Dynamics from Digital Imagery

The main goal (long term) of this work is to perform computational dynamics analysis and quantify uncertainty from vector fields computed directly from measured data. Global analysis based on observed spatiotemporal evolution is performed by objective function based on expected physics and informed scientific priors, variational optimization to compute vector fields from measured data, and transport analysis proceeding with observations and priors. A mathematical formulation for computing flow fields is set up for computing the minimizer for the problem. An application to oceanic flow based on sea surface temperature is presented.

42 ENGINEERING↗

Gravitational form factors of glueballs in Yang-Mills theory

This work presents preliminary results of the first determination of the energy-momentum tensor form factors of the scalar glueball, referred to as gravitational form factors (GFFs). The calculation has been carried out in lattice Yang-Mills theory at a single lattice spacing. Using variationally optimized operators, the matrix elements are extracted from ratios of three-point functions to two-point functions. The glueball GFFs and their kinematic dependence are compared to those of other hadrons from previous calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Noise-induced transition in optimal solutions of variational quantum algorithms

Variational quantum algorithms are promising candidates for delivering practical quantum advantage on noisy intermediate-scale quantum (NISQ) hardware. However, optimizing the noisy cost functions associated with these algorithms is challenging for system sizes relevant to quantum advantage. In this work, we investigate the effect of noise on optimization by studying a variational quantum eigensolver (VQE) algorithm calculating the ground state of a spin chain model, and we observe an abrupt transition induced by noise to the optimal solutions. We will present numerical simulations, a demonstration using an IBM quantum processor unit (QPU), and a theoretical analysis indicating the origin of this transition. Our findings suggest that careful analysis is crucial to avoid misinterpreting the noise-induced features as genuine algorithm results.

Li, Andy C.Y.↗

Path optimization by a variational reaction coordinate method. I. Development of formalism and algorithms

The development of algorithms to optimize reaction pathways between reactants and products is an active area of study. Existing algorithms typically describe the path as a discrete series of images (chain of states) which are moved downhill toward the path, using various reparameterization schemes, constraints, or fictitious forces to maintain a uniform description of the reaction path. The Variational Reaction Coordinate (VRC) method is a novel approach that finds the reaction path by minimizing the variational reaction energy (VRE) of Quapp and Bofill. The VRE is the line integral of the gradient norm along a path between reactants and products and minimization of VRE has been shown to yield the steepest descent reaction path. In the VRC method, we represent the reaction path by a linear expansion in a set of continuous basis functions and find the optimized path by minimizing the VRE with respect to the linear expansion coefficients. Improved convergence is obtained by applying constraints to the spacing of the basis functions and coupling the minimization of the VRE to the minimization of one or more points along the path that correspond to intermediates and transition states. The VRC method is demonstrated by optimizing the reaction path for the Müller-Brown surface and by finding a reaction path passing through 5 transition states and 4 intermediates for a 10 atom Lennard-Jones cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Variational stability of optimal control problems involving subdifferential operators

This paper is concerned with the problem of minimizing an integral functional with control-nonconvex integrand over the class of solutions of a control system in a Hilbert space subject to a control constraint given by a phase-dependent multivalued map with closed nonconvex values. The integrand, the subdifferential operators, the perturbation term, the initial conditions and the control constraint all depend on a parameter. Along with this problem, the paper considers the problem of minimizing an integral functional with control-convexified integrand over the class of solutions of the original system, but now subject to a convexified control constraint. By a solution of a control system we mean a 'trajectory-control' pair. For each value of the parameter, the convexified problem is shown to have a solution, which is the limit of a minimizing sequence of the original problem, and the minimal value of the functional with the convexified integrand is a continuous function of the parameter. This property is commonly referred to as the variational stability of a minimization problem. An example of a control parabolic system with hysteresis and diffusion effects is considered. Bibliography: 24 titles.

97 MATHEMATICS AND COMPUTING↗

Optimal Observations for Variational Data Assimilation

An important aspect of Ocean state estimation is the design of an observing system that allows the efficient study of climate aspects in the ocean. A solution of the design problem is presented here in terms of optimal observations that emerge as nondimensionalized singular vectors of the modified data resolution matrix. The actual computation is feasible only for scalar quantities in the limit of large observational errors. In the framework of a lo resolution North Atlantic primitive equation model it is demonstrated that such optimal observations when applied to determining the strength of the volume and heat transport across the Greenland-Scotland ridge, perform significantly better than traditional section data. On seasonal to inter-annual time-scales optimal observations are located primarily along the continental shelf and information about heat-transport, wind stress and stratification is being communicated via boundary waves and advective processes. On time-scales of about a month, sea surface height observations appear to be more efficient in reconstructing the cross-ridge heat transport than hydrographic observations. Optimal observations also provide a tool for understanding how the ocean state is effected by anomalies of integral quantities such as meridional heat transport.

Koehl, Armin↗

Noise-Induced Transition in Optimal Solutions of Variational Quantum Algorithms

Variational quantum algorithms are widely considered a promising class of near-team algorithms that may demonstrate a practical quantum advantage in problems of scientific interest. One of the major obstacles to a scalable realization is the difficulty in optimizing the noisy cost function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm

Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are particularly attractive candidates for implementation on near-term quantum processors. As hardware realities such as error and qubit connectivity will constrain achievable circuit depth in the near future, new ways to achieve high performance at low depth are of great interest. In this work, we present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation axis in the XY plane of the mixer Hamiltonian. Here, via numerical simulation, we show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MaxCut problem on graphs of up to seven qubits. Furthermore, we explore the Z-phase error mitigation properties of our modified Ansatz, its performance under a realistic error model for a neutral atom quantum processor, and the class of problems it can solve in a single round.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

Controls-structures integrated design optimization with shape variations

The shape design variables have been introduced into the set of design variables of the Controls-Structure Integrated (CSI) Design of space-structures. The importance of the shape variations in improving the design (obtained with only control and sizing variables) has been aptly illustrated. Two different types of design variables that describe the shape variations of the structure have been introduced. In the first case, the nodal coordinates have been considered as design variables. This has the inherent difficulty of having too many design variables. This not only is time consuming but also memory intensive and may not yield a manufacturable shape to the structure. The second approach has been introduced to overcome this difficulty. The structure is allowed to vary in a particular pre defined pattern. The coefficients of these patterns are considered as the shape design variables. The eigenvalue and eigenvector sensitivity equations with respect to these coefficient design variables have been developed and are used to approximate the eigenvalues and eigenvectors in a perturbed design.

Koganti, Gopichand↗