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 199 records · Page 11

Optimization of a solar powered absorption cycle under Abu Dhabi's weather conditions

In order for the solar absorption air conditioners to become a real alternative to the conventional vapour compression systems, their performance has to be improved and their total cost has to be reduced. A solar powered absorption cycle is modeled using the Transient System Simulation (TRNSYS) program and Typical Meteorological Year 2 data of Abu Dhabi. It uses evacuated tube collectors to drive a 10 kW ammonia-water absorption chiller. Firstly, the system performance and its total cost are optimized separately using single objective optimization algorithms. The design variables considered are: the collector slope, the collector mass flow rate, the collector area and the storage tank volume. The single objective optimization results show that MATLAB global optimization methods agree with the TRNSYS optimizer. Secondly, MATLAB is used to solve a multi-objective optimization problem to improve the system's performance and cost, simultaneously. The optimum designs are presented using Pareto curve and show the potential improvements of the baseline system. (author)

14 SOLAR ENERGY↗

Optimal Proactive Vehicle Relocation for On-Demand Mobility Service with Deep Convolution-LSTM Network

This study develops an innovative model for inferring optimal proactive relocation strategy for empty vehicles of on-demand mobility service (OMS) directly from past observations of passenger demand. The output of our model is a row stochastic relocation matrix which gives the probability that an empty vehicle should be relocated from location i to location j at any given time. The matrix itself is high-dimensional and therefore challenging to obtain accurate estimation with traditional machine learning approach. Our model proposes the low-rank approximation of the relocation matrix, and introduces the deep convolution-LSTM network which extracts low-level spatial and temporal features from past demand observations for best restoration of the actual low rank approximation vector. The model is trained by deriving the optimal matching strategies from one year of real-world trip data. The results show that our model is able to predict the low-rank approximation of the relocation matrix with 4% of mean absolute error, may reduce the relocation cost by 20%-45% as compared to the real-world observations and is 50% optimal as compared to the global optimal matching with perfect information.

Lei, Zengxiang↗

A Hierarchical Modeling for Reactive Power Optimization With Joint Transmission and Distribution Networks by Curve Fitting

Here, in order to solve the reactive power optimization with joint transmission and distribution networks, a hierarchical modeling method is proposed in this paper. It allows the reactive power optimization of transmission and distribution networks to be performed separately, leading to a master–slave structure and improves traditional centralized modeling methods by alleviating the big data problem in a control center. Specifically, the transmission-distribution-network coordination issue of the hierarchical modeling method is investigated. First, a curve-fitting approach is developed to provide a cost function of the slave model for the master model, which reflects the impacts of each slave model. Second, the transmission and distribution networks are decoupled at feeder buses, and all the distribution networks are coordinated by the master reactive power optimization model to achieve the global optimality. Finally, numerical results on two test systems verify the effectiveness of the proposed hierarchical modeling and curve-fitting methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Design Space Exploration for MDO on a Teraflop Computer

The objective of this work was to develop global optimization techniques suitable for identifying promising regions in high dimensional aircraft configuration design space. Different optimization methods have been examined to evaluation their ability to efficiently search the design space to locate promising regions. Multistart local optimization methods as well as global search techniques were examined and modified to compare their performance on high dimensional design space.

Haftka, Raphael↗

Tractable Pareto Optimization of Temporal Preferences

This paper focuses on temporal constraint problems where the objective is to optimize a set of local preferences for when events occur. In previous work, a subclass of these problems has been formalized as a generalization of Temporal CSPs, and a tractable strategy for optimization has been proposed, where global optimality is defined as maximizing the minimum of the component preference values. This criterion for optimality, which we call 'Weakest Link Optimization' (WLO), is known to have limited practical usefulness because solutions are compared only on the basis of their worst value; thus, there is no requirement to improve the other values. To address this limitation, we introduce a new algorithm that re-applies WLO iteratively in a way that leads to improvement of all the values. We show the value of this strategy by proving that, with suitable preference functions, the resulting solutions are Pareto Optimal.

Morris, Robert↗

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗

An Active Subspace Method for Accelerating Convergence in Delaunay-Based Optimization via Dimension Reduction

Delaunay-based derivative-free optimization, ∆DOGS, is an efficient and provably-convergent global optimization method for the problems which has computationally expensive objection function and the analytical expression for the objective function is not available. ∆-DOGS is a novel optimization scheme in the family of response surface methods (RSMs); however, it suffers from the curse of dimensionality since the computational cost increases dramatically as the number of design parameters increases. As a result, the number of design parameters in ∆-DOGS algorithm is relatively low (n.10). To avoid such problems, this paper proposes a combination of derivative-free optimization, seeking the global minimizer of an expensive and nonconvex objective function f(x) and active subspace method, detecting the directions of the most variability using evaluations of the gradient. The contribution of other directions to the objective function is bounded by a sufficiently small constant. This new algorithm iteratively applied Delaunay-based derivative-free optimization to seek the minimizer on the d-dimensional active subspace that has most function variation. Inverse mapping is needed to project data from active subspace to full-model for evaluating function values. This task is overcome by solving an inequality constrained problem that curves the response surface of the objective function. The test results show that this strategy is effective on a handful of optimization problems.

