Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed 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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

A Bell-Curved Based Algorithm for Mixed Continuous and Discrete Structural Optimization

An evolutionary based strategy utilizing two normal distributions to generate children is developed to solve mixed integer nonlinear programming problems. This Bell-Curve Based (BCB) evolutionary algorithm is similar in spirit to (mu + mu) evolutionary strategies and evolutionary programs but with fewer parameters to adjust and no mechanism for self adaptation. First, a new version of BCB to solve purely discrete optimization problems is described and its performance tested against a tabu search code for an actuator placement problem. Next, the performance of a combined version of discrete and continuous BCB is tested on 2-dimensional shape problems and on a minimum weight hub design problem. In the latter case the discrete portion is the choice of the underlying beam shape (I, triangular, circular, rectangular, or U).

Kincaid, Rex K.↗
DOE OSTI2024

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗
NASA NTRS2011

Packing Optimization of Sorbent Bed Containing Dissimilar and Irregular Shaped Media

The Fire Cartridge is a packed bed air filter with two different and separate layers of media designed to provide respiratory protection from combustion products after a fire event on the International Space Station (ISS). The first layer of media is a carbon monoxide catalyst and the second layer of media is universal carbon. During development of Fire Cartridge prototypes, the two media beds were noticed to have shifted inside the cartridge. The movement of media within the cartridge can cause mixing of the bed layers, air voids, and channeling, which could cause preferential air flow and allow contaminants to pass through without removal. An optimally packed bed mitigates these risks and ensures effective removal of contaminants from the air. In order to optimally pack each layer, vertical, horizontal, and orbital agitations were investigated and a packed bulk density was calculated for each method. Packed bulk density must be calculated for each media type to accommodate variations in particle size, shape, and density. Additionally, the optimal vibration parameters must be re-evaluated for each batch of media due to variations in particle size distribution between batches. For this application it was determined that orbital vibrations achieve an optimal pack density and the two media layers can be packed by the same method. Another finding was media with a larger size distribution of particles achieve an optimal bed pack easier than media with a smaller size distribution of particles.

Holland, Nathan↗
NASA NTRS1990

An optimal sensing strategy of a proximity sensor system for recognition and localization of polyhedral objects

An algorithm is presented for the recognition and localization of thre-dimensional polyhedral objects based on an optical proximity sensor system capable of measuring the depth and orientation of a local area of an object surface. Emphasis is given to the determination of an optimal sensor trajectory or an optimal probing, for efficient discrimination among all the possible interpretations. The determination of an optimal sensor trajectory for the next probing consists of the selection of optimal beam orientations based on the surface normal vector distribution of the multiple interpretation image (MII) and the selection of an optimal probing plane by projecting the MII onto the projection plane perpendicular to a selected beam orientation and deriving the optimal path on the projection plane. The selection of optimal beam orientation and probing plane is based on the measure of discrimination power of a cluster of surfaces of an MII. Simulation results are shown.

Lee, Sukhan↗
NASA NTRS1986

The emergence of Zipf's law - Spontaneous encoding optimization by users of a command language

The distribution of commands issued by experienced users of a computer operating system allowing command customization tends to conform to Zipf's law. This result documents the emergence of a statistical property of natural language as users master an artificial language. Analysis of Zipf's law by Mandelbrot and Cherry shows that its emergence in the computer interaction of experienced users may be interpreted as evidence that these users optimize their encoding of commands. Accordingly, the extent to which users of a command language exhibit Zipf's law can provide a metric of the naturalness and efficiency with which that language is used.

Ellis, S. R.↗
NASA NTRS1987

Distributed operating system for NASA ground stations

NASA ground stations are characterized by ever changing support requirements, so application software is developed and modified on a continuing basis. A distributed operating system was designed to optimize the generation and maintenance of those applications. Unusual features include automatic program generation from detailed design graphs, on-line software modification in the testing phase, and the incorporation of a relational database within a real-time, distributed system.

Doyle, John F.↗
NASA NTRS2008

Mission Activity Planning for Humans and Robots on the Moon

A series of studies is conducted to develop a systematic approach to optimizing, both in terms of the distribution and scheduling of tasks, scenarios in which astronauts and robots accomplish a group of activities on the Moon, given an objective function (OF) and specific resources and constraints. An automated planning tool is developed as a key element of this optimization system.

task allocation↗
NASA NTRS1987

Combined optimization of image-gathering and image-processing systems for scene feature detection

