Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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 379 records · Page 21

Imposing equilibrium on experimental 3-D stress fields using Hodge decomposition and FFT-based optimization

Here, we present a methodology to impose micromechanical constraints, i.e. stress equilibrium at grain and sub-grain scale, to an arbitrary (non-equilibrated) voxelized stress field obtained, for example, by means of synchrotron X-ray diffraction techniques. The method consists in finding the equilibrated stress field closest (in L 2 -norm sense) to the measured non-equilibrated stress field, via the solution of an optimization problem. The extraction of the divergence-free (equilibrated) part of a general (non-equilibrated) field is performed using the Hodge decomposition of a symmetric matrix field, which is the generalization of the Helmholtz decomposition of a vector field into the sum of an irrotational field and a solenoidal field. The combination of: a) the Euler–Lagrange equations that solve the optimization problem, and b) the Hodge decomposition, gives a differential expression that contains the bi-harmonic operator and two times the curl operator acting on the experimental stress field. These high-order derivatives can be efficiently performed in Fourier space. The method is applied to filter the non-equilibrated parts of a synthetic piecewise constant stress fields with a known ground truth, and stress fields in Gum Metal, a beta-Ti-based alloy measured in-situ using Diffraction Contrast Tomography (DCT). In both cases, the largest corrections were obtained near grain boundaries.

36 MATERIALS SCIENCE↗

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↗

A Singular Differential Equation Stemming from an Optimal Control Problem in Financial Economics

We consider the ordinary differential equation <##> } x 2 u &#x2033; = a x u &#x2032; + b u &#x2212;<!-- ??? --> c } }( u &#x2032; &#x2212;<!-- ??? --> 1 } }) 2 , x &#x2208;<!-- ??? --> }( 0 , x 0 }) , $$ x^2 u''=axu'+bu-c /bigl(u'-1/bigr)^2, /quad x/in(0,x{sub 0}), $$ x{sup 2}u{sup ″}=axu{sup ′}+bu−c(u{sup ′}−1){sup 2}, x∈(0,x{sub 0}), </##> with <##> } a &#x2208;<!-- ??? --> } }R , b &#x2208;<!-- ??? --> } }R $ a/in/mathbb{R}, b/in/mathbb{R} $ a∈R,b∈R </##>, c>0 and the singular initial condition u(0)=0, which in financial economics describes optimal disposal of an asset in a market with liquidity effects. It is shown in the paper that if a+b<0 then no continuous solutions exist, whereas if a+b>0 then there are infinitely many continuous solutions with indistinguishable asymptotics near 0. Moreover, it is proved that in the latter case there is precisely one solution u corresponding to the choice x{sub 0}=∞ which is such that 0≤u(x)≤x for all x>0, and that this solution is strictly increasing and concave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advanced Computational Methods for Security Constrained Financial Transmission Rights: Structure and Parallelism

Financial Transmission Rights (FTRs) help power market participants reduce price risks associated with transmission congestion. FTRs are issued based on a process of solving a constrained optimization problem with the objective to maximize the FTR social welfare under power flow security constraints. Security constraints for different FTR categories (monthly, seasonal or annual) are usually coupled and the number of constraints increases exponentially with the number of categories. Commercial software for FTR calculation can only provide limited categories of FTRs due to the inherent computational challenges mentioned above. In this paper, a novel non-linear dynamical system (NDS) approach is proposed to solve the optimization problem. The new formulation and performance of the NDS solver is benchmarked against widely used linear programming (LP) solvers like CPLEX™ and tested on large-scale systems using data from the Western Electricity Coordinating Council (WECC). The NDS is demonstrated to outperform the widely used CPLEX algorithms while exhibiting superior scalability. Furthermore, the NDS based solver can be easily parallelized which results in significant computational improvement.

Environmental Molecular Sciences Laboratory↗

Stiffness optimization of non-linear elastic structures

Our paper revisits stiffness optimization of non-linear elastic structures. Due to the non-linearity, several possible stiffness measures can be identified and in this work conventional compliance, i.e. secant stiffness designs are compared to tangent stiffness designs. The optimization problem is solved by the method of moving asymptotes and the sensitivities are calculated using the adjoint method. And for the tangent cost function it is shown that although the objective involves the third derivative of the strain energy an efficient formulation for calculating the sensitivity can be obtained. Loss of convergence due to large deformations in void regions is addressed by using a fictitious strain energy such that small strain linear elasticity is approached in the void regions. We formulate a well-posed topology optimization problem by using restriction which is achieved via a Helmholtz type filter. The numerical examples provided show that for low load levels, the designs obtained from the different stiffness measures coincide whereas for large deformations significant differences are observed.