Bewley, Thomas R.↗

SmartApps: Middle-ware for Adaptive Applications on Reconfigurable Platforms

There are several reasons why the performance of current distributed and heterogeneous systems is often disappointing. For example, the characteristics of the application may be input sensitive and evolve during execution causing dramatic changes in memory reference patterns, resource requirements, or degree of concurrency between different phases of the computation. Or, the system may change dynamically with nodes failing or appearing, some network links severed and other links established with different latencies and bandwidths. Another important reason for poor performance is the fairly compartmentalized approach to optimization: applications, compilers, operating systems and hardware configurations are designed and optimized in isolation and without the knowledge of instance specific information and needs of a running application. There is too little information flow across these boundaries and no global optimization is even attempted. For example, most operating systems services like paging, virtual-to-physical page mapping, I/O, or data layout in disks, provide little or no application customization. Similarly, the off-the-shelf hardware used by most commercial systems is optimized to give best average-case performance. To address this problem, we have proposed application-centric computing, or Smart Applications (SAS). In the SAS executable, the compiler embeds most run-time system services, and a performance-optimizing feedback loop that monitors the application's performance and adaptively reconfigures the application and the OS/system platform. At run-time, after incorporating the code's input and determining the system's resources and state, the SAS performs an *instance* specific optimization, which is more tractable than a global generic optimization between application, OS and system. The overriding philosophy of SAS is ``measure, compare, and adapt if beneficial.'' That is, the application will continually monitor its performance and the available resources to determine if, and by how much, performance could be improved if the application was restructured. Then, if the potential performance benefit outweighs the projected overhead costs, the application will restructure itself and the underlying system accordingly. The SAS framework includes performance monitoring and modeling components and mechanisms for performing the actual restructuring at various levels including: (i) algorithmic adaptation, (ii) run-time software optimization (e.g., input sensitivity analysis, etc.), (iii) tuning reconfigurable OS services (scheduling policy, page size, etc), and (iv) system configuration (e.g., selecting which, and how many, computational resources to use). SmartApps is being developed in the STAPL infrastructure. STAPL (the Standard Template Adaptive Parallel Library) is a framework for developing highly-optimizable, adaptable, and portable parallel and distributed applications. It consists of a relatively new and still evolving collection of generic parallel algorithms and distributed containers and a run-time system (RTS) through which the application and compiler interact with the OS and hardware.

97 MATHEMATICS AND COMPUTING↗

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗

Optimal interpolation of global dissolved oxygen: 1965–2015

Oxygen inventory of the global ocean has declined in recent decades potentially due to the warming-induced reduction in solubility as well as the circulation and biogeochemical changes associated with ocean warming and increasing stratification. Earth System Models predict continued oxygen decline for this century with profound impacts on marine ecosystem and fisheries. Observational constraint on the rate of oxygen loss is crucial for assessing the ability of models to accurately simulate these changes. There are only a few observational assessments of the global oceanic oxygen inventory reporting a range of oxygen loss. This study develops a gridded data set of dissolved oxygen for the global oceans using optimal interpolation method. The resulting gridded product includes full-depth map of dissolved oxygen as 5-year moving average from 1965 to 2015 with uncertainty estimates. The uncertainty can come from unresolved small-scale and high-frequency variability and mapping errors. The multi-decadal trend of global dissolved oxygen is in the range of -281 to -373 Tmol/decade. This estimate is more conservative than previous works. In this study, the grid points far from the observations are essentially set equal to zero anomaly from the climatology. Calculating global inventory with this approach produces a relatively conservative estimate; thus, the results from this study likely provide a useful lower bound estimate of the global oxygen loss.

54 ENVIRONMENTAL SCIENCES↗

GlobiPack v. 1.0

GlobiPack contains a small collection of optimization globalization algorithms. These algorithms are used by optimization and various nonlinear equation solver algorithms.Used as the line-search procedure with Newton and Quasi-Newton optimization and nonlinear equation solver methods. These are standard published 1-D line search algorithms such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. One set of algorithms were copied and refactored from the existing open-source Trilinos package MOOCHO where the linear search code is used to globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.

Bartlett, Roscoe↗

GlobiPack v. 1.0

GlobiPack contains a small collection of optimization globalization algorithms. These algorithms are used by optimization and various nonlinear equation solver algorithms.Used as the line-search procedure with Newton and Quasi-Newton optimization and nonlinear equation solver methods. These are standard published 1-D line search algorithms such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. One set of algorithms were copied and refactored from the existing open-source Trilinos package MOOCHO where the linear search code is used to globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.

