Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “global optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Advances in global optimization of high brightness beams

High brightness electron beams play an important role in accelerator-based applications such as driving X-ray free electron laser (FEL) radiation.Here in this paper, we report on advances in global beam dynamics optimization of an accelerator design using start-to-end simulations and a new parallel multi-objective differential evolution optimization method. The global optimization results in significant improvement of the final electron beam brightness.

43 PARTICLE ACCELERATORS↗
DOE OSTI2016

Solving global optimization problems on GPU cluster

The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

An enhanced artificial neural network with a shuffled complex evolutionary global optimization with principal component analysis

The classical Back-Propagation (BP) scheme with gradient-based optimization in training Artificial Neural Networks (ANNs) suffers from many drawbacks, such as the premature convergence, and the tendency of being trapped in local optimums. Therefore, as an alternative for the BP and gradient-based optimization schemes, various Evolutionary Algorithms (EAs), i.e., Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Simulated Annealing (SA), and Differential Evolution (DE), have gained popularity in the field of ANN weight training. This study applied a new efficient and effective Shuffled Complex Evolutionary Global Optimization Algorithm with Principal Component Analysis – University of California Irvine (SP-UCI) to the weight training process of a three-layer feed-forward ANN. A large-scale numerical comparison is conducted among the SP-UCI-, PSO-, GA-, SA-, and DE-based ANNs on 17 benchmark, complex, and real-world datasets. Here the results show that SP-UCI-based ANN outperforms other EA-based ANNs in the context of convergence and generalization. Results suggest that the SP-UCI algorithm possesses good potential in support of the weight training of ANN in real-word problems. In addition, the suitability of different kinds of EAs on training ANN is discussed. The large-scale comparison experiments conducted in this paper are fundamental references for selecting proper ANN weight training algorithms in practice.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2018

A filled function method for global optimization with inequality constraints

In this paper, we propose a new filled function method for finding a global minimizer of global optimization with inequality constraints. The proposed filled function is a continuously differentiable function with only one parameter. Then, we can use classical local optimization methods to find a better minimizer of the proposed filled function with a few parameter adjustment. The numerical experiments are made and the results show that the proposed filled function method is effective.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A Unified Differential Evolution Algorithm for Global Optimization

Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

43 PARTICLE ACCELERATORS↗
DOE OSTI2014

An Adaptive Unified Differential Evolution Algorithm for Global Optimization

In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Concurrent multi-peak Bragg coherent x-ray diffraction imaging of 3D nanocrystal lattice displacement via global optimization

Abstract In this paper we demonstrated a method to reconstruct vector-valued lattice distortion fields within nanoscale crystals by optimization of a forward model of multi-reflection Bragg coherent diffraction imaging (MR-BCDI) data. The method flexibly accounts for geometric factors that arise when making BCDI measurements, is amenable to efficient inversion with modern optimization toolkits, and allows for globally constraining a single image reconstruction to multiple Bragg peak measurements. This is enabled by a forward model that emulates the multiple Bragg peaks of a MR-BCDI experiment from a single estimate of the 3D crystal sample. We present this forward model, we implement it within the stochastic gradient descent optimization framework, and we demonstrate it with simulated and experimental data of nanocrystals with inhomogeneous internal lattice displacement. We find that utilizing a global optimization approach to MR-BCDI affords a reliable path to convergence of data which is otherwise challenging to reconstruct.

36 MATERIALS SCIENCE↗
NASA NTRS1992

Simple proof of the global optimality of the Hohmann transfer

The case of two-impulse transfer between coplanar circular orbits is considered. The global optimality of the Hohmann transfer among the class of two-impulse transfers is proved via ordinary calculus by using the familiar orbital elements, eccentricity e and parameter (semilatus rectum) p. It is noted that this proof is simpler than existing proofs in the literature.

Prussing, John E.↗
NASA NTRS1990

Electronic neural networks for global optimization

An electronic neural network with feedback architecture, implemented in analog custom VLSI is described. Its application to problems of global optimization for dynamic assignment is discussed. The convergence properties of the neural network hardware are compared with computer simulation results. The neural network's ability to provide optimal or near optimal solutions within only a few neuron time constants, a speed enhancement of several orders of magnitude over conventional search methods, is demonstrated. The effect of noise on the circuit dynamics and the convergence behavior of the neural network hardware is also examined.

Thakoor, A. P.↗
NASA NTRS1993

Electronic neural network for solving traveling salesman and similar global optimization problems

This invention is a novel high-speed neural network based processor for solving the 'traveling salesman' and other global optimization problems. It comprises a novel hybrid architecture employing a binary synaptic array whose embodiment incorporates the fixed rules of the problem, such as the number of cities to be visited. The array is prompted by analog voltages representing variables such as distances. The processor incorporates two interconnected feedback networks, each of which solves part of the problem independently and simultaneously, yet which exchange information dynamically.

Thakoor, Anilkumar P.↗
NASA NTRS1980

Global optimality of extremals: An example

