Exploring the accuracy limits of lattice strain quantification with synthetic diffraction data
Not provided.
Materials Science↗
SEARCH · Engineering Papers
Results for “optimization methods”
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.
Introduction to Mixed Variable Optimization (MVO) [Slides]
Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.
97 MATHEMATICS AND COMPUTING↗
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↗
SU-E-T-185: Feasibility Study of Dose Rate Modulated Arc Therapy (DrMAT) for Lung SBRT
Purpose: To show the feasibility of clinical application of DrMAT for SBRT in lung cancer patients. DrMAT is a form of dynamic conformal arc therapy where MLC segments and dose rates are controlled through simple field weight optimization. Methods: To show feasibility a new treatment plan was created based on the CT of SBRT lung cancer patients. Static plans with 33 fields are made, which have 11deg in between each field and are acquired rotating gantry angle from 180deg to 188deg in CCW direction, total 352deg is rotated. MLC maintained static aperture for each field. To optimize 33 individual fields, field weight was adjusted accordingly using weight optimization algorithm. Keeping weights and MU of static plan, static MLC aperture was converted to multiple arc segments. Arc plan could be created with the fields in the intervals of 11deg. Static MLC should be converted to arc segment MLC. Dynamic conformal arc therapy plan consists of 33 arc fields, is converted to one dose rate modulated arc therapy (DrMAT) plan. DrMAT plan consists of 166 control points which becomes a single arc plan that changes the shape of MLC for every 2.2deg. The resulting DrMAT plan is not an inverse plan it is a simple form of dynamic conformal arc plan using field weight obtained from static plan. This is compared and evaluated with the VMAT plan. Results: DrMAT and VMAT plans have been compared based on the RTOG1021. Both DrMAT and VMAT plans satisfy 100% irradiation to 95% of PTV and critical organs did not exceed dose limit suggested in RTOG1021. DrMAT plan is almost similar with VMAT plan in Result. Conclusion: Field weight optimization method did not show better Resultcompared to VMAT optimization. However, considering simplicity, DrMAT satisfies the condition in RTOG1021. Therefore clinical application of DrMAT is feasible.
60 APPLIED LIFE SCIENCES↗
Reoptimization of Intensity Modulated Proton Therapy Plans Based on Linear Energy Transfer
Purpose: We describe a treatment plan optimization method for intensity modulated proton therapy (IMPT) that avoids high values of linear energy transfer (LET) in critical structures located within or near the target volume while limiting degradation of the best possible physical dose distribution. Methods and Materials: To allow fast optimization based on dose and LET, a GPU-based Monte Carlo code was extended to provide dose-averaged LET in addition to dose for all pencil beams. After optimizing an initial IMPT plan based on physical dose, a prioritized optimization scheme is used to modify the LET distribution while constraining the physical dose objectives to values close to the initial plan. The LET optimization step is performed based on objective functions evaluated for the product of LET and physical dose (LET×D). To first approximation, LET×D represents a measure of the additional biological dose that is caused by high LET. Results: The method is effective for treatments where serial critical structures with maximum dose constraints are located within or near the target. We report on 5 patients with intracranial tumors (high-grade meningiomas, base-of-skull chordomas, ependymomas) in whom the target volume overlaps with the brainstem and optic structures. In all cases, high LET×D in critical structures could be avoided while minimally compromising physical dose planning objectives. Conclusion: LET-based reoptimization of IMPT plans represents a pragmatic approach to bridge the gap between purely physical dose-based and relative biological effectiveness (RBE)-based planning. The method makes IMPT treatments safer by mitigating a potentially increased risk of side effects resulting from elevated RBE of proton beams near the end of range.
62 RADIOLOGY AND NUCLEAR MEDICINE↗
Global Optimization of Chemical Cluster Structures: Methods, Applications, and Challenges
Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.
Global optimization, Chemical clusters, Artificial↗
Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
Very little is known about the cost landscape for parametrized Quantum Circuits (PQCs). Nevertheless, PQCs are employed in Quantum Neural Networks and Variational Quantum Algorithms, which may allow for near-term quantum advantage. Such applications require good optimizers to train PQCs. Recent works have focused on quantum-aware optimizers specifically tailored for PQCs. However, ignorance of the cost landscape could hinder progress towards such optimizers. In this work, we analytically prove two results for PQCs: (1) We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. Alternatively, this can be cast as an exponential reduction in the volume of relevant hyperparameter space. (2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima. Based on these results, we introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs. Our numerical simulations show that SYMH improves the overall optimizer performance in the presence of non-unital noise at a level comparable to current hardware. Overall, this work derives large-scale circuit symmetries from local gate transformations, and uses them to construct a noise-aware optimization method.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data
The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.
97 MATHEMATICS AND COMPUTING↗
A practical globalization of one-shot optimization for optimal design of tokamak divertors
In past studies, nested optimization methods were successfully applied to design of the magnetic divertor configuration in nuclear fusion reactors. In this paper, so-called one-shot optimization methods are pursued. Due to convergence issues, a globalization strategy for the one-shot solver is sought. Whereas Griewank introduced a globalization strategy using a doubly augmented Lagrangian function that includes primal and adjoint residuals, its practical usability is limited by the necessity of second order derivatives and expensive line search iterations. In this paper, a practical alternative is offered that avoids these drawbacks by using a regular augmented Lagrangian merit function that penalizes only state residuals. Additionally, robust rank-two Hessian estimation is achieved by adaptation of Powell's damped BFGS update rule. The application of the novel one-shot approach to magnetic divertor design is considered in detail. For this purpose, the approach is adapted to be complementary with practical in parts adjoint sensitivities. Using the globalization strategy, stable convergence of the one-shot approach is achieved.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Hybrid optimization and Bayesian inference techniques for a non-smooth radiation detection problem
In this paper, we propose several algorithms to recover the location and intensity of a radiation source located in a simulated 250 × 180 m block of an urban center based on synthetic measurements. Radioactive decay and detection are Poisson random processes, so we employ likelihood functions based on this distribution. Owing to the domain geometry and the proposed response model, the negative logarithm of the likelihood is only piecewise continuous differentiable, and it has multiple local minima. To address these difficulties, we investigate three hybrid algorithms composed of mixed optimization techniques. For global optimization, we consider simulated annealing, particle swarm, and genetic algorithm, which rely solely on objective function evaluations; that is, they do not evaluate the gradient in the objective function. By employing early stopping criteria for the global optimization methods, a pseudo-optimum point is obtained. This is subsequently utilized as the initial value by the deterministic implicit filtering method, which is able to find local extrema in non-smooth functions, to finish the search in a narrow domain. These new hybrid techniques, combining global optimization and implicit filtering address, difficulties associated with the non-smooth response, and their performances, are shown to significantly decrease the computational time over the global optimization methods. To quantify uncertainties associated with the source location and intensity, we employ the delayed rejection adaptive Metropolis and DiffeRential Evolution Adaptive Metropolis algorithms. Finally, marginal densities of the source properties are obtained, and the means of the chains compare accurately with the estimates produced by the hybrid algorithms.
42 ENGINEERING↗
An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints
We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.
convergence↗
SU-E-T-567: A Three-Field Mono-Isocentric Inverse Treatment Planning Method for the Patients with Larger Breasts
Purpose: The purpose of this study is to develop a three-field monoisocentric inverse breast treatment planning technique without the use of half-beam block. Methods: Conventional three-field breast treatment with supraclavicular half-beam blocked requires two isocenters when the breast is too large to be contained within half-beam. The inferior border of the supraclavicular field and superior borders of the breast fields are matched on patient's skin with the light field. This method causes a large dose variation in the matching region due to daily setup uncertainties and requires a longer treatment setup time. We developed a three-field mono-isocentric planning method for the treatment of larger breasts. The three fields share the same isocenter located in the breast. Beam matching is achieved by rotating collimator, couch and gantry. Furthermore, we employed a mixed open-IMRT inverse optimization method to improve dose uniformity and coverage. Results: Perfect geometric beam matching was achieved by rotating couch, collimator and gantry together. Treatment setup time was significantly reduced without light-field matching during treatment deliveries. Inverse mixed open-IMRT optimization method achieved better dose uniformity and PTV coverage while keeping sufficient air flash to compensate setup and breast shape changes in daily treatments. Conclusion: By eliminating light field matching, the three-field mono-isocentric treatment method can significantly reduce setup time and uncertainty for large breast patients. Plan quality is further improved by inverse IMRT planning.
60 APPLIED LIFE SCIENCES↗
Regulation of Renewable Energy Sources to Optimal Power Flow Solutions Using ADMM
This paper considers power distribution systems featuring renewable energy sources (RESs), and develops a distributed optimization method to steer the RES output powers to solutions of AC optimal power flow (OPF) problems. The design of the proposed method leverages suitable linear approximations of the AC-power flow equations, and is based on the Alternating Direction Method of Multipliers (ADMM). Convergence of the RES-inverter output powers to solutions of the OPF problem is established under suitable conditions on the stepsize as well as mismatches between the commanded setpoints and actual RES output powers. In a broad sense, the methods and results proposed here are also applicable to other distributed optimization problem setups with ADMM and inexact dual updates.
24 POWER TRANSMISSION AND DISTRIBUTION↗
LA17-V-InverseRadTransportProblem-PD2Kb. Final Project Report
In the inverse radiation transport problem, a radiation signal emanating from an unknown object is used to reconstruct geometric and material parameters of the object , e.g., the mass of special nuclear material (SNM), the isotopic composition of the SNM (e.g., the enrichment of 235U), the thickness of shielding, etc. The inverse radiation transport problem is one of the most fundamental and important in the emergency response mission, and has been addressed in previous NA-22 and NA-42/84 investments by using derivative-free optimization methods. Our project was aimed at (i) consolidating previous work by applying polynomial chaos expansion (PCE) for reducing significantly the number of forward model simulations required by derivative-free optimization methods; (ii) developing a general-purpose framework and stand-alone software for solving the inverse radiation transport problem by applying a new “predictive modeling” methodology (predictive modeling of coupled multi-physics systems, PM_CMPS) which enables the fusing of experimental and computational information; and (iii) developing several benchmarks (for unscattered gamma rays) for demonstrating the quantification of non-Gaussian features (e.g., skewness and kurtosis, which characterize asymmetries and long tails) of response distributions by deterministically and efficiently propagating parameter uncertainties (covariances and higher-order moments, where available) using high-order sensitivities computed by the recently developed comprehensive adjoint sensitivity analysis methodology (C-ASAM). With regard to (i), application of PCE, the most significant accomplishment of this project was an implementation of PCE into INVERSE that significantly reduced computation time for the DiffeRential Evolution Adaptive Metropolis (DREAM) and Differential Evolution (DE) methods. For inverse transport problems with measurements of neutron leakage, neutron multiplication, and neutron-induced gamma-rays, the solution times for the DREAM and DE methods were reduced by factors of 30-300, reducing run times from hours to minutes while maintaining the same accuracy as the standard (non-PCE) DREAM and DE. Speedups were further improved by exploring sparse grid quadrature sets using the Toolkit for Adaptive Stochastic Modeling and Non-Intrusive ApproximatioN (Tasmanian) toolset. An initial exploration of sparse grids indicated that further speedups factors of 5-10 are obtainable. The implementation of PCE in INVERSE is not in a form that users can easily access. With regard to (ii), solving the inverse problem using a predictive modeling paradigm, the most significant accomplishment of this project were the derivation and implementation of adjoint-based second derivatives in neutron and photon transport theory. There are two codes that compute these derivatives. SENSPG computes them for uncollided gamma rays and SENSMG computes them for neutron leakage. SENSMG is open-source code available on github. Other significant accomplishments included a stand-alone code, MULTI-PRED, that implements the predictive modeling paradigm, along with a detailed manual. The code was implemented in the existing INVERSE code for inverse problems, but a head-to-head comparison of inverse methods was not achieved. We also derived and implemented the capability to compute sensitivities for multiplicity measurements into the SENSMG code, and this capability was used in a data assimilation application, but it was not used for solving inverse problems. With regard to (iii), developing benchmarks to demonstrate the importance of high-order sensitivity and uncertainty analysis, the most significant accomplishment of this project were two test problems that showed how important second-order sensitivities are.
07 ISOTOPE AND RADIATION SOURCES↗
A Short-Term and High-Resolution System Load Forecasting Approach Using Support Vector Regression with Hybrid Parameters Optimization
This work proposes an approach for distribution system load forecasting, which aims to provide highly accurate short-term load forecasting with high resolution utilizing a support vector regression (SVR) based forecaster and a two-step hybrid parameters optimization method. Specifically, because the load profiles in distribution systems contain abrupt deviations, a data normalization is designed as the pretreatment for the collected historical load data. Then an SVR model is trained by the load data to forecast the future load. For better performance of SVR, a two-step hybrid optimization algorithm is proposed to determine the best parameters. In the first step of the hybrid optimization algorithm, a designed grid traverse algorithm (GTA) is used to narrow the parameters searching area from a global to local space. In the second step, based on the result of the GTA, particle swarm optimization (PSO) is used to determine the best parameters in the local parameter space. After the best parameters are determined, the SVR model is used to forecast the short-term load deviation in the distribution system.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Optimized purification methods for metallic contaminant removal from directly recycled Li-ion battery cathodes
Metallic contaminants pose a significant challenge to the viability of directly recycling Li-ion batteries. To date, few strategies exist to selectively remove metallic impurities from mixtures of shredded end-of-life material (black mass; BM) without concurrently damaging the structure and electrochemical performance of the target active material. We herein present tailored methods to selectively ionize two major contaminants—Al and Cu—while retaining a representative cathode (LiNi 0.33 Mn 0.33 Co 0.33 O 2 ; NMC-111) intact. This BM purification process is conducted at moderate temperatures in a KOH-based solution matrix. We rationally evaluate approaches to increase both the kinetic corrosion rate and the thermodynamic solubility of Al 0 and Cu 0 , and evaluate the impact of these treatment conditions on the structure, chemistry, and electrochemical performance of NMC. Specifically, we explore the impacts of chloride-based salts, a strong chelating agent, elevated temperature, and sonication on the rate and extent of contaminant corrosion, while concurrently evaluating the effects on NMC. The reported BM purification process is then demonstrated on samples of “simulated BM” containing a practically relevant 1 wt% concentration of Al or Cu. Increasing the kinetic energy of the purifying solution matrix through elevated temperature and sonication accelerates the corrosion of metallic Al and Cu, such that ∼100% corrosion of 75 μm Al and Cu particles is achieved within 2.5 hr. Further, we determine that effective mass transport of ionized species critically impacts the efficacy of Cu corrosion, and that saturated Cl – hinders rather than accelerates Cu corrosion by increasing solution viscosity and introducing competitive pathways for Cu surface passivation. The purification conditions do not induce bulk structural damage to NMC, and electrochemical capacity is maintained in half-cell format. Testing in full cells suggests that a limited quantity of residual surface species are present after treatment, which initially disrupt electrochemical behavior at the graphite anode but are subsequently consumed. Process demonstration on simulated BM suggests that contaminated samples—which prior to treatment show catastrophic electrochemical performance—can be recovered to pristine electrochemical capacity. The reported BM purification method offers a compelling and commercially viable solution to address contamination, particularly in the “fine” fraction of BM where contaminant sizes are on the same order of magnitude as NMC and where traditional separation approaches are unfeasible. Thus, this optimized BM purification technique offers a pathway towards viable direct recycling of BM feedstocks that would otherwise be unusable.
25 ENERGY STORAGE↗
Optimization of transformer ratio and beam loading in a plasma wakefield accelerator with a structure-exploiting algorithm
Plasma-based acceleration has emerged as a promising candidate as an accelerator technology for a future linear collider or a next-generation light source. We consider the plasma wakefield accelerator (PWFA) concept where a plasma wave wake is excited by a particle beam and a trailing beam surfs on the wake. For a linear collider, the energy transfer efficiency from the drive beam to the wake and from the wake to the trailing beam must be large, while the emittance and energy spread of the trailing bunch must be preserved. One way to simultaneously achieve this when accelerating electrons is to use longitudinally shaped bunches and nonlinear wakes. In the linear regime, there is an analytical formalism to obtain the optimal shapes. In the nonlinear regime, however, the optimal shape of the driver to maximize the energy transfer efficiency cannot be precisely obtained because currently no theory describes the wake structure and excitation process for all degrees of nonlinearity. In addition, the ion channel radius is not well defined at the front of the wake where the plasma electrons are not fully blown out by the drive beam. We present results using a novel optimization method to effectively determine a current profile for the drive and trailing beam in PWFA that provides low energy spread, low emittance, and high acceleration efficiency. We parameterize the longitudinal beam current profile as a piecewise-linear function and define optimization objectives. For the trailing beam, the algorithm converges quickly to a nearly inverse trapezoidal trailing beam current profile similar to that predicted by the ultrarelativistic limit of the nonlinear wakefield theory. For the drive beam, the beam profile found by the optimization in the nonlinear regime that maximizes the transformer ratio also resembles that predicted by linear theory. Furthermore, the current profiles found from the optimization method provide higher transformer ratios compared with the linear ramp predicted by the relativistic limit of the nonlinear theory.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
The use of multi-objective optimization to improve the design process of nuclear power plant systems
Multi-objective optimization is proposed to address the problem of design optimality in the nuclear power plant design process. This is done via the creation/development of the Optimization and Preference Tool for the Improvement of Nuclear Systems (OPTIONS). This work details applications of multi-objective optimization methods (in Python 3) to two different nuclear system design problems: the flash-Rankine power conversion system (PCS) of the I 2 S-LWR and the Passive Endothermic Reaction Cooling System (PERCS) attached to a standard PWR primary system (in RELAP5). The PCS design problem is first solved for three configurations using a specific particle swarm optimization method, achieving a thermodynamic efficiency of 34.81%. A new method, the Mixed-Integer Non-dominated Sorting Genetic Algorithm (MI-NSGA), is created and then used, solving a PCS superstructure of 22 configurations and achieving an efficiency of 35.63%. Finally, the OPTIONS tool is used to optimize the PERCS, improving cost, core temperature control, and cooling longevity.
21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