Search NASA⌕ Search

SEARCH · Search NASA

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 829 records · Page 46

Asynchronous Iterative Solvers for Extreme-Scale Computing

The Asynchronous Iterative Solvers for Extreme-Scale Computing (AsyncIS) project aims to explore more efficient numerical algorithms by decreasing their overhead. AsyncIS does this by replacing the outer Krylov subspace solver with an asynchronous optimized Schwarz method, thereby removing the global synchronization and bulk synchronous operations typically used in numerical codes. AsyncIS—a U.S. Department of Energy (DOE)-funded collaboration between Georgia Tech, the University of Tennessee, Knoxville, Temple University, and Sandia National Laboratories—also focuses on the development and optimization of asynchronous preconditioners (i.e., preconditioners that are generated and/or applied in an asynchronous fashion). The novel preconditioning algorithms that provide fine-grained parallelism enable preconditioned Krylov solvers to run efficiently on large-scale distributed systems and manycore accelerators like GPUs.

97 MATHEMATICS AND COMPUTING↗

Global Data Re-allocation via Communication Aggregation in Chapel

Chapel is a parallel programming language designed to improve the productivity and ease of use of conventional and parallel computers. This language currently delivers sub optimal performance when executing codes that perform global data re-allocation operations on distributed memory architectures. This is mainly due to data communication that is done without aggregation (one message for each remote array element). In this work, we analyze Chapel's standard Block and Cyclic distribution modules and optimize the communication routines for array assignments by performing aggregation. Thanks to the expressive power of Chapel, the compiler and runtime have enough information to do communication aggregation without user intervention. The runtime relies on the low-level GAS Net networking layer, whose versions of one-sided bulk put/get routines that support strides are particularly useful for us. Experimental results conducted on Hector (a Cray XE6) and Jaguar (Cray XK6)reveal that the implemented techniques can lead to significant reductions in communication time.

Sanz, Alberto↗

Non-linear Multidimensional Optimization for use in Wire Scanner Fitting

To ensure experiment efficiency and quality from the Continuous Electron Beam Accelerator at Jefferson Lab, beam energy, size, and position must be measured. Wire scanners are devices inserted into the beamline to produce measurements which are used to obtain beam properties. Extracting physical information from the wire scanner measurements begins by fitting Gaussian curves to the data. This study focuses on optimizing and automating this curve-fitting procedure. We use a hybrid approach combining the efficiency of Newton Conjugate Gradient (NCG) method with the global convergence of three nature-inspired (NI) optimization approaches: genetic algorithm, differential evolution, and particle-swarm. In this Python-implemented approach, augmenting the locally-convergent NCG with one of the globally-convergent methods ensures the quality, robustness, and automation of curve-fitting. After comparing the methods, we establish that given an initial data-derived guess, each finds a solution with the same chi-square- a measurement of the agreement of the fit to the data. NCG is the fastest method, so it is the first to attempt data-fitting. The curve-fitting procedure escalates to one of the globally-convergent NI methods only if NCG fails, thereby ensuring a successful fit. This method allows for the most optimal signal fit and can be easily applied to similar problems.

Terzic, Balsa↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms: Preprint

This paper presents a distributed approach to perform real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approach real-time control/optimization.

17 WIND ENERGY↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms

This paper presents a distributed approach to performing real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically, and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approaching real-time control/optimization.

17 WIND ENERGY↗

Online accelerator optimization with a machine learning-based stochastic algorithm

Abstract Online optimization is critical for realizing the design performance of accelerators. Highly efficient stochastic optimization algorithms are needed for many online accelerator optimization problems in order to find the global optimum in the non-linear, coupled parameter space. In this study, we propose to use the multi-generation Gaussian process optimizer for online accelerator optimization and demonstrate that the algorithm is significantly more efficient than other stochastic algorithms that are commonly used in the accelerator community.

Zhang, Zhe (ORCID:0000000281430381)↗

Selecting Essential Information for Biosurveillance—A Multi-Criteria Decision Analysis

The National Strategy for Biosurveillancedefines biosurveillance as ‘‘the process of gathering, integrating, interpreting, and communicating essential information related to all-hazards threats or disease activity affecting human, animal, or plant health to achieve early detection and warning, contribute to overall situational awareness of the health aspects of an incident, and to enable better decision-making at all levels.’’ However, the strategy does not specify how ‘‘essential information’’ is to be identified and integrated into the current biosurveillance enterprise, or what the metrics qualify information as being ‘‘essential’’. Thequestion of data stream identification and selection requires a structured methodology that can systematically evaluate the tradeoffs between the many criteria that need to be taken in account. Multi-Attribute Utility Theory, a type of multi-criteria decision analysis, can provide a well-defined, structured approach that can offer solutions to this problem. While the use of Multi-Attribute Utility Theoryas a practical method to apply formal scientific decision theoretical approaches to complex, multi-criteria problems has been demonstrated in a variety of fields, this method has never been applied to decision support in biosurveillance.We have developed a formalized decision support analytic framework that can facilitate identification of ‘‘essential information’’ for use in biosurveillance systems or processes and we offer this framework to the global BSV community as a tool for optimizing the BSV enterprise. To demonstrate utility, we applied the framework to the problem of evaluating data streams for use in an integrated global infectious disease surveillance system.

