Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic 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

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Theory Manual (V.6.15)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis (V.6.16 User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

A hybrid data-driven and model-based approach for computationally efficient stochastic unit commitment and economic dispatch under wind and solar uncertainty

Stochastic unit commitment (UC) and economic dispatch (ED) are imperative in dealing with uncertainty in renewable forecast for power system operation and planning such that the overall expected production cost is minimized over the planning horizon. However, accurate calculation of the expected production cost requires assessment of a very large number of different scenarios of uncertain renewable resources, such as solar and wind, which is practically infeasible to simulate in real time. This article proposes a hybrid datadriven and physics-based model-predictive paradigm to efficiently solve for stochastic unit commitment and economic dispatch considering uncertainty in wind and solar power forecasts. Here, the novelty of the approach lies in decoupling the production cost estimation from the unit commitment and economic dispatch optimization problems under uncertainty without compromising on the fidelity of the solutions. A data-driven machine learning model is first developed to predict the mean optimal production cost. A physics-based inverse problem is then solved to get the stochastic UC and ED profiles from the expected cost. The presented approach considers, for the first time, solar uncertainty in UC/ED determination and enables efficient and accurate propagation of wind and solar uncertainty to estimate the statistics of the production cost. The effectiveness of the developed approach is demonstrated systematically on a stylized RTS-GMLC single-node system. The overall framework predicts the expected cost 62.5% more accurately than the existing state-of-the-art, on unforeseen days during the entire year, and yields, for the first time, the associated physically consistent UC and ED profiles. The solutions are also shown to be flexible in providing adequate daily reserves to address any statistical deviations from probabilistic power forecasts. The computational time associated with the presented method is only about 10 s compared to over 24 h needed for a conventional stochastic UC/ED determination under uncertainty on an Intel Core i9 processor with 32 GB of RAM.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Stochastic Model Predictive Control With Gaussian Wind Direction Preview for Wake Steering

This article addresses the problem of wake steering control for wind farms that explicitly consider the tradeoff between farm-level power generation and yaw duty cycle under variable and uncertain wind conditions. A novel stochastic model predictive control (MPC) algorithm is presented, which utilizes a stochastic model of the freestream wind field components in a receding horizon framework to compute optimal yaw set points that maximize the expected value of the farm power while constraining the yaw actuation. Different configurations of the algorithm are evaluated using a steady-state wind farm simulator. The proposed stochastic MPC algorithm can plan control actions over a future prediction horizon based on probabilistic estimates of the incoming wind magnitude and direction.

17 WIND ENERGY↗

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗

Bounds on probability of transformations between multipartite pure states

For a tripartite pure state of three qubits, it is well known that there are two inequivalent classes of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) class and the W class. Any two states within the same class can be transformed into each other with stochastic local operations and classical communication with a nonzero probability. The optimal conversion probability, however, is only known for special cases. Here, lower and upper bounds are derived for the optimal probability of transformation from a GHZ state to other states of the GHZ class. A key idea in the derivation of the upper bounds is to consider the action of the local operations and classical communications (LOCC) protocol on a different input state, namely 1/sq root(2)[|000>-|111>], and to demand that the probability of an outcome remains bounded by 1. We also find an upper bound for more general cases by using the constraints of the so-called interference term and 3-tangle. Moreover, some of the results are generalized to the case in which each party holds a higher dimensional system. In particular, the GHZ state generalized to three qutrits; that is, |GHZ{sub 3}>=1/sq root(3)[|000>+|111>+|222>] shared among three parties can be transformed to any tripartite three-qubit pure state with probability 1 via LOCC. Some of our results can also be generalized to the case of a multipartite state shared by more than three parties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Droplet size distributions in turbulent clouds: experimental evaluation of theoretical distributions

