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 55 records · Page 3

The discrete complementary variational principle and optimal control systems

A discrete complementary variational principle is developed and applied to linear and nonlinear discrete-time optimal control systems. Using the variational approach, a primal-dual relationship is established. This relationship provides a precise measure of system suboptimality independent of any a priori knowledge of the optimal solution.

Chan, W. L.↗

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fully variational incremental CASSCF

We report the complete-active-space self-consistent field (CASSCF) method is a canonical electronic structure theory that holds a central place in conceptualizing and practicing first principles simulations. For application to realistic molecules, however, the CASSCF must be approximated to circumvent its exponentially scaling computational costs. Applying the many-body expansion - also known as the method of increments - to CASSCF (iCASSCF) has been shown to produce a polynomially scaling method that retains much of the accuracy of the parent theory and is capable of treating full valence active spaces. Due to an approximation made in the orbital gradient, the orbital parameters of the original iCASSCF formulation could not be variationally optimized, which limited the accuracy of its nuclear gradient. Herein, a variational iCASSCF is introduced and implemented, where all parameters are fully optimized during energy minimization. This method is able to recover electronic correlations from the full valence space in large systems, produce accurate gradients, and optimize stable geometries as well as transition states. Demonstrations on challenging test cases, such as the oxoMn(salen)Cl complex with 84 electrons in 84 orbitals and the automerization of cyclobutadiene, show that the fully variational iCASSCF is a powerful tool for describing challenging molecular chemistries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Renormalization group improved optimized perturbation theory: Revisiting the mass gap of the O(2N) Gross-Neveu model

We introduce an extension of a variationally optimized perturbation method, by combining it with renormalization group properties in a straightforward (perturbative) form. This leads to a very transparent and efficient procedure, with a clear improvement of the nonperturbative results with respect to previous similar variational approaches. This is illustrated here by deriving optimized results for the mass gap of the O(2N) Gross-Neveu model, compared with the exactly known results for arbitrary N. At large N, the exact result is reproduced already at the very first order of the modified perturbation using this procedure. For arbitrary values of N, using the original perturbative information only known at two-loop order, we obtain a controllable percent accuracy or less, for any N value, as compared with the exactly known result for the mass gap from the thermodynamical Bethe Ansatz. The procedure is very general and can be extended straightforwardly to any renormalizable Lagrangian model, being systematically improvable provided that a knowledge of enough perturbative orders of the relevant quantities is available.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Mission and system optimization of nuclear electric propulsion vehicles for lunar and Mars missions

The detailed mission and system optimization of low thrust electric propulsion missions is a complex, iterative process involving interaction between orbital mechanics and system performance. Through the use of appropriate approximations, initial system optimization and analysis can be performed for a range of missions. The intent of these calculations is to provide system and mission designers with simple methods to assess system design without requiring access or detailed knowledge of numerical calculus of variations optimizations codes and methods. Approximations for the mission/system optimization of Earth orbital transfer and Mars mission have been derived. Analyses include the variation of thruster efficiency with specific impulse. Optimum specific impulse, payload fraction, and power/payload ratios are calculated. The accuracy of these methods is tested and found to be reasonable for initial scoping studies. Results of optimization for Space Exploration Initiative lunar cargo and Mars missions are presented for a range of power system and thruster options.

Gilland, James H.↗

Analytic computation of energy derivatives - Relationships among partial derivatives of a variationally determined function

Formulas are presented relating Taylor series expansion coefficients of three functions of several variables, the energy of the trial wave function (W), the energy computed using the optimized variational wave function (E), and the response function (lambda), under certain conditions. Partial derivatives of lambda are obtained through solution of a recursive system of linear equations, and solution through order n yields derivatives of E through order 2n + 1, extending Puley's application of Wigner's 2n + 1 rule to partial derivatives in couple perturbation theory. An examination of numerical accuracy shows that the usual two-term second derivative formula is less stable than an alternative four-term formula, and that previous claims that energy derivatives are stationary properties of the wave function are fallacious. The results have application to quantum theoretical methods for the computation of derivative properties such as infrared frequencies and intensities.

King, H. F.↗

Higher-Order Extended Lagrangian Born–Oppenheimer Molecular Dynamics for Classical Polarizable Models

Generalized extended Lagrangian Born-Oppenheimer molecular dynamics (XLBOMD) methods provide a framework for fast iteration-free simulations of models that normally require expensive electronic ground state optimizations prior to the force evaluations at every time step. XLBOMD uses dynamically driven auxiliary degrees of freedom that fluctuate about a variationally optimized ground state of an approximate “shadow” potential which approximates the true reference potential. While the requirements for such shadow potentials are well understood, constructing such potentials in practice has previously been ad hoc, and in this work, we present a systematic development of XLBOMD shadow potentials that match the reference potential to any order. We also introduce a framework for combining friction-like dissipation for the auxiliary degrees of freedom with general-order integration, a combination that was not previously possible. These developments are demonstrated with a simple fluctuating charge model and point induced dipole polarization models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exact-two-component block-localized wave function: A simple scheme for the automatic computation of relativistic ΔSCF