The relationship between the image gathering and image processing systems for minimum mean squared error estimation of scene characteristics is investigated. A stochastic optimization problem is formulated where the objective is to determine a spatial characteristic of the scene rather than a feature of the already blurred, sampled and noisy image data. An analytical solution for the optimal characteristic image processor is developed. The Wiener filter for the sampled image case is obtained as a special case, where the desired characteristic is scene restoration. Optimal edge detection is investigated using the Laplacian operator x G as the desired characteristic, where G is a two dimensional Gaussian distribution function. It is shown that the optimal edge detector compensates for the blurring introduced by the image gathering optics, and notably, that it is not circularly symmetric. The lack of circular symmetry is largely due to the geometric effects of the sampling lattice used in image acquisition. The optimal image gathering optical transfer function is also investigated and the results of a sensitivity analysis are shown.

Halyo, Nesim↗
NASA NTRS2004

JPL Facilities and Software for Collaborative Design: 1994 - Present

The viewgraph presentation provides an overview of the history of the JPL Project Design Center (PDC) and, since 2000, the Center for Space Mission Architecture and Design (CSMAD). The discussion includes PDC objectives and scope; mission design metrics; distributed design; a software architecture timeline; facility design principles; optimized design for group work; CSMAD plan view, facility design, and infrastructure; and distributed collaboration tools.

project design center↗
DOE OSTI2026

SAIGE-GPU: accelerating genome- and phenome-wide association studies using GPUs

Genome-wide association studies (GWAS) at biobank scale are computationally intensive, especially for admixed populations requiring robust statistical models. SAIGE is a widely used method for generalized linear mixed-model GWAS but is limited by its CPU-based implementation, making phenome-wide association studies impractical for many research groups. We developed SAIGE-GPU, a GPU-accelerated version of SAIGE that replaces CPU-intensive matrix operations with GPU-optimized kernels. The core innovation is distributing genetic relationship matrix calculations across GPUs and communication layers. Applied to 2068 phenotypes from 635 969 participants in the Million Veteran Program, including diverse and admixed populations, SAIGE-GPU achieved a 5-fold speedup in mixed model fitting on supercomputing infrastructure and cloud platforms. We further optimized the variant association testing step through multi-core and multi-trait parallelization. Deployed on Google Cloud Platform and Azure, the method provided substantial cost and time savings. Source code and binaries are available for download at https://github.com/saigegit/SAIGE/tree/SAIGE-GPU-1.3.3. A code snapshot is archived at Zenodo for reproducibility (DOI: [10.5281/zenodo.17642591]). SAIGE-GPU is available in a containerized format for use across HPC and cloud environments and is implemented in R/C++ and runs on Linux systems.