47 OTHER INSTRUMENTATION↗

An active-set algorithm and a trust-region approach in constrained minimax problem

In this paper, we propose an algorithm to solve a finite minimax problem with side constraints. An active-set strategy is used in the algorithm to transform inequality constraints to equality constraints. This allows the use of the well-developed techniques for solving the equality constrained optimization problems. A trust-region globalization strategy is added to the proposed algorithm to ensure global convergence. A projected Hessian technique is used in the algorithm to overcome the difficulty of having an infeasible trust-region subproblem.A global convergence theory for the proposed algorithm is presented under standard assumptions. Finally, numerical experiments are reported to indicate that the new algorithm performs efficiently in practice.

97 MATHEMATICS AND COMPUTING↗

Multiobjective Optimization Using a Pareto Differential Evolution Approach

Differential Evolution is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. In this paper, the Differential Evolution algorithm is extended to multiobjective optimization problems by using a Pareto-based approach. The algorithm performs well when applied to several test optimization problems from the literature.

Madavan, Nateri K.↗

Photoelectron Spectroscopy of Cold Hydrated Sulfate Clusters, SO 4 2- (H 2 O)N ((N = 4-7): Temperature-Dependent Isomer Populations

Sulfate is an important inorganic anion and its interactions with water are essential to understand its chemistry in aqueous solution. Studies of sulfate with well-controlled solvent numbers provide molecular-level information about the solute-solvent interactions and critical data to test theoretical methods for weakly bounded species. Here we report a low-temperature photoelectron spectroscopy study of hydrated sulfate clusters SO 4 2- (H 2 O) n (n = 4-7) at 12 K and ab initio studies to understand the structures and dynamics of these unique solvated systems. A significant increase of electron binding energies was observed for the 12 K spectra relative to those at room temperature, suggesting different structural isomers were populated as a function of temperature. Theoretical calculations revealed a competition between isomers with optimal water-solute and water-water interactions. The global minimum isomers all possess higher electron binding energies due to their optimal water-solute interactions, giving rise to the binding energy shift in the 12 K spectra, whereas many additional low-lying isomers with less optimal solvent-solute interactions were populated at room temperature, resulting in a shift to lower electron binding energies in the observed spectra. The current work demonstrates and confirms the complexity of the water-sulfate potential energy landscape and the importance of temperature control in studying the solvent-solute systems and in comparing calculations with experiment.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Influence of coherent mesoscale structures on satellite-based Doppler lidar wind measurements

Efforts to develop display routines for overlaying gridded and nongridded data sets are discussed. The primary objective is to have the capability to review global patterns of winds and lidar samples; to zoom in on particular wind features or global areas; and to display contours of wind components and derived fields (e.g., divergence, vorticity, deformation, etc.). Current considerations in support of a polar orbiting shuttle lidar mission are discussed. Ground truth for a shuttle lidar experiment may be limited to fortuitous alignment of lidar wind profiles and scheduled rawinsonde profiles. Any improvement on this would require special rawinsonde launches and/or optimization of the shuttle orbit with global wind measurement networks.

Emmitt, G. D.↗

Global Simulation of Aviation Operations

The simulation and analysis of global air traffic is limited due to a lack of simulation tools and the difficulty in accessing data sources. This paper provides a global simulation of aviation operations combining flight plans and real air traffic data with historical commercial city-pair aircraft type and schedule data and global atmospheric data. The resulting capability extends the simulation and optimization functions of NASA's Future Air Traffic Management Concept Evaluation Tool (FACET) to global scale. This new capability is used to present results on the evolution of global air traffic patterns from a concentration of traffic inside US, Europe and across the Atlantic Ocean to a more diverse traffic pattern across the globe with accelerated growth in Asia, Australia, Africa and South America. The simulation analyzes seasonal variation in the long-haul wind-optimal traffic patterns in six major regions of the world and provides potential time-savings of wind-optimal routes compared with either great circle routes or current flight-plans if available.

simulation↗

Program optimizations: The interplay between power, performance, and energy

Practical considerations for future supercomputer designs will impose limits on both instantaneous power consumption and total energy consumption. Working within these constraints while providing the maximum possible performance, application developers will need to optimize their code for speed alongside power and energy concerns. This paper analyzes the effectiveness of several code optimizations including loop fusion, data structure transformations, and global allocations. A per component measurement and analysis of different architectures is performed, enabling the examination of code optimizations on different compute subsystems. Using an explicit hydrodynamics proxy application from the U.S. Department of Energy, LULESH, we show how code optimizations impact different computational phases of the simulation. This provides insight for simulation developers into the best optimizations to use during particular simulation compute phases when optimizing code for future supercomputing platforms. Here, we examine and contrast both x86 and Blue Gene architectures with respect to these optimizations.

97 MATHEMATICS AND COMPUTING↗

Control co-design under uncertainty for offshore wind farms: Optimizing grid integration, energy storage, and market participation

Offshore wind farms (OWFs) are set to significantly contribute to global decarbonization efforts. Developers often use a sequential approach to optimize design variables and market participation for grid-integrated offshore wind farms. However, this method can lead to sub-optimal system performance, and uncertainties associated with renewable resources are often overlooked in decision-making. Here, this paper proposes a control co-design approach, optimizing design and control decisions for integrating OWFs into the power grid while considering energy market and primary frequency market participation. Additionally, we introduce optimal sizing solutions for energy storage systems deployed onshore to enhance revenue for OWF developers over time. This framework addresses uncertainties related to wind resources and energy prices. We analyze five U.S. west-coast offshore wind farm locations and potential interconnection points, as identified by the Bureau of Ocean Energy Management (BOEM). Results show that optimized control co-design solutions can increase market revenue by 3.2% and provide flexibility in managing wind resource uncertainties.

Control Co-design↗

An optimal GPS data processing technique

A formula is derived to optimally combine dual-frequency GPS (Global Positioning System) pseudorange and carrier phase data streams into a single equivalent data stream, reducing the data volume and computing time in the filtering process for parameter estimation by a factor of four. The resulting single data stream is that of carrier phase measurements with both data noise and bias uncertainty strictly defined. With this analytical formula the single stream of equivalent GPS measurements can be efficiently formed by simple numerical calculations without any degradation in data strength. The formulation for the optimally combined GPS data and their covariances are given in closed form. Carrier phase ambiguity resolution, when feasible, is improved due to the preservation of the full data strength with the optimal data combining process.

Wu, S. C.↗

A homotopy algorithm for digital optimal projection control GASD-HADOC

The linear-quadratic-gaussian (LQG) compensator was developed to facilitate the design of control laws for multi-input, multi-output (MIMO) systems. The compensator is computed by solving two algebraic equations for which standard closed-loop solutions exist. Unfortunately, the minimal dimension of an LQG compensator is almost always equal to the dimension of the plant and can thus often violate practical implementation constraints on controller order. This deficiency is especially highlighted when considering control-design for high-order systems such as flexible space structures. This deficiency motivated the development of techniques that enable the design of optimal controllers whose dimension is less than that of the design plant. A homotopy approach based on the optimal projection equations that characterize the necessary conditions for optimal reduced-order control. Homotopy algorithms have global convergence properties and hence do not require that the initializing reduced-order controller be close to the optimal reduced-order controller to guarantee convergence. However, the homotopy algorithm previously developed for solving the optimal projection equations has sublinear convergence properties and the convergence slows at higher authority levels and may fail. A new homotopy algorithm for synthesizing optimal reduced-order controllers for discrete-time systems is described. Unlike the previous homotopy approach, the new algorithm is a gradient-based, parameter optimization formulation and was implemented in MATLAB. The results reported may offer the foundation for a reliable approach to optimal, reduced-order controller design.

Collins, Emmanuel G., Jr.↗

Microbiome Adaptation Could Amplify Modeled Projections of Global Soil Carbon Loss With Climate Warming

Warming alters soil microbial traits through ecological and evolutionary processes, directly influencing the decomposition of organic matter, which significantly affects global soil carbon emissions. Yet, soil carbon models largely ignore these processes and their implications for global responses to warming. Here, we incorporate eco-evolutionary theory into a mechanistic model describing microbial soil carbon decomposition to address the question of whether such processes could have consequential effects on climate carbon feedbacks globally. We assume that a key trait of microbes, their resource allocation to production of exoenzymes (which facilitate decomposition of organic matter)—is optimized to environmental temperatures by natural selection. We find that eco-evolutionary optimization results in microbes allocating more resources to enzyme production under warming. When applied at the global scale, eco-evolutionary optimization enhances the biological realism of soil carbon models and significantly amplifies global soil carbon loss by 2100. Our results highlight the significant potential of microbial eco-evolutionary responses to influence carbon cycle feedbacks to climate change, and motivate an urgent need for more comprehensive data to accurately quantify the adaptive potential of microbiomes in response to climate change.

Biodiversity & Conservation↗

Multiobjective Aerodynamic Shape Optimization Using Pareto Differential Evolution and Generalized Response Surface Metamodels

Differential Evolution (DE) is a simple, fast, and robust evolutionary algorithm that has proven effective in determining the global optimum for several difficult single-objective optimization problems. The DE algorithm has been recently extended to multiobjective optimization problem by using a Pareto-based approach. In this paper, a Pareto DE algorithm is applied to multiobjective aerodynamic shape optimization problems that are characterized by computationally expensive objective function evaluations. To improve computational expensive the algorithm is coupled with generalized response surface meta-models based on artificial neural networks. Results are presented for some test optimization problems from the literature to demonstrate the capabilities of the method.

Madavan, Nateri K.↗