SEARCH · Engineering Papers
Results for “algorithms 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.
Algorithmic Optimizations for DPUs
Explore the source record for details and available documents.
A 3D Voronoi+Gapper Galaxy Cluster Finder in Redshift Space to z ∼ 0.2 I: an Algorithm Optimized for the 2dFGRS
This paper is the first in a series, presenting a new galaxy cluster finder based on a three-dimensional Voronoi Tesselation plus a maximum likelihood estimator, followed by gapping-filtering in radial velocity(VoML+G). The scientific aim of the series is a reassessment of the diversity of optical clusters in the local universe. A mock galaxy database mimicking the southern strip of the magnitude(blue)-limited 2dF Galaxy Redshift Survey (2dFGRS), for the redshift range 0.009 < z < 0.22, is built on the basis of the Millennium Simulation of the LCDM cosmology and a reference catalog of “Millennium clusters,” spannning across the 1.0 × 10{sup 12}–1.0 × 10{sup 15} M {sub ⊙} h {sup −1} dark matter (DM) halo mass range, is recorded. The validation of VoML+G is performed through its application to the mock data and the ensuing determination of the completeness and purity of the cluster detections by comparison with the reference catalog. The execution of VoML+G over the 2dFGRS mock data identified 1614 clusters, 22% with N {sub g} ≥ 10, 64 percent with 10 > N {sub g} ≥ 5, and 14% with N {sub g} < 5. The ensemble of VoML+G clusters has a ∼59% completeness and a ∼66% purity, whereas the subsample with N {sub g} ≥ 10, to z ∼ 0.14, has greatly improved mean rates of ∼75% and ∼90%, respectively. The VoML+G cluster velocity dispersions are found to be compatible with those corresponding to “Millennium clusters” over the 300–1000 km s{sup −1} interval, i.e., for cluster halo masses in excess of ∼3.0 × 10{sup 13} M {sub ⊙} h {sup −1}.
A Second-Order Accurate Mathematical Optimization Algorithm Based on Gradient Information.
Abstract not provided.
Developing Fugitive Emissions Sensor Networks: New Optimization Algorithms for Monitoring Measurement and Verification.
Abstract not provided.
Optimization Algorithms for Storage Ring Beam Steering
Explore the source record for details and available documents.
Investigating the Quantum Approximate Optimization Algorithm?s Advantage over Classical Algorithms.
Abstract not provided.
A Hybrid Quantum Optimization Algorithm Incorporating Classical Heuristics.
Abstract not provided.
Particle Swarm Optimization Algorithm for Critical Experiment Design
Nuclear criticality experiments are used to validate nuclear cross section data used by simulation software. This is typically achieved by designing a critical system with a high sensitivity to a certain material’s cross section. Once the experiment has been carried out, a high fidelity model of the system is developed into a benchmark. When this benchmark model is simulated by a transport code, some of the difference between the experimental and computational effective neutron multiplication factor can be attributed to inaccurate nuclear data. Nuclear data evaluators then can make adjustments accordingly to improve cross section data.
A Comparison of the Performance of Three Nongradient-Based Optimization Algorithms During the Design of an Accelerator-Driven Subcritical Assembly for Mo-99 Production
Explore the source record for details and available documents.
Sci—Fri AM: Mountain — 05: Unified Optimization and Delivery of Intensity-modulated Radiation Therapy and Volume-modulated Arc Therapy
Purpose: To study the feasibility of a unified intensity-modulated arc therapy (UIMAT) that combines IMRT and VMAT optimization and delivery in order to produce efficient and superior radiation treatment plans. Methods: Inverse planning for UIMAT was prototyped on the Pinnacle treatment planning system (Philips Medical Systems). UIMAT integrates IMRT and VMAT delivery in the same arc where IMRT was delivered with gantry speed close to zero. Optimal gantry angles for the IMRT phases were selected automatically by the inverse optimization algorithm. Optimization of the VMAT phases and IMRT phases were done simultaneously using Pinnacle's direct machine parameter optimization algorithm. Five treatment plans each for prostate, head and neck, and lung were generated using our unified technique and compared with clinical VMAT or IMRT plans. Delivery verification was performed on an ArcCheck phantom (Sun Nuclear) and delivered in clinical mode on a Varian TrueBeam linear accelerator. Results: In this prototype implementation, compared to the VMAT or IMRT plans, with the plans normalized to the same dose coverage to the planning target volumes, the UIMAT plans produced improved OAR sparing for head and neck cases, while for lung and prostate cases, the dosimetric improvements for OARs were not as significant. In this proof-of-concept work, we demonstrated that a novel radiation therapy delivery technique combining VMAT and IMRT delivery in the same arc is feasible. Initial results showed UIMAT has the potential to be superior to either standard IMRT or VMAT.
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
We present a structured quasi-Newton algorithm for unconstrained optimization problems that have unavailable second-order derivatives or Hessian terms. We provide a formal derivation of the well-known Broyden--Fletcher--Goldfarb--Shanno (BFGS) secant update formula that approximates only the missing Hessian terms, and we propose a linesearch quasi-Newton algorithm based on a modification of Wolfe conditions that converges to first-order optimality conditions. We also analyze the local convergence properties of the structured BFGS algorithm and show that it achieves superlinear convergence under the standard assumptions used by quasi-Newton methods using secant updates. In conclusion, we provide a thorough study of the practical performance of the algorithm on the CUTEr suite of test problems and show that our structured BFGS-based quasi-Newton algorithm outperforms the unstructured counterpart(s).
Optimal Multistage Algorithm for Adjoint Computation
We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously, optimal algorithms for adjoint computations were known only for a single level of checkpoints with no writing and reading costs; a well-known example is the binomial checkpointing algorithm of Griewank and Walther. Stumm and Walther extended that binomial checkpointing algorithm to the case of two levels of checkpoints, but they did not provide any optimality results. We bridge the gap by designing the first optimal algorithm in this context. We experimentally compare our optimal algorithm with that of Stumm and Walther to assess the difference in performance.
Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems
We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.
Objective and algorithm considerations when optimizing the number and placement of turbines in a wind power plant
Abstract. Optimizing turbine layout is a challenging problem that has been extensively researched in the literature. However, optimizing the number of turbines within a given boundary has not been studied as extensively and is a difficult problem because it introduces discrete design variables and a discontinuous design space. An essential step in performing wind power plant layout optimization is to define the objective function, or value, that is used to express what is valuable to a wind power plant developer, such as annual energy production, cost of energy, or profit. In this paper, we demonstrate the importance of selecting the appropriate objective function when optimizing a wind power plant in a land-constrained site. We optimized several different wind power plants with different wind resources and boundary sizes. Results show that the optimal number of turbines varies drastically depending on the objective function. For a simple, one-dimensional, land-based scenario, we found that a wind power plant optimized for minimal cost of energy produced just 72 % of the profit compared to the wind power plant optimized for maximum profit, which corresponded to a loss of about USD 2 million each year. This paper also compares the performance of several different optimization algorithms, including a novel repeated-sweep algorithm that we developed. We found that the performance of each algorithm depended on the number of design variables in the problem as well as the objective function.