Precipitation efficiency and optical properties of clouds, both central to determining Earth's weather and climate, depend on the size distribution of cloud particles. Here in this paper, theoretical expressions for cloud droplet size distribution shape are evaluated using measurements from controlled experiments in a convective-cloud chamber. The experiments are a unique opportunity to constrain theory because they are in steady-state and because the initial and boundary conditions are well characterized compared to typical atmospheric measurements. Three theoretical distributions obtained from a Langevin drift-diffusion approach to cloud formation via stochastic condensation are tested: (a) stochastic condensation with a constant removal time-scale; (b) stochastic condensation with a size-dependent removal time-scale; (c) droplet growth in a fixed supersaturation condition and with size-dependent removal. In addition, a similar Weibull distribution that can be obtained from the drift-diffusion approach, as well as from mechanism-independent probabilistic arguments (e.g., maximum entropy), is tested as a fourth hypothesis. Statistical techniques such as the χ2 test, sum of squared errors of prediction, and residual analysis are employed to judge relative success or failure of the theoretical distributions to describe the experimental data. An extensive set of cloud droplet size distributions are measured under different aerosol injection rates. Five different aerosol injection rates are run both for size-selected aerosol particles, and six aerosol injection rates are run for broad-distribution, polydisperse aerosol particles. In relative comparison, the most favourable comparison to the measurements is the expression for stochastic condensation with size-dependent droplet removal rate. However, even this optimal distribution breaks down for broad aerosol size distributions, primarily due to deviations from the measured large-droplet tail. Lastly, a possible explanation for the deviation is the Ostwald ripening effect coupled with deactivation/activation in polluted cloud conditions.

54 ENVIRONMENTAL SCIENCES↗

Output Feedback Stabilization for a Class of Multi-Variable Bilinear Stochastic Systems with Stochastic Coupling Attenuation

In this paper, stochastic coupling attenuation is investigated for a class of multi-variable bilinear stochastic systems and a novel output feedback m-block backstepping controller with linear estimator is designed, where gradient descent optimization is used to tune the design parameters of the controller. It has been shown that the trajectories of the closed-loop stochastic systems are bounded in probability sense and the stochastic coupling of the system outputs can be effectively attenuated by the proposed control algorithm. Moreover, the stability of the stochastic systems is analyzed and the effectiveness of the proposed method has been demonstrated using a simulated example.

47 OTHER INSTRUMENTATION↗

Does Risk Aversion Affect Transmission and Generation Planning? A Western North America Case Study

Here, we investigate the effects of risk aversion on optimal transmission and generation expansion planning in a competitive and complete market. To do so, we formulate a stochastic model that minimizes a weighted average of expected transmission and generation costs and their conditional value at risk (CVaR). We also show that the solution of this optimization problem is equivalent to the solution of a perfectly competitive risk-averse Stackelberg equilibrium, in which a risk-averse transmission planner maximizes welfare after which risk-averse generators maximize profits. Furthermore, this model is then applied to a 240-bus representation of the Western Electricity Coordinating Council, in which we examine the impact of risk aversion on levels and spatial patterns of generation and transmission investment. Although the impact of risk aversion remains small at an aggregate level, state-level impacts on generation and transmission investment can be significant, which emphasizes the importance of explicit consideration of risk aversion in planning models.

60 APPLIED LIFE SCIENCES↗

Phenotypic switching of populations of cells in a stochastic environment

We report that in biology phenotypic switching is a common bet-hedging strategy in the face of uncertain environmental conditions. Existing mathematical models often focus on periodically changing environments to determine the optimal phenotypic response. We focus on the case in which the environment switches randomly between discrete states. Starting from an individual-based model we derive stochastic differential equations to describe the dynamics, and obtain analytical expressions for the mean instantaneous growth rates based on the theory of piecewise-deterministic Markov processes. We show that optimal phenotypic responses are non-trivial for slow and intermediate environmental processes, and systematically compare the cases of periodic and random environments. The best response to random switching is more likely to be heterogeneity than in the case of deterministic periodic environments, net growth rates tend to be higher under stochastic environmental dynamics. The combined system of environment and population of cells can be interpreted as host-pathogen interaction, in which the host tries to choose environmental switching so as to minimise growth of the pathogen, and in which the pathogen employs a phenotypic switching optimised to increase its growth rate. Finally, we discuss the existence of Nash-like mutual best-response scenarios for such host-pathogen games.

59 BASIC BIOLOGICAL SCIENCES↗

Entanglement and symmetry in permutation-symmetric states