42 ENGINEERING↗

An Adaptive Newton-Based Free-Boundary Grad–Shafranov Solver

Equilibria in magnetic confinement devices result from force balancing between the Lorentz force and the plasma pressure gradient. In an axisymmetric configuration like a tokamak, such an equilibrium is described by an elliptic equation for the poloidal magnetic flux, commonly known as the Grad–Shafranov equation. It is challenging to develop a scalable and accurate free-boundary Grad–Shafranov solver, since it is a fully nonlinear optimization problem that simultaneously solves for the magnetic field coil current outside the plasma to control the plasma shape. In this work, we develop a Newton-based free-boundary Grad–Shafranov solver using adaptive finite elements and preconditioning strategies. The free-boundary interaction leads to the evaluation of a domain-dependent nonlinear form of which its contribution to the Jacobian matrix is achieved through shape calculus. The optimization problem aims to minimize the distance between the plasma boundary and specified control points while satisfying two nontrivial constraints, which correspond to the nonlinear finite element discretization of the Grad–Shafranov equation and a constraint on the total plasma current involving a nonlocal coupling term. The linear system is solved by a block factorization, and AMG is called for subblock elliptic operators. The unique contributions of this work include the treatment of a global constraint, preconditioning strategies, nonlocal reformulation, and the implementation of adaptive finite elements. Furthermore, it is found that the resulting Newton solver is robust, successfully reducing the nonlinear residual to 1e-6 and lower in a small handful of iterations while addressing the challenging case to find a Taylor state equilibrium where conventional Picard-based solvers fail to converge.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Improving the efficiency of branch-and-bound complete-search NMR assignment using the symmetry of molecules and spectra

Nuclear magnetic resonance (NMR) assignment of small molecules is presented as a typical example of a combinatorial optimization problem in chemical physics. Three strategies that help improve the efficiency of solution search by the branch and bound method are presented: 1. reduction of the size of the solution space by resort to a condensed structure formula, wherein symmetric nuclei are grouped together; 2. partitioning of the solution space based on symmetry, that becomes the basis for an efficient branching procedure; and 3. a criterion of selection of input restrictions that leads to increased gaps between branches and thus faster pruning of non-viable solutions. Although the examples chosen to illustrate this work focus on small-molecule NMR assignment, the results are generic and might help solving other combinatorial optimization problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Scalable flexibility control of distributed loads in a power grid

The technology described herein is generally directed towards a distributed optimization technology for the control of aggregation of distributed flexibility resource nodes that operates iteratively until a commanded power profile is produced by aggregated loads. The technology uses a distributed iterative solution in which each node solves a local optimization problem with local constraints and states, while using a global Lagrange multiplier that is based upon information from each other node. The global Lagrange multiplier is determined at an aggregation level using load-specific information that is obtained in a condensed form (e.g., a scalar) from each node at each iteration. The global Lagrange multiplier is broadcasted to the nodes for each new iteration. The technology provides an iterative, distributed solution to the network optimization problem of power tracking of aggregated loads.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Efficient Probabilistic Computing with Stochastic Perovskite Nickelates

Probabilistic computing has emerged as a viable approach to solve hard optimization problems. Devices with inherent stochasticity can greatly simplify their implementation in electronic hardware. In this report we demonstrate intrinsic stochastic resistance switching controlled via electric fields in perovskite nickelates doped with hydrogen. The ability of hydrogen ions to reside in various metastable configurations in the lattice leads to a distribution of transport gaps. With experimentally characterized p-bits, a shared-synapse p-bit architecture demonstrates highly parallelized and energy-efficient solutions to optimization problems such as integer factorization and Boolean satisfiability. The results introduce perovskite nickelates as scalable potential candidates for probabilistic computing and showcase the potential of light-element dopants in next-generation correlated semiconductors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Scalable Representation Learning for Long-Term Augmented Reality-Based Information Delivery in Collaborative Human-Robot Perception

