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 1,801 records · Page 100

Joint ptycho-tomography with deep generative priors

Abstract Joint ptycho-tomography is a powerful computational imaging framework to recover the refractive properties of a 3D object while relaxing the requirements for probe overlap that is common in conventional phase retrieval. We use an augmented Lagrangian scheme for formulating the constrained optimization problem and employ an alternating direction method of multipliers (ADMM) for the joint solution. ADMM allows the problem to be split into smaller and computationally more efficient subproblems: ptychographic phase retrieval, tomographic reconstruction, and regularization of the solution. We extend our ADMM framework with plug-and-play (PnP) denoisers by replacing the regularization subproblem with a general denoising operator based on machine learning. While the PnP framework enables integrating such learned priors as denoising operators, tuning of the denoiser prior remains challenging. To overcome this challenge, we propose a denoiser parameter to control the effect of the denoiser and to accelerate the solution. In our simulations, we demonstrate that our proposed framework with parameter tuning and learned priors generates high-quality reconstructions under limited and noisy measurement data.

97 MATHEMATICS AND COMPUTING↗

Qualitative and quantitative enhancement of parameter estimation for model-based diagnostics using automatic differentiation with an application to inertial fusion

Parameter estimation using observables is a fundamental concept in the experimental sciences. Mathematical models that represent the physical processes can enable reconstructions of the experimental observables and greatly assist in parameter estimation by turning it into an optimization problem which can be solved by gradient-free or gradient-based methods. In this work, the recent rise in flexible frameworks for developing differentiable scientific computing programs is leveraged in order to dramatically accelerate data analysis of a common experimental diagnostic relevant to laser–plasma and inertial fusion experiments, Thomson scattering. A differentiable Thomson-scattering data analysis tool is developed that uses reverse-mode automatic differentiation (AD) to calculate gradients. By switching from finite differencing to reverse-mode AD, three distinct outcomes are achieved. First, gradient descent is accelerated dramatically to the extent that it enables near real-time usage in laser–plasma experiments. Second, qualitatively novel quantities which require $\mathcal{O}(10^3)$ parameters can now be included in the analysis of data which enables unprecedented measurements of small-scale laser–plasma phenomena. Third, uncertainty estimation approaches that leverage the value of the Hessian become accurate and efficient because reverse-mode AD can be used for calculating the Hessian.

97 MATHEMATICS AND COMPUTING↗

Deep reinforcement learning of cell movement in the early stage of C.elegans embryogenesis

Motivation: Cell movement in the early phase of Caenorhabditis elegans development is regulated by a highly complex process in which a set of rules and connections are formulated at distinct scales. Previous efforts have demonstrated that agent-based, multi-scale modeling systems can integrate physical and biological rules and provide new avenues to study developmental systems. However, the application of these systems to model cell movement is still challenging and requires a comprehensive understanding of regulatory networks at the right scales. Recent developments in deep learning and reinforcement learning provide an unprecedented opportunity to explore cell movement using 3D time-lapse microscopy images. Results: We present a deep reinforcement learning approach within an agent-based modeling system to characterize cell movement in the embryonic development of C.elegans. Our modeling system captures the complexity of cell movement patterns in the embryo and overcomes the local optimization problem encountered by traditional rule-based, agent-based modeling that uses greedy algorithms. Here, we tested our model with two real developmental processes: the anterior movement of the Cpaaa cell via intercalation and the rearrangement of the superficial left-right asymmetry. In the first case, the model results suggested that Cpaaa’s intercalation is an active directional cell movement caused by the continuous effects from a longer distance (farther than the length of two adjacent cells), as opposed to a passive movement caused by neighbor cell movements. In the second case, a leader-follower mechanism well explained the collective cell movement pattern in the asymmetry rearrangement. These results showed that our approach to introduce deep reinforcement learning into agent-based modeling can test regulatory mechanisms by exploring cell migration paths in a reverse engineering perspective. Lastly, this model opens new doors to explore the large datasets generated by live imaging. Availability and implementation: Source code is available at https://github.com/zwang84/drl4cellmovement.

59 BASIC BIOLOGICAL SCIENCES↗

Simultaneous inference of plate boundary stresses and mantle rheology using adjoints: large-scale 2-D models

SUMMARY Plate motions are a primary surface constraint on plate and mantle dynamics and rheology, plate boundary stresses and the occurrence of great earthquakes. Within an optimization method, we use plate motion data to better constrain uncertain mantle parameters. For the optimization problem characterizing the maximum a posteriori rheological parameters we derive gradients using adjoints and expressions to approximate the posterior distributions for stresses within plate boundaries. We apply these methods to a 2-D cross section from the western to eastern Pacific, with temperature distributions and fault zone geometries developed primarily from seismic and plate motion data. We find that the best-fitting stress exponent, n, is about 2.8 and the yield stress about 100 MPa or less. The normal stress on the interplate fault zones is about 100 MPa and the shear stresses about 10 MPa or less.