Block-localized wave function is a useful method for optimizing constrained determinants. In this article, we extend the generalized block-localized wave function technique to relativistic two-component framework. Optimization of excited state determinants for two-component wave functions presents a unique challenge because the excited state manifold is often quite dense with degenerate states. Furthermore, we test the degree to which certain symmetries result naturally from the ΔSCF optimization such as time reversal symmetry and symmetry with respect to the total angular momentum operator on a series of atomic systems. Variational optimizations may often break symmetry in order to lower the overall energy, just as unrestricted Hartree-Fock breaks spin symmetry. Overall, we demonstrate that time reversal symmetry is roughly maintained when using Hartree-Fock, but less so when using Kohn-Sham density functional theory. Additionally, maintaining total angular momentum symmetry appears to be system dependent and not guaranteed. Finally, we were able to trace the breaking of total angular momentum symmetry to the relaxation of core electrons.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computer simulation for time optimal or energy optimal attitude control of spin-stabilized spacecraft.

An original technique for determining the optimal magnetic torque strategy for control of the attitude of spin stabilized spacecraft is presented. By employing Lagrange multipliers and the Calculus of Variations, optimal control equations are derived which define minimum time and minimum energy attitude maneuvers. Computer program algorithms to numerically solve these optimal control equations are also described. The performance of this technique is compared with a commonly employed planning method.

Woolley, R. D.↗

Multiobjective Optimization of Low-Energy Trajectories Using Optimal Control on Dynamical Channels

We introduce a computational method to design efficient low-energy trajectories by extracting initial solutions from dynamical channels formed by invariant manifolds, and improving these solutions through variational optimal control. We consider trajectories connecting two unstable periodic orbits in the circular restricted 3-body problem (CR3BP). Our method leverages dynamical channels to generate a range of solutions, and approximates the areto front for impulse and time of flight through a multiobjective optimization of these solutions based on primer vector theory. We demonstrate the application of our method to a libration orbit transfer in the Earth-Moon system.

trajectory design↗

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem, in which non-cost related objectives are optimized subject to power flow constraints and the convex relaxation is generally inexact, are elaborated in detail. One is the maximum loadability problem, which is formulated as a special OPF problem that seeks the maximal distance to the boundary of power flow insolvability. The proposed method is shown to outperform commercial nonlinear solvers in terms of robustness and efficiency. The other is the bi-objective OPF problem. A non-parametric scalarization model is suggested, and is further reformulated as an extended OPF problem by convexifying the objective function. It provides a single trade-off solution without any subjective preference. The proposed computation framework also helps retrieve the Pareto front of the bi-objective OPF via the e-constraint method or the normal boundary intersection method. This paper also discusses extensions for OPF problems over meshed networks based on the semidefinite programming relaxation method.

bi-objective optimization↗

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Absence of Barren Plateaus and Scaling of Gradients in the Energy Optimization of Isometric Tensor Network States

Abstract Vanishing gradients can pose substantial obstacles for high-dimensional optimization problems. Here we consider energy minimization problems for quantum many-body systems with extensive Hamiltonians and finite-range interactions, which can be studied on classical computers or in the form of variational quantum eigensolvers on quantum computers. Barren plateaus correspond to scenarios where the average amplitude of the energy gradient decreases exponentially with increasing system size. This occurs, for example, for quantum neural networks and for brickwall quantum circuits when the depth increases polynomially in the system size. Here we prove that the variational optimization problems for matrix product states, tree tensor networks, and the multiscale entanglement renormalization ansatz are free of barren plateaus. The derived scaling properties for the gradient variance provide an analytical guarantee for the trainability of randomly initialized tensor network states (TNS) and motivate certain initialization schemes. In a suitable representation, unitary tensors that parametrize the TNS are sampled according to the uniform Haar measure. We employ a Riemannian formulation of the gradient based optimizations which simplifies the analytical evaluation.

Barthel, Thomas↗

Explicit inclusion of electronic correlation effects in molecular dynamics

Here, we design a quantum molecular dynamics method for strongly correlated electron metals. The strong electronic correlation effects are treated within a real-space version of the Gutzwiller variational approximation (GA), which is suitable for the inhomogeneity inherent in the process of quantum molecular dynamics (MD) simulations. We also propose an efficient algorithm based on the second-moment approximation to the electronic density of states for the search of the optimal variation parameters, from which the renormalized interatomic MD potentials are fully determined. By considering a minimal one-correlated-orbital Anderson model with parameterized spatial dependence of tight-binding hopping integrals, this fast GA-MD method is benchmarked with that using exact diagonalization to solve the GA variational parameters. The efficiency and accuracy are illustrated. We have demonstrated the effect of temperature coupled with electronic correlation on structural properties simulated with MD. This method will open up an unprecedented opportunity enabling large-scale quantum MD simulations of strongly correlated electronic materials.

36 MATERIALS SCIENCE↗