We investigate the relationship between multipartite entanglement and symmetry, focusing on permutation symmetric states. We give a highly intuitive geometric interpretation to entanglement via the Majorana representation, where these states correspond to points on a unit sphere. We use this to show how various entanglement properties are determined by the symmetry properties of the states. The geometric measure of entanglement is thus phrased entirely as a geometric optimization and a condition for the equivalence of entanglement measures written in terms of point symmetries. Finally, we see that different symmetries of the states correspond to different types of entanglement with respect to interconvertibility under stochastic local operations and classical communication.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effects of spike-time-dependent plasticity on the stochastic resonance of small-world neuronal networks

The phenomenon of stochastic resonance in Newman-Watts small-world neuronal networks is investigated when the strength of synaptic connections between neurons is adaptively adjusted by spike-time-dependent plasticity (STDP). It is shown that irrespective of the synaptic connectivity is fixed or adaptive, the phenomenon of stochastic resonance occurs. The efficiency of network stochastic resonance can be largely enhanced by STDP in the coupling process. Particularly, the resonance for adaptive coupling can reach a much larger value than that for fixed one when the noise intensity is small or intermediate. STDP with dominant depression and small temporal window ratio is more efficient for the transmission of weak external signal in small-world neuronal networks. In addition, we demonstrate that the effect of stochastic resonance can be further improved via fine-tuning of the average coupling strength of the adaptive network. Furthermore, the small-world topology can significantly affect stochastic resonance of excitable neuronal networks. It is found that there exists an optimal probability of adding links by which the noise-induced transmission of weak periodic signal peaks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A stochastic method for stand-alone photovoltaic system sizing

Photovoltaic systems utilize solar energy to generate electrical energy to meet load demands. Optimal sizing of these systems includes the characterization of solar radiation. Solar radiation at the Earth's surface has random characteristics and has been the focus of various academic studies. The objective of this study was to stochastically analyze parameters involved in the sizing of photovoltaic generators and develop a methodology for sizing of stand-alone photovoltaic systems. Energy storage for isolated systems and solar radiation were analyzed stochastically due to their random behavior. For the development of the methodology proposed stochastic analysis were studied including the Markov chain and beta probability density function. The obtained results were compared with those for sizing of stand-alone using from the Sandia method (deterministic), in which the stochastic model presented more reliable values. Both models present advantages and disadvantages; however, the stochastic one is more complex and provides more reliable and realistic results. (author)

14 SOLAR ENERGY↗

DAKOTA Design Analysis Kit for Optimization and Terascale

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes (computational models) and iterative analysis methods. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and analysis of computational models on high performance computers.A user provides a set of DAKOTA commands in an input file and launches DAKOTA. DAKOTA invokes instances of the computational models, collects their results, and performs systems analyses. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, polynomial chaos, stochastic collocation, and epistemic methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as hybrid optimization, surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. Services for parallel computing, simulation interfacing, approximation modeling, fault tolerance, restart, and graphics are also included.

SciDAC↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis :

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty

We introduce the problem of scheduling observations on a constellation of remote sensors, to maximize the aggregate quality of the collections obtained. While automated tools exist to schedule remote sensors, they are often based on heuristic scheduling techniques, which typically fail to provide bounds on the quality of the resultant schedules. To address this issue, we first introduce a novel deterministic mixed-integer programming (MIP) model for scheduling a constellation of one to n satellites, which relies on extensive pre-computations associated with orbital propagators and sensor collection simulators to mitigate model size and complexity. Our MIP model captures realistic and complex constellation-target geometries, with solutions providing optimality guarantees. We then extend our base deterministic MIP model to obtain two-stage and three-stage stochastic MIP models that proactively schedule to maximize expected collection quality across a set of scenarios representing cloud cover uncertainty. Our experimental conclusions on instances of one and two satellites demonstrate that our stochastic MIP models yield significantly improved collection quality relative to our base deterministic MIP model. We further demonstrate that commercial off-the-shelf MIP solvers can produce provably optimal or near-optimal schedules from these models in time frames suitable for sensor operations.

47 OTHER INSTRUMENTATION↗