SEARCH · Engineering Papers

Results for “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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,549 records · Page 86

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Multi-objective Bayesian optimization of ferroelectric materials with interfacial control for memory and energy storage applications

Optimization of materials’ performance for specific applications often requires balancing multiple aspects of materials’ functionality. Even for the cases where a generative physical model of material behavior is known and reliable, this often requires search over multidimensional function space to identify low-dimensional manifold corresponding to the required Pareto front. In this work, we introduce the multi-objective Bayesian optimization (MOBO) workflow for the ferroelectric/antiferroelectric performance optimization for memory and energy storage applications based on the numerical solution of the Ginzburg–Landau equation with electrochemical or semiconducting boundary conditions. MOBO is a low computational cost optimization tool for expensive multi-objective functions, where we update posterior surrogate Gaussian process models from prior evaluations and then select future evaluations from maximizing an acquisition function. Using the parameters for a prototype bulk antiferroelectric (PbZrO 3 ), we first develop a physics-driven decision tree of target functions from the loop structures. We further develop a physics-driven MOBO architecture to explore multidimensional parameter space and build Pareto-frontiers by maximizing two target functions jointly—energy storage and loss. This approach allows for rapid initial materials and device parameter selection for a given application and can be further expanded toward the active experiment setting. The associated notebooks provide both the tutorial on MOBO and allow us to reproduce the reported analyses and apply them to other systems (https://github.com/arpanbiswas52/MOBO_AFI_Supplements).

36 MATERIALS SCIENCE↗

DOE OSTI2022

Computing x-ray absorption spectra from linear-response particles atop optimized holes

State specific orbital optimized density functional theory (OO-DFT) methods, such as restricted open-shell Kohn–Sham (ROKS), can attain semiquantitative accuracy for predicting x-ray absorption spectra of closed-shell molecules. OO-DFT methods, however, require that each state be individually optimized. In this Communication, we present an approach to generate an approximate core-excited state density for use with the ROKS energy ansatz, which is capable of giving reasonable accuracy without requiring state-specific optimization. Herein, this is achieved by fully optimizing the core-hole through the core-ionized state, followed by the use of electron-addition configuration interaction singles to obtain the particle level. This hybrid approach can be viewed as a DFT generalization of the static-exchange (STEX) method and can attain ~0.6 eV rms error for the K-edges of C–F through the use of local functionals, such as PBE and OLYP. This ROKS(STEX) approach can also be used to identify important transitions for full OO ROKS treatment and can thus help reduce the computational cost of obtaining OO-DFT quality spectra. ROKS(STEX), therefore, appears to be a useful technique for the efficient prediction of x-ray absorption spectra.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗

DOE OSTI2020

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly improving performance for solving exponentially hard problems, such as optimization and satisfiability. Here, we report the implementation of a low-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator. We estimate the ground-state energy of the Transverse Field Ising Model with long-range interactions with tunable range, and we optimize the corresponding combinatorial classical problem by sampling the QAOA output with high-fidelity, single-shot, individual qubit measurements. We execute the algorithm with both an exhaustive search and closed-loop optimization of the variational parameters, approximating the ground-state energy with up to 40 trapped-ion qubits. We benchmark the experiment with bootstrapping heuristic methods scaling polynomially with the system size. We observe, in agreement with numerics, that the QAOA performance does not degrade significantly as we scale up the system size and that the runtime is approximately independent from the number of qubits. We finally give a comprehensive analysis of the errors occurring in our system, a crucial step in the path forward toward the application of the QAOA to more general problem instances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗

DOE OSTI2020

Many-isocenter optimization for robotic radiotherapy

Despite significant dosimetric gains, clinical implementation of the 4π non-coplanar radiotherapy on the widely available C-arm gantry system is hindered by limited clearance, and the need to perform complex coordinated gantry and couch motion. A robotic radiotherapy platform would be conducive to such treatment but a new conflict between field size and MLC modulation resolution needs to be managed for versatile applications. This study investigates the dosimetry and delivery efficiency of purposefully creating many isocenters to achieve simultaneously high MLC modulation resolution and large tumor coverage. An integrated optimization framework was proposed for simultaneous beam orientation optimization (BOO), isocenter selection, and fluence map optimization (FMO). The framework includes a least-square dose fidelity objective, a total variation term for regularizing the fluence smoothness, and a group sparsity term for beam selection. A minimal number of isocenters were identified for efficient target coverage. Colliding beams excluded, high-resolution small-field 4π intensity-modulated radiotherapy (IMRT) treatment plans with 50 cm source-to-isocenter distance (SID-50) on 10 Head and Neck (H&N) cancer patients were compared with low-resolution large-field plans with 100 cm SID (SID-100). With the same or better target coverage, the average reduction of [Dmean, Dmax] of 20-beam SID-50 plans from 20-beam SID-100 plans were [2.09 Gy, 1.19 Gy] for organs at risk (OARs) overall, [3.05 Gy, 0.04 Gy] for parotid gland, [3.62 Gy, 5.19 Gy] for larynx, and [3.27 Gy, 1.10 Gy] for mandible. R50 and integral dose were reduced by 5.3% and 9.6%, respectively. Wilcoxon signed-rank test showed significant difference (p < 0.05) in planning target volume (PTV) homogeneity, PTV Dmax, R50, Integral dose, and OAR Dmean and Dmax. The estimated delivery time of 20-beam [SID-50, SID-100] plans were [19, 18] min and [14, 9] min, assuming 5 fractions and 30 fractions, respectively. Finally, with clinically acceptable delivery efficiency, many-isocenter optimization is dosimetrically desirable for treating large targets with high modulation resolution on the robotic platform.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2022

Stochastic and a posteriori optimization to mitigate coil manufacturing errors in stellarator design

Abstract It was recently shown in Wechsung et al (2022 Proc. Natl Acad. Sci. USA 119 e2202084119) that there exist electromagnetic coils that generate magnetic fields, which are excellent approximations to quasi-symmetric fields and have very good particle confinement properties. Using a Gaussian process-based model for coil perturbations, we investigate the impact of manufacturing errors on the performance of these coils. We show that even fairly small errors result in noticeable performance degradation. While stochastic optimization yields minor improvements, it is not possible to mitigate these errors significantly. As an alternative to stochastic optimization, we then formulate a new optimization problem for computing optimal adjustments of the coil positions and currents without changing the shapes of the coil. These a-posteriori adjustments are able to reduce the impact of coil errors by an order of magnitude, providing a new perspective for dealing with manufacturing tolerances in stellarator design.

Physics↗

DOE OSTI2024

Optimization of foreground moment deprojection for semi-blind CMB polarization reconstruction

Abstract Upcoming Cosmic Microwave Background (CMB) experiments, aimed at measuring primordial CMB polarization B-modes, require exquisite control of instrumental systematics and Galactic foreground contamination. Blind minimum-variance techniques, like the Needlet Internal Linear Combination (NILC), have proven effective in reconstructing the CMB polarization signal and mitigating foregrounds and systematics across diverse sky models without suffering from foreground mismodelling errors. Still, residual foreground contamination from NILC may bias the recovered CMB polarization at large angular scales when confronted with the most complex foreground scenarios.By adding constraints to NILC to deproject statistical moments of the Galactic emission, the Constrained Moment ILC (cMILC) method has been demonstrated to further enhance foreground subtraction, albeit with an associated increase in overall noise variance. Faced with this trade-off between foreground bias reduction and overall variance minimization, there is still no recipe on which moments to deproject and which are better suited for blind variance minimization. To address this, we introduce the optimized cMILC (ocMILC) pipeline, which performs full automated optimization of the required number and set of foreground moments to deproject, pivot parameter values, and deprojection coefficients across the sky and angular scales, depending on the actual sky complexity, available frequency coverage, and experiment sensitivity. The optimal number of moments for deprojection, before paying significant noise penalty, is determined through a data diagnosis inspired by the Generalized NILC (GNILC) method.Validated on B-mode simulations of thePICOspace mission concept with four challenging foreground models, ocMILC exhibits lower Galactic foreground contamination compared to NILC and cMILC at all angular scales, with limited noise penalty. This multi-layer optimization enables the ocMILC pipeline to achieve unbiased posteriors of the tensor-to-scalar ratio, regardless of foreground complexity.

Astronomy & Astrophysics↗

DOE OSTI2025

A framework for discrete optimization of stellarator coils

Designing magnets for three-dimensional plasma confinement is a key task for advancing the stellarator as a fusion reactor concept. Stellarator magnets must produce an accurate field while leaving adequate room for other components and being reasonably simple to construct and assemble. In this paper, a framework for coil design and optimization is introduced that enables the attainment of sparse magnet solutions with arbitrary restrictions on where coils may be located. The solution space is formulated as a 'wireframe' consisting of a mesh of interconnected wire segments enclosing the plasma. Two methods are developed for optimizing the current distribution on a wireframe: Regularized Constrained Least Squares, which uses a linear least-squares approach to optimize the currents in each segment, and Greedy Stellarator Coil Optimization, a fully discrete procedure in which loops of current are added to the mesh one by one to achieve the desired magnetic field on the plasma boundary. Examples are presented of solutions obtainable with each method, some of which achieve high field accuracy while obeying spatial constraints that permit easy assembly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Extending the operational boundaries of RMP-ELM suppression with optimized 3D field control

The use of 3D magnetic fields is one of the promising approaches to control edge localized modes (ELMs), and ITER has plans to utilize a flexible 3D coil set for ELM suppression using 3D fields. This study focuses on optimizing the 3D field spectrum to expand the operational window for n = 1 resonant magnetic perturbation (RMP) ELM suppression in KSTAR. The optimized n = 1 RMP effectively suppresses ELMs throughout the entire H-mode discharge, including the first ELM crash, while avoiding the onset of disruptive locked modes in low-density L-mode plasmas. The predicted suppression window aligns well with experimental data, highlighting the challenges and solutions of using n = 1 RMP at low densities. Moreover, the optimization successfully achieved n = 1 RMP ELM suppression for the first time in ITER-relevant q 95 and shaping conditions, including cases with q95 as low as 3.6, as well as other q 95 and shape configurations. This highlights the importance and utility of 3D coil optimization while emphasizing the potential of long-wavelength low-n RMP, which will be valuable for ex-vessel coils designed to avoid complications of nuclear degradation.

3D magnetic field control↗

DOE OSTI2025

Feedforward equilibrium trajectory optimization with GSPulse

One of the common tasks required for designing new plasma scenarios or evaluating capabilities of a tokamak is to design the desired equilibria using a Grad-Shafranov (GS) equilibrium solver. However, most standard equilibrium solvers are time-independent and do not include dynamic effects such as plasma current flux consumption, induced vessel currents, or voltage constraints. Another class of tools, plasma equilibrium evolution simulators, do include time-dependent effects. These are generally structured to solve the forward problem of evolving the plasma equilibrium given feedback-controlled voltages. In this work, we introduce GSPulse, a novel algorithm for equilibrium trajectory optimization, that is more akin to a pulse planner than a pulse simulator. GSPulse includes time-dependent effects and solves the inverse problem: given a user-specified set of target equilibrium shapes, as well as limits on the coil currents and voltages, the optimizer returns trajectories of the voltages, currents, and achievable equilibria. This task is useful for scoping performance of a tokamak and exploring the space of achievable pulses. The computed equilibria satisfy both Grad-Shafranov force balance and axisymmetric circuit dynamics. The optimization is performed by restructuring the free-boundary equilibrium evolution equations into a form where it is computationally efficient to optimize the entire dynamic sequence. GSPulse can solve for hundreds of equilibria simultaneously within a few minutes. GSPulse has been validated against NSTX-U and MAST-U experiments and against SPARC feedback control simulations, and is being used to perform scenario design for SPARC. The computed trajectories can be used as feedforward inputs that are connected to the feedback controller to inform and improve feedback performance. The code for GSPulse is available open-source at github.com/jwai-cfs/GSPulse_public.

equilibrium↗

DOE OSTI2026

An overview of 3D field optimization for control of transport and edge instabilities on KSTAR

An international team from several laboratories and universities has made key advances over the last few years in the control of plasma transport and edge instabilities with applied 3D fields in the KSTAR tokamak to optimize long pulse operation scenarios. This overview begins with the optimization of both core and edge resonant magnetic perturbations (RMP) to improve fast ion confinement to avoid excessive limiter heat loads due to fast ion losses and successful modeling of the experimental results. Integrated and advanced plasma control techniques with machine learning (ML) and adaptive control were then used to optimize the 3D field spectrum in real-time to control edge localized modes (ELMs) while avoiding core locked modes that could disrupt the plasma. Accelerating the offline model of 3D fields with a surrogate ML model can optimize ELM suppression in the edge while limiting the impact of the applied RMP fields deeper in the plasma core in real-time. In addition, the impact of the 3D fields on the divertor heat load has been modeled and compared with experimental measurements. An analysis of a multi-machine database including KSTAR has been performed to better understand the metrics for the observed RMP thresholds for ELM suppression and the resulting plasma performance. Predictive modeling of the operational space for ELM suppression and density pumpout due to RMP has shown the importance of magnetic islands in the plasma edge and their impact on plasma turbulence. This research has culminated in the development of successful long pulse operational scenarios on KSTAR while attempting to overcome challenges of the new tungsten divertor.

3D fields↗

DOE OSTI2020

A Topology Optimization Framework to Facilitate Adoption of Advanced District Thermal Energy Systems

Advanced district thermal energy systems, which circulate water at temperatures near ambient conditions, and facilitate the utilization of waste heat and renewable thermal sources, can lower the carbon-intensity of urban districts, advancing the U.N. Sustainable Development Goals. Optimization of the network topology — the selection of the best subset of buildings and the best network to connect them, to minimize life cycle cost — can increase adoption of these system in appropriate applications. The potential "solution space" of the topology optimization problem grows factorially with the number of buildings in the district, motivating the consideration of a design heuristic. In this study, a heuristic for the network selection was evaluated with an exhaustive search, for a prototypical four-building district. For the prototypical district considered, the heuristic was effective in selecting an optimal network topology. Additionally, it was found that, in this case, the selection of the subset of buildings was more influential on the life cycle cost than the selection of the network topology. This work is part of a larger effort to develop a topology optimization framework for district thermal energy systems, which is anticipated to address barriers to adoption of ambient-temperature systems.

28 EE - Advanced Manufacturing Office (EE-5A)↗

DOE OSTI2023

Resource frugal optimizer for quantum machine learning

Quantum-enhanced data science, also known as quantum machine learning (QML), is of growing interest as an application of near-term quantum computers. Variational QML algorithms have the potential to solve practical problems on real hardware, particularly when involving quantum data. However, training these algorithms can be challenging and calls for tailored optimization procedures. Specifically, QML applications can require a large shot-count overhead due to the large datasets involved. In this work, we advocate for simultaneous random sampling over both the dataset as well as the measurement operators that define the loss function. We consider a highly general loss function that encompasses many QML applications, and we show how to construct an unbiased estimator of its gradient. This allows us to propose a shot-frugal gradient descent optimizer called Refoqus (REsource Frugal Optimizer for QUantum Stochastic gradient descent). Our numerics indicate that Refoqus can save several orders of magnitude in shot cost, even relative to optimizers that sample over measurement operators alone.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Optimal dynamic control for a maglev vehicle moving on multi-span guideway girders

Abstract An optimal control algorithm using a virtual tuned mass damper called virtual TMD to control the levitation force of a magnetic system is developed for resonance suppression of a maglev vehicle moving on multi-span guideway girders. Since the optimal dynamic parameters of a TMD in vibration control are well developed, the optimal tuning gains required to control the magnetic oscillations of the maglev bogie can be directly used and fed back to the maglev control system. To address the dynamic interaction analysis from the maglev vehicle to the guideway girders and vice versa, the entire coupling system is decomposed into two subsystems, one is the moving vehicle subsystem and another the stationary guideway subsystem. Then, an incremental–iterative procedure associated with the Newmark method is presented to solve the two sets of subsystem equations. Finally, the control effectiveness and parametric studies of the optimal virtual TMD scheme on resonance reduction of the moving maglev vehicle are demonstrated.

Liu, Linya↗

DOE OSTI2026

Customized Bayesian optimization for efficient beam tuning at the facility for rare isotope beams

Bayesian optimization (BO) has recently emerged as a powerful approach for on-line beam tuning, and it is rapidly gaining adoption across accelerator facilities due to its flexibility and efficiency in handling complex optimization tasks. At the Facility for Rare Isotope Beams, rapid and reliable tuning is essential to support the delivery of diverse ion species. To improve the practicality of BO in this setting, we implemented several enhancements, including scalarized composite objective construction for multicriteria optimization, asynchronous evaluation for better resource utilization, prior-mean-assisted optimization to accelerate convergence, and a local search strategy for rapid completion of the task. We present the details of these methods, discuss challenges-encountered, and share our experience applying them to specific beam-tuning tasks.

Accelerators & storage rings↗

DOE OSTI2025

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

DOE OSTI2021

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