Rodriguez, Alex [Argonne National Laboratory (ANL)↗
DOE OSTI2025

Enabling Efficient Sparse Computations using Linear Algebra Aware Compilers

This project developed the LAPIS compiler framework, built on the Multilevel Intermediate Representation (MLIR), to optimize sparse linear algebra operations and support performance portability across diverse architectures. The main innovation of LAPIS is the Kokkos dialect, which allows for lowering codes from a high productivity language to different architectures in an elegant way. The dialect also allows the conversion of lower-level MLIR code to C++ Kokkos code, facilitating the integration of scientific machine learning (SciML) models into applications. To extend LAPIS for distributed memory architectures, a new partition dialect was created to manage the distribution of sparse tensors and express communication patterns for sparse linear algebra operations. This dialect also supports the distributed execution of operators and includes algorithmic optimizations to minimize communication to improve performance. The project also demonstrates that MLIR can enable effective linear algebra-level optimizations, improving performance on different GPUs for both sparse and dense linear algebra kernels. Key applications of LAPIS include sparse linear algebra and graph kernels, TenSQL, a relational database management solution built on GraphBLAS, and the development of subgraph isomorphism and monomorphism kernels, showcasing performance portability. In summary, the LAPIS framework supports productivity, performance, portability, and distributed memory execution, while also enabling linear algebra-level optimizations that are challenging in traditional programming languages, with successful applications ranging from simple sparse linear algebra to complex graph kernels.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Senstitivty analysis and optimization of nodal point placement for vibration reduction

A method is developed for sensitivity analysis and optimization of nodal point locations in connection with vibration reduction. A straightforward derivation of the expression for the derivative of nodal locations is given, and the role of the derivative in assessing design trends is demonstrated. An optimization process is developed which uses added lumped masses on the structure as design variables to move the node to a preselected location - for example, where low response amplitude is required or to a point which makes the mode shape nearly orthogonal to the force distribution, thereby minimizing the generalized force. The optimization formulation leads to values for added masses that adjust a nodal location while minimizing the total amount of added mass required to do so. As an example, the node of the second mode of a cantilever box beam is relocated to coincide with the centroid of a prescribed force distribution, thereby reducing the generalized force substantially without adding excessive mass. A comparison with an optimization formulation that directly minimizes the generalized force indicates that nodal placement gives essentially a minimum generalized force when the node is appropriately placed.

Pritchard, J. I.↗
NASA NTRS1987

Sensitivity derivatives and optimization of nodal point locations for vibration reduction

A method is developed for sensitivity analysis and optimization of nodal point locations in connection with vibration reduction. A straightforward derivation of the expression for the derivative of nodal locations is given, and the role of the derivative in assessing design trends is demonstrated. An optimization process is developed which uses added lumped masses on the structure as design variables to move the node to a preselected location; for example, where low response amplitude is required or to a point which makes the mode shape nearly orthogonal to the force distribution, thereby minimizing the generalized force. The optimization formulation leads to values for added masses that adjust a nodal location while minimizing the total amount of added mass required to do so. As an example, the node of the second mode of a cantilever box beam is relocated to coincide with the centroid of a prescribed force distribution, thereby reducing the generalized force substantially without adding excessive mass. A comparison with an optimization formulation that directly minimizes the generalized force indicates that nodal placement gives essentially a minimum generalized force when the node is appropriately placed.

Pritchard, Jocelyn I.↗
NASA NTRS1987

Sensitivity analysis and optimization of nodal point placement for vibration reduction

A method is developed for sensitivity analysis and optimization of nodal point locations in connection with vibration reduction. A straightforward derivation of the expression for the derivative of nodal locations is given, and the role of the derivative in assessing design trends is demonstrated. An optimization process is developed which uses added lumped masses on the structure as design variables to move the node to a preselected location - for example, where low response amplitude is required or to a point which makes the mode shape nearly orthogonal to the force distribution, thereby minimizing the generalized force. The optimization formulation leads to values for added masses that adjust a nodal location while minimizing the total amount of added mass required to do so. As an example, the node of the second mode of a cantilever box beam is relocated to coincide with the centroid of a prescribed force distribution, thereby reducing the generalized force substantially without adding excessive mass. A comparison with an optimization formulation that directly minimizes the generalized force indicates that nodal placement gives essentially a minimum generalized force when the node is appropriately placed.

Pritchard, J. I.↗
NASA NTRS2001

Normal and abnormal tissue identification system and method for medical images such as digital mammograms

A system and method for analyzing a medical image to determine whether an abnormality is present, for example, in digital mammograms, includes the application of a wavelet expansion to a raw image to obtain subspace images of varying resolution. At least one subspace image is selected that has a resolution commensurate with a desired predetermined detection resolution range. A functional form of a probability distribution function is determined for each selected subspace image, and an optimal statistical normal image region test is determined for each selected subspace image. A threshold level for the probability distribution function is established from the optimal statistical normal image region test for each selected subspace image. A region size comprising at least one sector is defined, and an output image is created that includes a combination of all regions for each selected subspace image. Each region has a first value when the region intensity level is above the threshold and a second value when the region intensity level is below the threshold. This permits the localization of a potential abnormality within the image.

Heine, John J.↗
NASA NTRS2003

Aerodynamic Shape Optimization Using Hybridized Differential Evolution

An aerodynamic shape optimization method that uses an evolutionary algorithm known at Differential Evolution (DE) in conjunction with various hybridization strategies is described. DE is a simple and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems. Various hybridization strategies for DE are explored, including the use of neural networks as well as traditional local search methods. A Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the hybrid DE optimizer. The method is implemented on distributed parallel computers so that new designs can be obtained within reasonable turnaround times. Results are presented for the inverse design of a turbine airfoil from a modern jet engine. (The final paper will include at least one other aerodynamic design application). The capability of the method to search large design spaces and obtain the optimal airfoils in an automatic fashion is demonstrated.

Madavan, Nateri K.↗
NASA NTRS1988

Approximation theory for LQG (Linear-Quadratic-Gaussian) optimal control of flexible structures

An approximation theory is presented for the LQG (Linear-Quadratic-Gaussian) optimal control problem for flexible structures whose distributed models have bounded input and output operators. The main purpose of the theory is to guide the design of finite dimensional compensators that approximate closely the optimal compensator. The optimal LQG problem separates into an optimal linear-quadratic regulator problem and an optimal state estimation problem. The solution of the former problem lies in the solution to an infinite dimensional Riccati operator equation. The approximation scheme approximates the infinite dimensional LQG problem with a sequence of finite dimensional LQG problems defined for a sequence of finite dimensional, usually finite element or modal, approximations of the distributed model of the structure. Two Riccati matrix equations determine the solution to each approximating problem. The finite dimensional equations for numerical approximation are developed, including formulas for converting matrix control and estimator gains to their functional representation to allow comparison of gains based on different orders of approximation. Convergence of the approximating control and estimator gains and of the corresponding finite dimensional compensators is studied. Also, convergence and stability of the closed-loop systems produced with the finite dimensional compensators are discussed. The convergence theory is based on the convergence of the solutions of the finite dimensional Riccati equations to the solutions of the infinite dimensional Riccati equations. A numerical example with a flexible beam, a rotating rigid body, and a lumped mass is given.

Gibson, J. S.↗