Rudi, Johann (ORCID:0000000265639265)↗

Exact and inexact subsampled Newton methods for optimization

Abstract The paper studies the solution of stochastic optimization problems in which approximations to the gradient and Hessian are obtained through subsampling. We first consider Newton-like methods that employ these approximations and discuss how to coordinate the accuracy in the gradient and Hessian to yield a superlinear rate of convergence in expectation. The second part of the paper analyzes an inexact Newton method that solves linear systems approximately using the conjugate gradient (CG) method, and that samples the Hessian and not the gradient (the gradient is assumed to be exact). We provide a complexity analysis for this method based on the properties of the CG iteration and the quality of the Hessian approximation, and compare it with a method that employs a stochastic gradient iteration instead of the CG method. We report preliminary numerical results that illustrate the performance of inexact subsampled Newton methods on machine learning applications based on logistic regression.

Mathematics↗

Dynamics of reverse annealing for the fully connected p -spin model

Reverse annealing is a relatively new variant of quantum annealing in which one starts from a classical state and increases and then decreases the amplitude of the transverse field, in the hope of finding a better classical state than the initial state for a given optimization problem. We numerically study the unitary quantum dynamics of reverse annealing for the mean-field-type p -spin model and show that the results are consistent with the predictions of equilibrium statistical mechanics. In particular, we corroborate the equilibrium analysis prediction that reverse annealing provides an exponential speedup over conventional quantum annealing in terms of solving the p -spin model. This lends support to the expectation that equilibrium analyses are effective at revealing essential aspects of the dynamics of quantum annealing. We also compare the results of quantum dynamics with the corresponding classical dynamics to reveal their similarities and differences. We distinguish between two reverse annealing protocols we call adiabatic and iterated reverse annealing. We further show that iterated reverse annealing, as has been realized in the D-Wave device, is ineffective in the case of the p-spin model but note that a recently introduced protocol (“ h -gain”), which implements adiabatic reverse annealing, may lead to improved performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of many-body quantum Hamiltonians via compressive sensing

We develop an efficient and robust approach for quantum measurement of nearly sparse many-body quantum Hamiltonians based on the method of compressive sensing. This work demonstrates that with only O(sln(d)) experimental configurations, consisting of random local preparations and measurements, one can estimate the Hamiltonian of a d-dimensional system, provided that the Hamiltonian is nearly s sparse in a known basis. The classical postprocessing is a convex optimization problem on the total Hilbert space which is generally not scalable. We numerically simulate the performance of this algorithm for three- and four-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the algorithm to characterize Hamiltonian fine structure and unknown system-bath interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of the phonon relaxation times using solutions of the Boltzmann transport equation

We present a method for reconstructing the phonon relaxation time distribution τ ω = τ ( ω ) (including polarization) in a material from thermal spectroscopy data. The distinguishing feature of this approach is that it does not make use of the effective thermal conductivity concept and associated approximations. The reconstruction is posed as an optimization problem in which the relaxation times τ ω = τ (ω) are determined by minimizing the discrepancy between the experimental relaxation traces and solutions of the Boltzmann transport equation for the same problem. The latter may be analytical, in which case the procedure is very efficient, or numerical. The proposed method is illustrated using Monte Carlo solutions of thermal grating relaxation as synthetic experimental data. Lastly, the reconstruction is shown to agree very well with the relaxation times used to generate the synthetic Monte Carlo data and remains robust in the presence of uncertainty (noise).

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Three-dimensional reconstruction of statistically optimal unit cells of polydisperse particulate composites from microtomography

In this paper, we present a systematic approach for characterization and reconstruction of statistically optimal representative unit cells of polydisperse particulate composites. Microtomography is used to gather rich three-dimensional data of a packed glass bead system. First-, second-, and third-order probability functions are used to characterize the morphology of the material, and the parallel augmented simulated annealing algorithm is employed for reconstruction of the statistically equivalent medium. Both the fully resolved probability spectrum and the geometrically exact particle shapes are considered in this study, rendering the optimization problem multidimensional with a highly complex objective function. A ten-phase particulate composite composed of packed glass beads in a cylindrical specimen is investigated, and a unit cell is reconstructed on massively parallel computers. Further, rigorous error analysis of the statistical descriptors (probability functions) is presented and a detailed comparison between statistics of the voxel-derived pack and the representative cell is made.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards string order melting of spin-1 particle chains in superconducting transmons using optimal control