The question of the existence and location of Darboux points is crucial for minimally sufficient conditions for global optimality and for computation of optimal trajectories. A numerical investigation is presented of the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, and horizontal aircraft turns to capture a line. This simple second order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.

Kreindler, E.↗
DOE OSTI2021

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems

We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.

3-SAT↗
DOE OSTI2025

Global optimization of harmonic oscillator basis in covariant density functional theory

The present investigation focuses on the improvement of the accuracy of the description of binding energies within moderately sized fermionic basis. Using the solutions corresponding to infinite fermionic basis it was shown that in the case of meson exchange (ME) covariant energy density functionals (CEDFs) the global accuracy of the description of binding energies in the finite $N_F$ = 16 - 20 bases can be drastically (by a factor ranging from ~3 up to ~9 dependent on the functional and $N_F$) improved by a global optimization of oscillator frequency of the basis. This is a consequence of the unique feature of the ME functionals in which with increasing fermionic basis size fermionic and mesonic energies approach the exact (infinite basis) solution from above and below, respectively. As a consequence, an optimal oscillator frequency $\hbar\omega_0$ of the basis can be defined which provides an accurate reproduction of exact total binding energies by the ones calculated in truncated basis. This leads to a very high accuracy of the calculations in moderately sized $N_F=20$ basis when mass dependent oscillator frequency is used: global rms differences $\delta B_{rms}$ between the binding energies calculated in infinite and truncated bases are only 0.025 MeV and 0.031 MeV for the NL5(Z) and DD-MEZ functionals, respectively. Optimized values of the oscillator frequency $\hbar\omega_0$ are provided for three major classes of CEDFs, i.e. for density dependent meson exchange functionals, nonlinear meson exchange ones and point coupling functionals.

Binding energy & masses↗
NASA NTRS2016

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allowing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for computational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

optimization↗
NASA NTRS2015

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allow-ing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for com-putational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

trajectory design↗
DOE OSTI2019

Global Optimization of Adsorbate Covered Supported Cluster Catalysts: The Case of Pt 7 H 10 CH 3 on α-Al 2 O 3

Determining structures of supported sub-nanometer catalytic clusters is important for finding binding sites, active sites, and reaction mechanisms. In realistic conditions, the cluster may be covered with adsorbed reactants and intermediates, which strongly affect the structure of the cluster compared to the low coverage regime. The global optimization of supported adsorbate-covered clusters is not possible with existing methods. In this paper, we present a customized Basin Hopping (BH) approach, with a core (metal cluster) – shell (adsorbates) separation scheme, and perform first applications to the search of low-energy isomers of Pt 7 /α-Al 2 O 3 at high hydrogen coverage (10H). The presence of adsorbates significantly alters the low-energy isomers compared to bare Pt 7 /α-Al 2 O 3 . Molecular dynamics simulations additionally show the different time-scales associated with the mobility of H and Pt atoms. The revised BH method with core-shell separation presents key advantages for the structural exploration of adsorbate-covered supported catalysts, relevant to realistic catalytic conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

The Convolutional Multiple Whole Profile (CMWP) Fitting Method, a Global Optimization Procedure for Microstructure Determination

The analysis of line broadening in X-ray and neutron diffraction patterns using profile functions constructed on the basis of well-established physical principles and TEM observations of lattice defects has proven to be a powerful tool for characterizing microstructures in crystalline materials. These principles are applied in the convolutional multiple-whole-profile (CMWP) procedure to determine dislocation densities, crystallite size, stacking fault and twin boundary densities, and intergranular strains. The different lattice defect contributions to line broadening are separated by considering the hkl dependence of strain anisotropy, planar defect broadening and peak shifts, and the defect dependent profile shapes. The Levenberg–Marquardt (LM) peak fitting procedure can be used successfully to determine crystal defect types and densities as long as the diffraction patterns are relatively simple. However, in more complicated cases like hexagonal materials or multiple-phase patterns, using the LM procedure alone may cause uncertainties. Here, we extended the CMWP procedure by including a Monte Carlo statistical method where the LM and a Monte Carlo algorithm were combined in an alternating manner. The updated CMWP procedure eliminated uncertainties and provided global optimized parameters of the microstructure in good correlation with electron microscopy methods.

36 MATERIALS SCIENCE↗
NASA NTRSDate not supplied

Globally Optimal Band Structure for Thermoelectrics in Realistic Systems

One of the ultimate questions in the field of thermoelectrics is the optimal band structure for the figure of merit. The observation made here is that a linear band dispersion, of any dimension, under acoustic-phonon-deformation-potential scattering comprises the theoretical regimen for delivering boxcar transport distribution, which has been mathematically proven to deliver optimum figure of merit. This is guaranteed by the interplay of the energy-dependencies of groupvelocity and density of states of linear dispersion as well as the energy-behavior of deformation-potential scattering. Then linear dispersion, capped with optimum bandwidth and combined with provisions of Park et al, npj Comput. Mater. 7, 43 2021, is the globally optimal band structure for thermoelectricity.

Junsoo Park↗