Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear 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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Resistive-Aware Linear Approximations for Solving the Optimal Power Flow Problem for Distribution Networks

Although notable progress has been made to solve the Alternate Current (AC) Optimal Power Flow (OPF), the Direct Current (DC) and Decoupled OPF approximations are still preferable in broad scenarios of practical interest. These approximations typically assume that the resistive nature of the lines in the power system is negligible. This work discusses modifications of these assumptions and presents new approximations of the DC and Decoupled OPF in light of distribution systems, in which line resistances may not be negligible. The Enhanced DC (EDC) OPF and Coupled OPF (COPF) approximations are introduced and assessed, presenting favorable results compared to their classic counterparts.

Moutis, Panayiotis↗
DOE OSTI2019

Evaluating Optimization Strategies for Engine Simulations Using Machine Learning Emulators

This work evaluates different optimization algorithms for computational fluid dynamics (CFD) simulations of engine combustion. Due to the computational expense of CFD simulations, emulators built with machine learning algorithms were used as surrogates for the optimizers. Two types of emulators were used: a Gaussian process (GP) and a weighted variety of machine learning methods called SuperLearner (SL). The emulators were trained using a dataset of 2048 CFD simulations that were run concurrently on a supercomputer. The design of experiments (DOE) for the CFD runs was obtained by perturbing nine input parameters using a Monte-Carlo method. The CFD simulations were of a heavy duty engine running with a low octane gasoline-like fuel at a partially premixed compression ignition mode. Ten optimization algorithms were tested, including types typically used in research applications. Each optimizer was allowed 800 function evaluations and was randomly tested 100 times. The optimizers were evaluated for the median, minimum, and maximum merits obtained in the 100 attempts. Some optimizers required more sequential evaluations, thereby resulting in longer wall clock times to reach an optimum. The best performing optimization methods were particle swarm optimization (PSO), differential evolution (DE), GENOUD (an evolutionary algorithm), and micro-genetic algorithm (GA). These methods found a high median optimum as well as a reasonable minimum optimum of the 100 trials. Moreover, all of these methods were able to operate with less than 100 successive iterations, which reduced the wall clock time required in practice. Two methods were found to be effective but required a much larger number of successive iterations: the DIRECT and MALSCHAINS algorithms. A random search method that completed in a single iteration performed poorly in finding optimum designs but was included to illustrate the limitation of highly concurrent search methods. The last three methods, Nelder–Mead, bound optimization by quadratic approximation (BOBYQA), and constrained optimization by linear approximation (COBYLA), did not perform as well.

Probst, Daniel M.↗
DOE OSTI2015

Next-generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience

This report summarizes the work performed under the project project Next-Generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for infrastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years of Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasible region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality constraints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Improved Axisymmetric and High Temperature Material Structural Modeling in MOOSE and NEML

This report describes improvements made to the solid mechanics formulation in the MOOSE open source finite element simulation environment and the open source Nuclear Engineering Material model Library (NEML) for mechanical constitutive models. The focus of these improvements is to improve the usability and performance of simulations involving one or both pieces of software. Specifically, this work completes a new system for solid mechanics simulations in the MOOSE ecosystem providing exact linearizations and optimal (quadratic) convergence, for a variety of coordinate systems and material types, including large deformation simulations. This work then provides users a framework to build highly efficient mechanical simulations of structures or materials or to couple in additional MOOSE physics modules to build complex, scalable multiphysics simulations.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Stochastic Design Optimization of Microstructural Features Using Linear Programming for Robust Design

Microstructure design can have a substantial effect on the performance of critical components in numerous aerospace applications. However, the stochastic nature of metallic microstructures leads to deviations in material properties from the design point and alters the performance of these critical components. In this paper, a novel stochastic linear programming (LP) methodology is developed for microstructure design accounting for uncertainties in desired properties. The metallic microstructure is represented using a finite element discretized form of the orientation distribution function (ODF). The inverse LP problem solves the mean values and covariance matrix of the ODFs to maximize the mean values of a property, given the statistical constraints on other properties. The highlight is an analytical uncertainty quantification model via a Gaussian distribution to model propagation of microstructural uncertainties to the properties. Examples illustrate maximization of the yield strength and magnetostriction of a galfenol alloy when constrained by uncertainties in a set of stiffness constants.

42 ENGINEERING↗
DOE OSTI2013

Downscaling Solar Power Output to 4-Seconds for Use in Integration Studies (Presentation)

High penetration renewable integration studies require solar power data with high spatial and temporal accuracy to quantify the impact of high frequency solar power ramps on the operation of the system. Our previous work concentrated on downscaling solar power from one hour to one minute by simulation. This method used clearness classifications to categorize temporal and spatial variability, and iterative methods to simulate intra-hour clearness variability. We determined that solar power ramp correlations between sites decrease with distance and the duration of the ramp, starting at around 0.6 for 30-minute ramps between sites that are less than 20 km apart. The sub-hour irradiance algorithm we developed has a noise floor that causes the correlations to approach ~0.005. Below one minute, the majority of the correlations of solar power ramps between sites less than 20 km apart are zero, and thus a new method to simulate intra-minute variability is needed. These intra-minute solar power ramps can be simulated using several methods, three of which we evaluate: a cubic spline fit to the one-minute solar power data; projection of the power spectral density toward the higher frequency domain; and average high frequency power spectral density from measured data. Each of these methods either under- or over-estimates the variability of intra-minute solar power ramps. We show that an optimized weighted linear sum of methods, dependent on the classification of temporal variability of the segment of one-minute solar power data, yields time series and ramp distributions similar to measured high-resolution solar irradiance data.

