SEARCH · Search NASA
Results for “optimization algorithms”
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.
Inverse transport calculations in optical imaging with subspace optimization algorithms
Inverse boundary value problems for the radiative transport equation play an important role in optics-based medical imaging techniques such as diffuse optical tomography (DOT) and fluorescence optical tomography (FOT). Despite the rapid progress in the mathematical theory and numerical computation of these inverse problems in recent years, developing robust and efficient reconstruction algorithms remains a challenging task and an active research topic. We propose here a robust reconstruction method that is based on subspace minimization techniques. The method splits the unknown transport solution (or a functional of it) into low-frequency and high-frequency components, and uses singular value decomposition to analytically recover part of low-frequency information. Minimization is then applied to recover part of the high-frequency components of the unknowns. We present some numerical simulations with synthetic data to demonstrate the performance of the proposed algorithm.
Prediction of and genetic algorithm optimization on data induced uncertainty reduction with the use of an integral experiment
Not Available
Communication Lower Bounds and Optimal Algorithms for Numerical Linear Algebra.
Abstract not provided.
Inverse Design of Tetracene Polymorphs with Enhanced Singlet Fission Performance by Property-Based Genetic Algorithm Optimization
Not Available
Gnowee: A Hybrid Metaheuristic Optimization Algorithm for Constrained, Black Box, Combinatorial Mixed-Integer Design
Not provided.
Fast optimization algorithms and the cosmological constant
Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here in this paper, we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10 -120 in a randomly generated 10 9 -dimensional Arkani-Hamed–Dimopoulos–Kachru landscape.
Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
Not Available
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
Not Available
An Optimal Algorithm for Extreme Scale Job Launching
Abstract not provided
Quantum error mitigations for quantum approximate optimization algorithms on IBM quantum processors
Explore the source record for details and available documents.
Application of a Novel Saddle Point Optimization Algorithm on Surface Reactions Involving Bidentate Adsorbates.
Abstract not provided.
Genetic Algorithm Optimization of A Theory-Based Low-Temperature Cyclopentane Oxidation Model.
Abstract not provided.
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 parallel variable metric optimization algorithm
An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities of computers is presented. When p is the degree of parallelism, then one cycle of the parallel variable metric algorithm is defined as follows: first, the function and its gradient are computed in parallel at p different values of the independent variable; then the metric is modified by p rank-one corrections; and finally, a single univariant minimization is carried out in the Newton-like direction. Several properties of this algorithm are established. The convergence of the iterates to the solution is proved for a quadratic functional on a real separable Hilbert space. For a finite-dimensional space the convergence is in one cycle when p equals the dimension of the space. Results of numerical experiments indicate that the new algorithm will exploit parallel or pipeline computing capabilities to effect faster convergence than serial techniques.
Piloted simulation of an onboard trajectory optimization algorithm
Previously cited in issue 07, p. 975, Accession no. A82-20296