Utilizing optimal control to simulate a model Hamiltonian is an emerging strategy that leverages the intrinsic physics of a device with digital quantum simulation methods. Here we evaluate optimal control for probing the nonequilibrium properties of symmetry-protected topological (SPT) states simulated with superconducting hardware. Assuming a tunable transmon architecture, we cast the evolution of these SPT states as a series of one- and two-site pulse optimization problems that are solved in the presence of leakage constraints. From the generated pulses, we classically simulate the time-dependent melting of the perturbed SPT string order across a six-site model with an average state infidelity of 10 -3 . The feasibility of these pulses as well as their efficient application indicate that high-fidelity simulations of string order melting are within reach of current quantum computing systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Circumventing superexponential runtimes for hard instances of quantum adiabatic optimization

Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the evolution. Here, we consider the maximum independent set problem, which can be efficiently encoded in the Hamiltonian describing a Rydberg atom array. We present a general construction of instances of the problem for which the minimum gap decays superexponentially with system size, implying a superexponentially large time to solution via adiabatic evolution. The small gap arises from locally independent choices which cause the system to initially evolve and localize into a configuration far from the solution in terms of Hamming distance. We investigate remedies to this problem. Specifically, we show that quantum quenches in these models can exhibit signatures of quantum many-body scars, which in turn, can circumvent the superexponential gaps. By quenching from a suboptimal configuration, states with a larger ground-state overlap can be prepared, illustrating the utility of quantum quenches as an algorithmic tool. Published by the American Physical Society 2024

Schiffer, Benjamin F. (ORCID:0000000189512157)↗

Partially coherent ptychography by gradient decomposition of the probe

Coherent ptychographic imaging experiments often discard the majority of the flux from a light source to define the coherence of the illumination. Even when the coherent flux is sufficient, the stability required during an exposure is another important limiting factor. Partial coherence analysis can considerably reduce these limitations. A partially coherent illumination can often be written as the superposition of a single coherent illumination convolved with a separable translational kernel. This article proposes the gradient decomposition of the probe (GDP), a model that exploits translational kernel separability, coupling the variances of the kernel with the transverse coherence. An efficient first-order splitting algorithm ( GDP-ADMM ) for solving the proposed nonlinear optimization problem is described. Numerical experiments demonstrate the effectiveness of the proposed method with Gaussian and binary kernel functions in fly-scan measurements. Remarkably, GDP-ADMM using nanoprobes produces satisfactory results even when the ratio between the kernel width and the beam size is more than one, or when the distance between successive acquisitions is twice as large as the beam width.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Bernoulli Gaussian Watermark for Detecting Integrity Attacks in Control Systems

We examine the merit of Bernoulli packet drops in actively detecting integrity attacks on control systems. The aim is to detect an adversary who delivers fake sensor measurements to a system operator in order to conceal their effect on the plant. Physical watermarks, or noisy additive Gaussian inputs, have been previously used to detect several classes of integrity attacks in control systems. In this paper, we consider the analysis and design of Gaussian physical watermarks in the presence of packet drops at the control input. On one hand, this enables analysis in a more general network setting. On the other hand, we observe that in certain cases, Bernoulli packet drops can improve detection performance relative to a purely Gaussian watermark. This motivates the joint design of a Bernoulli-Gaussian watermark which incorporates both an additive Gaussian input and a Bernoulli drop process. We characterize the effect of such a watermark on system performance as well as attack detectability in two separate design scenarios. Here, we consider a correlation detector for attack recognition. We then propose efficiently solvable optimization problems to intelligently select parameters of the Gaussian input and the Bernoulli drop process while addressing security and performance trade-offs. Finally, we provide numerical results which illustrate that a watermark with packet drops can indeed outperform a Gaussian watermark.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Retrieving Top-k Hyperedge Triplets: Models and Applications

Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions can- not be faithfully modeled as collections of pairwise interactions using graphs and instead require hypergraphs. However, methods that analyze hypergraphs directly, rather than via lossy graph reductions, remain limited. Hypergraph motifs hold promise in this regard, as motif patterns serve as building blocks for larger group interactions which are inexpressible by graphs. Recent work has focused on categorizing and counting hypergraph motifs based on the existence of nodes in hyperedge intersection regions. Here, we argue that the relative sizes of hyperedge inter- sections within motifs contain varied and valuable information. We propose a suite of efficient algorithms for finding top-k triplets of hyperedges based on optimizing the sizes of these intersection patterns. This formulation uncovers interesting local patterns of interaction, finding hyperedge triplets that either (1) are the least similar with each other, (2) have the highest pairwise but not groupwise correlation, or (3) are the most similar with each other. We formalize this as a combinatorial optimization problem and design efficient algorithms based on filtering hyperedges. Our comprehensive experimental evaluation shows that the resulting hyperedge triplets yield insightful information on real-world hypergraphs. Our approach is also orders of magnitude faster than a naive baseline implementation.