14 SOLAR ENERGY↗
DOE OSTI2013

Downscaling Solar Power Output to 4-Seconds for Use in Integration Studies: Preprint

High penetration renewable integration studies require solar power data with high spatial and temporal accuracy to quantify the impact of high frequency solar power ramps on the operation of the system. Our previous work concentrated on downscaling solar power from one hour to one minute by simulation. This method used clearness classifications to categorize temporal and spatial variability, and iterative methods to simulate intra-hour clearness variability. We determined that solar power ramp correlations between sites decrease with distance and the duration of the ramp, starting at around 0.6 for 30-minute ramps between sites that are less than 20 km apart. The sub-hour irradiance algorithm we developed has a noise floor that causes the correlations to approach ~0.005. Below one minute, the majority of the correlations of solar power ramps between sites less than 20 km apart are zero, and thus a new method to simulate intra-minute variability is needed. These intra-minute solar power ramps can be simulated using several methods, three of which we evaluate: a cubic spline fit to the one-minute solar power data; projection of the power spectral density toward the higher frequency domain; and average high frequency power spectral density from measured data. Each of these methods either under- or over-estimates the variability of intra-minute solar power ramps. We show that an optimized weighted linear sum of methods, dependent on the classification of temporal variability of the segment of one-minute solar power data, yields time series and ramp distributions similar to measured high-resolution solar irradiance data.

14 SOLAR ENERGY↗
DOE OSTI2025

Multi-plane moment-of-fluid interface reconstruction in 3D

Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.

3D interface reconstruction↗
DOE OSTI2022

Non‐Linear Optical Properties of the ( RE ) 3 CuGeS 7 Family of Compounds

Abstract Non‐linear optical materials must possess a balanced combination of laser‐induced damage threshold (LDT) and second‐harmonic generation (SHG) and be phase matchable. In our previous work, chiral and polar La 3 CuGeS 7 was identified as a promising non‐linear optical material. Herein, we report the optimization of non‐linear optical properties through replacement of La with smaller lanthanides. It is determined that Gd 3 CuGeS 7 exhibits the best combination of SHG (1.6× AgGaS 2 at 88–105 μm particle size) and LDT (3× AgGaS 2 , 89 MW/cm 2 ) and is phase matchable. Based on changes in metal‐sulfur bond lengths and angles, we further propose structural optimization through solid‐solution formation and doping.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Combining PCA and nonlinear fitting of peak models to re-evaluate C 1s XPS spectrum of cellulose

Cellulose is an example of a material that responds to XPS by the creation of new chemistry not present in the as-received sample. While improvements in instrumentation may be seen in general as beneficial to surface science, recent studies have shown that the consequences for some materials are detrimental. Here, in this work, these problems are illustrated through an analysis of cellulose spectra obtained during a degradation study. C 1s spectra are decomposed into two well-formed component curves that are open to chemical interpretation. In particular, a component-curve representative of pure cellulose is obtained as well as a second component curve that implies cellulose is degraded through the creation of carbon chemistry involving C—O, C$=$O and O—C$=$O. Since cellulose is a crystalline material, formed through the alignment of molecules under the influence of hydrogen bonds, the analysis and findings presented in this paper are relevant to any material analyzed by XPS whose properties are dependent on hydrogen bonds. The analysis techniques are based on an informed vectorial approach, which extracts directly from data spectral shapes that are used to monitor sample degradation via linear least squares optimization. Related mathematics of Principal Component Analysis and linear analysis are presented.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems

We develop a framework for goal-oriented optimal design of experiments (GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This framework differs from classical Bayesian optimal design of experiments (ODE) in the following sense: we seek experimental designs that minimize the posterior uncertainty in the experiment end-goal, e.g. a quantity of interest (QoI), rather than the estimated parameter itself. This is suitable for scenarios in which the solution of an inverse problem is an intermediate step and the estimated parameter is then used to compute a QoI. In such problems, a GOODE approach has two benefits: the designs can avoid wastage of experimental resources by a targeted collection of data, and the resulting design criteria are computationally easier to evaluate due to the often low-dimensionality of the QoIs. We present two modified design criteria, A-GOODE and D-GOODE, which are natural analogues of classical Bayesian A- and D-optimal criteria. We analyze the connections to other ODE criteria, and provide interpretations for the GOODE criteria by using tools from information theory. Then, we develop an efficient gradient-based optimization framework for solving the GOODE optimization problems. Additionally, we present comprehensive numerical experiments testing the various aspects of the presented approach. The driving application is the optimal placement of sensors to identify the source of contaminants in a diffusion and transport problem. As a result, we enforce sparsity of the sensor placements using an L1-norm penalty approach, and propose a practical strategy for specifying the associated penalty parameter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