Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2025

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗
DOE OSTI2013

Optimal Transmission Switching Using the IV-ACOPF Linearization

In this paper we seek to investigate the performance of transmission switching using the iterative linear program approximation to the Current Voltage AC Optimal Power Flow (IV-ACOPF). Several different methods of using this switching are investigated to find a method that addresses the MIP challenges and is both fast and accurate. We consider opening only one line, opening up to five lines, and progressively opening one line at a time. The linear method with switching is much faster than the nonlinear ACOPF and generally finds solutions within 1% of the nonlinear ACOPF.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Joint analysis of Dark Energy Survey Year 3 data and CMB lensing from SPT and P l a n c k . II. Cross-correlation measurements and cosmological constraints

Cross-correlations of galaxy positions and galaxy shears with maps of gravitational lensing of the cosmic microwave background (CMB) are sensitive to the distribution of large-scale structure in the Universe. Such cross-correlations are also expected to be immune to some of the systematic effects that complicate correlation measurements internal to galaxy surveys. We present measurements and modeling of the cross-correlations between galaxy positions and galaxy lensing measured in the first three years of data from the Dark Energy Survey with CMB lensing maps derived from a combination of data from the 2500 deg 2 SPT-SZ survey conducted with the South Pole Telescope and full-sky data from the Planck satellite. The CMB lensing maps used in this analysis have been constructed in a way that minimizes biases from the thermal Sunyaev Zel’dovich effect, making them well suited for cross-correlation studies. The total signal-to-noise of the cross-correlation measurements is 23.9 (25.7) when using a choice of angular scales optimized for a linear (nonlinear) galaxy bias model. Here we use the cross-correlation measurements to obtain constraints on cosmological parameters. For our fiducial galaxy sample, which consist of four bins of magnitude-selected galaxies, we find constraints of Ω m =0.272$^{+0.032}_{-0.052}$ and S 8 ≡σ8$\sqrt{Ω_m/0.3}$=0.736$^{+0.032}_{-0.028}$ (Ω m =0.245$^{+0.026}_{-0.044}$ and S 8 =0.734$^{+0.035}_{-0.028}$) when assuming linear (nonlinear) galaxy bias in our modeling. Considering only the cross-correlation of galaxy shear with CMB lensing, we find Ω m =0.270$^{+0.043}_{-0.061}$ and S 8 =0.740$^{+0.034}_{-0.029}$. Our constraints on S8 are consistent with recent cosmic shear measurements, but lower than the values preferred by primary CMB measurements from Planck.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Optimizing BAO measurements with non-linear transformations of the Lyman-α forest

We explore the effect of applying a non-linear transformation to the Lyman-α forest transmitted flux F=e{sup −τ} and the ability of analytic models to predict the resulting clustering amplitude. Both the large-scale bias of the transformed field (signal) and the amplitude of small scale fluctuations (noise) can be arbitrarily modified, but we were unable to find a transformation that increases significantly the signal-to-noise ratio on large scales using Taylor expansion up to the third order. In particular, however, we achieve a 33% improvement in signal to noise for Gaussianized field in transverse direction. On the other hand, we explore an analytic model for the large-scale biasing of the Lyα forest, and present an extension of this model to describe the biasing of the transformed fields. Using hydrodynamic simulations we show that the model works best to describe the biasing with respect to velocity gradients, but is less successful in predicting the biasing with respect to large-scale density fluctuations, especially for very nonlinear transformations.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

A time-parallel method for the solution of PDE-constrained optimization problems

We study a time-parallel approach to solving quadratic optimization problems with linear time-dependent partial differential equation (PDE) constraints. These problems arise in formulations of optimal control, optimal design and inverse problems that are governed by parabolic PDE models. They may also arise as subproblems in algorithms for the solution of optimization problems with nonlinear time-dependent PDE constraints, e.g., in sequential quadratic programming methods. We apply a piecewise linear finite element discretization in space to the PDE constraint, followed by the Crank-Nicolson discretization in time. The objective function is discretized using finite elements in space and the trapezoidal rule in time. At this point in the discretization, auxiliary state variables are introduced at each discrete time interval, with the goal to enable: (i) a decoupling in time; and (ii) a fixed-point iteration to recover the solution of the discrete optimality system. The fixed-point iterative schemes can be used either as preconditioners for Krylov subspace methods or as smoothers for multigrid (in time) schemes. We present promising numerical results for both use cases.

97 MATHEMATICS AND COMPUTING↗