hypergraphs, motifs, Combinatorial Algorithms↗

Pufferscale: Rescaling HPC Data Services for High Energy Physics Applications

User-space HPC data services are emerging as an appealing alternative to traditional parallel file systems, because of their ability to be tailored to application needs while eliminating unnecessary overheads incurred by POSIX compliance. The High Energy Physics (HEP) community is progressively turning towards such services to enable high-throughput accesses under heavy concurrency to billions of event data produced by instruments and consumed by subsequent analysis workflows. Such services would benefit from the possibility to be rescaled up and down to adapt to changing workloads, as experimental campaigns progress, in order to optimize resource usage. This paper formalizes rescaling a distributed storage system as a multi objective optimization problem considering three criteria: load balance, data balance, and duration of the rescaling operation. We propose a heuristic for rapidly finding a good approximate solution, while allowing users to weight the criteria as needed. The heuristic is evaluated with Pufferscale, a new rescaling manager for microservice-based distributed storage systems. To validate our approach in a real-world ecosystem, we showcase the use of Pufferscale as a means to enable storage malleability in the HEPnOS storage system for HEP applications.

Distributed Storage System↗

Robust Structural Analysis and Design of Distributed Control Systems to Prevent Zero Dynamics Attacks

We consider the design and analysis of robust distributed control systems (DCSs) to ensure the detection of integrity attacks. DCSs are often managed by independent agents and are implemented using a diverse set of sensors and controllers. However, the heterogeneous nature of DCSs along with their scale leave such systems vulnerable to adversarial behavior. To mitigate this reality, we provide tools that allow operators to prevent zero dynamics attacks when as many as p agents and sensors are corrupted. Such a design ensures attack detectability in deterministic systems while removing the threat of a class of stealthy attacks in stochastic systems. To achieve this goal, we use graph theory to obtain necessary and sufficient conditions for the presence of zero dynamics attacks in terms of the structural interactions between agents and sensors. We then formulate and solve optimization problems which minimize communication networks while also ensuring a resource limited adversary cannot perform a zero dynamics attacks. Polynomial time algorithms for design and analysis are provided.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Resilient Operating Constraints for Power Distribution Systems under Setpoint Attacks

Integration and operation of distributed generation (DG) and energy storage (ES) in power distribution systems are enabled by communication networks and embedded sensor and control devices that increase the vulnerability of the systems to cyber-threats, broadening the attack surface and making adversary actions more unpredictable. This paper proposes a methodology that uses ellipsoidal approximations to quantify the potential damage caused by successful attacks that affect, directly or indirectly, the desired operation setpoints and may drive the power distribution operation to unsafe states by violating the limits of voltage or line flows. More specifically, a new methodology is introduced to find the optimal non-symmetric operating constraints that can be imposed to each DG and ES in order to guarantee that the power distribution system is resilient to any malicious setpoints. The proposed method takes as inputs the system topology, DG and ES capabilities, and load limits to solve a convex optimization problem formulated using linear matrix inequalities (LMIs) and the power flow equations. The proposed solution is agnostic to the attacker's action or load profile and it does not require any assumption about the location or means of the attack. The numerical results on a test distribution feeder with several DG and ES illustrate how the proposed resilient operating constraints guarantee the security of the power distribution system under setpoint attacks.

Giraldo, Jairo↗

Optimization-Based Model Reduction Scheme for Renewable Energy Power Plants Using Standardized Testing Scenarios

This paper presents an optimization-based model reduction scheme for renewable energy (RE) power plants consisting of inverter-based resources (IBRs) operating in grid-following (GFL) or grid-forming (GFM) modes. More importantly, the datasets feeding the optimization-based model reduction scheme are generated and re-used through the standardized grid-interactive testing scenarios. Particularly, the proposed scheme makes use of the power plant point of common coupling (PCC) measurements of various quantities specified by standardized tests (e.g., voltage and frequency ride through) as per IEEE 2800, to estimate the parameters of the reduced-order model such that its dynamic performance aligns with the original detailed power plant model. The proposed model reduction approach does not require the parameters of individual IBRs and using standardized test data as input to the formulated optimization problem simplifies the reduced-order modelling scheme. Extensive case studies following standardized test scenarios verified the remarkable accuracy of the proposed approach.

Yallamilli, Ram S. [Purdue University]↗

Refine your search to explore more results.