Augmented reality (AR)-based information delivery has been attracting an increasing attention in the past few years to improve com- munication in human-robot teaming. In the long-term use of AR systems for collaborative human-robot perception, one of the biggest challenges is to perform place and scene matching under long-term environmental changes, such as dramatic variations in lighting, weather and vegetation across di erent times of the day, months, and seasons. To address this challenge, we introduce a novel representation learning approach that learns a scalable long-term representation model that can be used for place and scene matching in various long-term conditions. Our approach is formulated as a regularized optimization problem, which selects the most representative scene templates in di erent scenarios to construct a scalable representation of the same place that can exhibit signi cant long-term environment changes. Our approach adaptively learns to select a small subset of the templates to construct the representation model, based on a user-de ned representativeness threshold, which makes the learned model highly scalable to the long-term variations in real-world applications. To solve the formulated optimization problem, a new algo- rithmic solver is designed, which is theoretically guaranteed to converge to the global optima. Experiments are conducted using two large-scale benchmark datasets, which have demonstrated the superior performance of our approach for long-term place and scene matching.

42 ENGINEERING↗

A Regularized Entropy-Based Moment Method for Kinetic Equations

Here, we present a new entropy-based moment method for the velocity discretization of kinetic equations. This method is based on a regularization of the optimization problem defining the original entropy-based moment method, and this gives the new method the advantage that the moment vectors of the solution do not have to take on realizable values. We show that this equation still retains many of the properties of the original equations, including hyperbolicity, an entropy-dissipation law, and rotational invariance. The cost of the regularization is mismatch between the moment vector of the solution and that of the ansatz returned by the regularized optimization problem. However, we show how to control this error using the parameter defining the regularization. This suggests that with proper choice of the regularization parameter, the new method can be used to generate accurate solutions of the original entropy-based moment method, and we confirm this with numerical simulations.

97 MATHEMATICS AND COMPUTING↗

Constrained Versions of DEDICOM for Use in Unsupervised Part-Of-Speech Tagging

This reports describes extensions of DEDICOM (DEcomposition into DIrectional COMponents) data models [3] that incorporate bound and linear constraints. The main purpose of these extensions is to investigate the use of improved data models for unsupervised part-of-speech tagging, as described by Chew et al. [2]. In that work, a single domain, two-way DEDICOM model was computed on a matrix of bigram fre- quencies of tokens in a corpus and used to identify parts-of-speech as an unsupervised approach to that problem. An open problem identi ed in that work was the com- putation of a DEDICOM model that more closely resembled the matrices used in a Hidden Markov Model (HMM), speci cally through post-processing of the DEDICOM factor matrices. The work reported here consists of the description of several models that aim to provide a direct solution to that problem and a way to t those models. The approach taken here is to incorporate the model requirements as bound and lin- ear constrains into the DEDICOM model directly and solve the data tting problem as a constrained optimization problem. This is in contrast to the typical approaches in the literature, where the DEDICOM model is t using unconstrained optimization approaches, and model requirements are satis ed as a post-processing step.

97 MATHEMATICS AND COMPUTING↗

Quantum Interior Point Methods for Semidefinite Optimization

We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.

Augustino, Brandon↗

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗

Parallel Algorithms for Graph Optimization using Tree Decompositions

Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of required dynamic programming tables and excessive running times of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree-decomposition based approach to solve maximum weighted independent set. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Weerapurage, Dinesh P↗

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An accurate bilinear cavern model for compressed air energy storage

Compressed air energy storage is suitable for large-scale electrical energy storage, which is important for integrating renewable energy sources into electric power systems. A typical compressed air energy storage plant consists of compressors, expanders, caverns, and a motor/generator set. Current cavern models used for compressed air energy storage are either accurate but highly nonlinear or linear but inaccurate. The application of highly nonlinear cavern models in power system optimization problems renders them computationally challenging to solve. In this regard, an accurate bilinear cavern model for compressed air energy storage is proposed. The charging and discharging processes in a cavern are divided into several real/virtual states. The first law of thermodynamics and ideal gas law are then utilized to derive a cavern model, i.e., a model for the variation of temperature and pressure in these processes. Thereafter, the heat transfer between the air in the cavern and the cavern wall is considered and integrated into the cavern model. By subsequently eliminating several negligible terms, the cavern model reduces to a bilinear model. The accuracy of the bilinear cavern model is verified via comparison with both an accurate nonlinear model and two sets of field-measured data. The bilinear cavern model can be easily linearized and is then suitable for integration into optimization problems considering compressed air energy storage. This is verified via comparatively solving a self-scheduling problem of compressed air energy storage using different cavern models.

25 ENERGY STORAGE↗