Bartlett, Roscoe↗

Bounding the solutions of parametric weakly coupled second-order semilinear parabolic partial differential equations

Here in this paper, two novel techniques for bounding the solutions of parametric weakly coupled second-order semilinear parabolic partial differential equations are developed. The first provides a theorem to construct interval bounds, while the second provides a theorem to construct lower bounds convex and upper bounds concave in the parameter. The convex/concave bounds can be significantly tighter than the interval bounds because of the wrapping effect suffered by interval analysis in dynamical systems. Both types of bounds are computationally cheap to construct, requiring solving auxiliary systems twice and four times larger than the original system, respectively. An illustrative numerical example of bound construction and use for deterministic global optimization within a simple serial branch-and-bound algorithm, implemented numerically using interval arithmetic and a generalization of McCormick's relaxation technique, is presented. Finally, problems within the important class of reaction-diffusion systems may be optimized with these tools.

42 ENGINEERING↗

Signal-Anticipation in Local Voltage Control in Distribution Systems

We consider the signal-anticipating behavior in local Volt/Var control for distribution systems. Such a behavior makes interaction among the nodes a game. We characterize Nash equilibrium of the game as the optimum of a global optimization problem and establish its asymptotic global stability. We also show that the signal-anticipating voltage control has less restrictive convergence condition than the signal-taking control. We then introduce the notion of price of signal-anticipation (PoSA) to characterize the impact of signal-anticipating control, and use the gap in cost between network equilibrium in the signal-taking control and Nash equilibrium in the signal-anticipating control as the metric for PoSA. We characterize how the PoSA scales with the size, topology, and heterogeneity of the distribution network for a few network settings. Our results show that the PoSA is upper bounded by a constant and the average PoSA per node will go to zero as the size of the network increases. This is desirable as it means that the PoSA will not be arbitrarily large, no matter what the size of the network is, and no mechanism is needed to mitigate the signal-anticipating behavior. We further carry out numerical experiments with a real-world distribution circuit to complement the theoretical analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Sequence of polyhedral relaxations for nonlinear univariate functions

Here, given a nonlinear, univariate, bounded, and differentiable function f(x), this article develops a sequence of Mixed Integer Linear Programming (MILP) and Linear Programming (LP) relaxations that converge to the graph of f(x) and its convex hull, respectively. Theoretical convergence of the sequence of relaxations to the graph of the function and its convex hull is established. For nonlinear non-convex optimization problems, the relaxations presented in this article can be used to construct tight MILP and LP relaxations. These MILP and the LP relaxations can also be used with MILP-based and spatial branch-and-bound based global optimization algorithms, respectively.

42 ENGINEERING↗

Solving geosteering inverse problems by stochastic Hybrid Monte Carlo method

The inverse problems arise in almost all fields of science where the real-world parameters are extracted from a set of measured data. The geosteering inversion plays an essential role in the accurate prediction of oncoming strata as well as a reliable guidance to adjust the borehole position on the fly to reach one or more geological targets. This mathematical treatment is not easy to solve, which requires finding an optimum solution among a large solution space, especially when the problem is non-linear and non-convex. Nowadays, a new generation of logging-while-drilling (LWD) tools has emerged on the market. The so-called azimuthal resistivity LWD tools have azimuthal sensitivity and a large depth of investigation. Hence, the associated inverse problems become much more difficult since the earth model to be inverted will have more detailed structures. The conventional deterministic methods are incapable to solve such a complicated inverse problem, where they suffer from the local minimum trap. Alternatively, stochastic optimizations are in general better at finding global optimal solutions and handling uncertainty quantification. In this article, we investigate the Hybrid Monte Carlo (HMC) based statistical inversion approach and suggest that HMC based inference is more efficient in dealing with the increased complexity and uncertainty faced by the geosteering problems.

97 MATHEMATICS AND COMPUTING↗

Optimal control landscape for the generation of unitary transformations with constrained dynamics

The reliable and precise generation of quantum unitary transformations is essential for the realization of a number of fundamental objectives, such as quantum control and quantum information processing. Prior work has explored the optimal control problem of generating such unitary transformations as a surface-optimization problem over the quantum control landscape, defined as a metric for realizing a desired unitary transformation as a function of the control variables. It was found that under the assumption of nondissipative and controllable dynamics, the landscape topology is trap free, which implies that any reasonable optimization heuristic should be able to identify globally optimal solutions. The present work is a control landscape analysis, which incorporates specific constraints in the Hamiltonian that correspond to certain dynamical symmetries in the underlying physical system. It is found that the presence of such symmetries does not destroy the trap-free topology. These findings expand the class of quantum dynamical systems on which control problems are intrinsically amenable to a solution by optimal control.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