Search NASA⌕ Search

SEARCH · Search NASA

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 937 records · Page 52

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Probing the anisotropies of a stochastic gravitational-wave background using a network of ground-based laser interferometers

We present a maximum-likelihood analysis for estimating the angular distribution of power in an anisotropic stochastic gravitational-wave background using ground-based laser interferometers. The standard isotropic and gravitational-wave radiometer searches (optimal for point sources) are recovered as special limiting cases. The angular distribution can be decomposed with respect to any set of basis functions on the sky, and the single-baseline, cross-correlation analysis is easily extended to a network of three or more detectors--that is, to multiple baselines. A spherical-harmonic decomposition, which provides maximum-likelihood estimates of the multipole moments of the gravitational-wave sky, is described in detail. We also discuss (i) the covariance matrix of the estimators and its relationship to the detector response of a network of interferometers, (ii) a singular-value decomposition method for regularizing the deconvolution of the detector response from the measured sky map, (iii) the expected increase in sensitivity obtained by including multiple baselines, and (iv) the numerical results of this method when applied to simulated data consisting of both pointlike and diffuse sources. Comparisons between this general method and the standard isotropic and radiometer searches are given throughout, to make contact with the existing literature on stochastic background searches.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An adjoint method for determining the sensitivity of island size to magnetic field variations

An adjoint method to calculate the gradient of island width in stellarators is presented and applied to a set of magnetic field configurations. The underlying method for calculation of the island width is that of Cary & Hanson ( Phys. Fluids B, vol. 3, issue 4, 1991, pp. 1006–1014) (with a minor modification), and requires that the residue of the island centre be small. Therefore, the gradient of the residue is calculated in addition. Both the island width and the gradient calculations are verified using an analytical magnetic field configuration introduced by Reiman & Greenside ( Comput. Phys. Commun. , vol. 43, issue 1, 1986, pp. 157–167). The method is also applied to the calculation of the shape gradient of the width of a magnetic island in a National Compact Stellarator Experiment (NCSX) vacuum configuration with respect to positions on a coil. A gradient-based optimization is applied to a magnetic field configuration studied by Hanson & Cary ( Phys. Fluids , vol. 27, issue 4, 1984, pp. 767–769) to minimize stochasticity by adding perturbations to a pair of helical coils. Although only vacuum magnetic fields and an analytical magnetic field model are considered in this work, the adjoint calculation of the island width gradient could also be applied to a magnetohydrodynamic (MHD) equilibrium if the derivative of the magnetic field, with respect to the equilibrium parameters, is known. Using the island width gradient calculation presented here, more general gradient-based optimization methods can be applied to design stellarators with small magnetic islands. Moreover, the sensitivity of the island size may itself be optimized to ensure that coil tolerances, with respect to island size, are kept as high as possible.

Physics↗

Mean-Variance Hedging on Uncertain Time Horizon in a Market with a Jump

In this work, we study the problem of mean-variance hedging with a random horizon T∧τ, where T is a deterministic constant and τ is a jump time of the underlying asset price process. We first formulate this problem as a stochastic control problem and relate it to a system of BSDEs with a jump. We then provide a verification theorem which gives the optimal strategy for the mean-variance hedging using the solution of the previous system of BSDEs. Finally, we prove that this system of BSDEs admits a solution via a decomposition approach coming from filtration enlargement theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Predictions of Cell Kill During Stereotactic Ablative Radiation Therapy: Do Hypoxia and Reoxygenation Really Matter?

Purpose: To simulate stereotactic ablative radiation therapy on hypoxic and well-oxygenated in silico tumors, incorporating probabilistic parameter distributions and linear-quadratic versus linear-quadratic-cubic methodology and the evaluation of optimal fractionation schemes using biological effective dose (BED{sub α/β=10} {sub or} {sub 3}) comparisons. Methods and Materials: A temporal tumor growth and radiation therapy algorithm simulated high-dose external beam radiation therapy using stochastic methods. Realistic biological proliferative cellular hierarchy and pO{sub 2} histograms were incorporated into the 10{sup 8}-cell tumor model, with randomized radiation therapy applied during continual cell proliferation and volume-based gradual tumor reoxygenation. Dose fractions ranged from 6-35 Gy, with predictive outcomes presented in terms of the total doses (converted to BED) required to eliminate all cells that could potentially regenerate the tumor. Results: Well-oxygenated tumor control BED{sub 10} outcomes were not significantly different for high-dose versus conventional radiation therapy (BED{sub 10}: 79-84 Gy; Equivalent Dose in 2 Gy fractions with α/β of 10: 66-70 Gy); however, total treatment times decreased from 7 down to 1-3 weeks. For hypoxic tumors, an additional 28 Gy (51 Gy BED{sub 10}) was required, with BED{sub 10} increasing with dose per fraction due to wasted dose in the final fraction. Fractions of 9 Gy compromised well for total treatment time and BED, with BED{sub 10}:BED{sub 3} of 84:176 Gy for oxic and 132:278 Gy for non-reoxygenating hypoxic tumors. Initial doses of 12 Gy followed by 6 Gy further increased the therapeutic ratio. When delivering ≥9 Gy per fraction, applying reoxygenation and/or linear-quadratic-cubic cell survival both affected tumor control doses by a significant 1-2 fractions. Conclusions: The complex temporal dynamics of tumor oxygenation combined with probabilistic cell kinetics in the modeling of radiation therapy requires sophisticated stochastic modeling to predict tumor cell kill. For stereotactic ablative radiation therapy, high doses in the first week followed by doses that are more moderate may be beneficial because a high percentage of hypoxic cells could be eradicated early while keeping the required BED{sub 10} relatively low and BED{sub 3} toxicity to tolerable levels.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

L{sup 2}-approximating Pricing under Restricted Information

We consider the mean-variance hedging problem under partial information in the case where the flow of observable events does not contain the full information on the underlying asset price process. We introduce a certain type martingale equation and characterize the optimal strategy in terms of the solution of this equation. We give relations between this equation and backward stochastic differential equations for the value process of the problem.

97 MATHEMATICS AND COMPUTING↗

AlignOT: An Optimal Transport Based Algorithm for Fast 3D Alignment With Applications to Cryogenic Electron Microscopy Density Maps

Aligning electron density maps from Cryogenic electron microscopy (cryo-EM) is a first key step for studying multiple conformations of a biomolecule. As this step remains costly and challenging, with standard alignment tools being potentially stuck in local minima, we propose here a new procedure, called AlignOT, which relies on the use of computational optimal transport (OT) to align EM maps in 3D space. By embedding a fast estimation of OT maps within a stochastic gradient descent algorithm, our method searches for a rotation that minimizes the Wasserstein distance between two maps, represented as point clouds. Here, we quantify the impact of various parameters on the precision and accuracy of the alignment, and show that AlignOT can outperform the standard local alignment methods, with an increased range of rotation angles leading to proper alignment. We further benchmark AlignOT on various pairs of experimental maps, which account for different types of conformational heterogeneities and geometric properties. As our experiments show good performance, we anticipate that our method can be broadly applied to align 3D EM maps.

3D alignment↗

Interpretation of borehole strain measurements using surrogate modeling-based optimization

Interpreting strain data measured during well testing requires inverting poroelastic forward models set up to represent an aquifer or reservoir. One approach is to use stochastic methods to conduct the inversion. Subsurface parameters such as elastic modulus, permeability, and geometry of heterogeneities are estimated by searching the parameter space. This is feasible, but cumbersome, requiring more than a week of computation using many hundreds of computer nodes in one of our earlier analyses. This motivated us to consider alternative methods, including an artificial neural network (ANN) as a surrogate model.

Roudini, Soheil↗

Accuracy of Some Approximate Gaussian Filters for the Navier--Stokes Equation in the Presence of Model Error

Bayesian state estimation of a dynamical system from a stream of noisy measurements is important in many geophysical and engineering applications where high dimensionality of the state space, sparse observations, and model error pose key challenges. In this work, three computationally feasible, approximate Gaussian data assimilation/filtering algorithms are considered in various regimes of turbulent 2D Navier--Stokes dynamics in the presence of model error. The first source of error arises from the necessary use of reduced models for the forward dynamics of the filters, while a particular type of representation error arises from the finite resolution of observations which mix up information about resolved and unresolved dynamics. Two stochastically parameterized filtering algorithms, referred to as cSPEKF and GCF, are compared with 3DVAR---a prototypical time-sequential algorithm known to be accurate for filtering dissipative systems for a suitably inflated “background” covariance. We provide the first evidence that the stochastically parameterized algorithms, which do not rely on detailed knowledge of the underlying dynamics and do not require covariance inflation, can compete with or outperform an optimally tuned 3DVAR algorithm, and they can overcome competing sources of error in a range of dynamical scenarios.

97 MATHEMATICS AND COMPUTING↗

Optimal Complementarity Analysis of Potential Floating Solar Co-Located With Existing Hydropower Assets Across the Contiguous United States

The U.S. is expected to double its rate of renewable capacity from 2024 to 2030. However, the stochastic nature of renewable energy poses challenges to the operation and reliability of our power grid. The combined generation from renewable energy sources, with dispatchable sources (such as hydropower) operating as a hybrid energy plant, could mitigate this variability. In this paper, the complementarity analysis of selected U.S. reservoirs with existing hydropower assets (EHAs) and potential floating photovoltaics (FPVs) is conducted for the continuous U.S. (CONUS). The optimal FPV capacity for each site is determined by minimizing the variability of the combined output, while adhering to the FPV potential. Our results indicate that over 50% of the analyzed reservoirs achieve a stability coefficient exceeding 0.5, leading to a less-variable output after optimization. Finally, we analyze the complementary hydro-FPV hybrid reservoirs by considering both the Pearson correlation coefficient and the stability coefficient on daily, monthly, and yearly scales. Summaries are included of locations of theoretical FPVs co-located with hydropower plants that exhibit high complementarity based on the selected metrics.

13 - HYDRO ENERGY↗

Optimization of rotational arc station parameter optimized radiation therapy

Purpose: To develop a fast optimization method for station parameter optimized radiation therapy (SPORT) and show that SPORT is capable of matching VMAT in both plan quality and delivery efficiency by using three clinical cases of different disease sites. Methods: The angular space from 0° to 360° was divided into 180 station points (SPs). A candidate aperture was assigned to each of the SPs based on the calculation results using a column generation algorithm. The weights of the apertures were then obtained by optimizing the objective function using a state-of-the-art GPU based proximal operator graph solver. To avoid being trapped in a local minimum in beamlet-based aperture selection using the gradient descent algorithm, a stochastic gradient descent was employed here. Apertures with zero or low weight were thrown out. To find out whether there was room to further improve the plan by adding more apertures or SPs, the authors repeated the above procedure with consideration of the existing dose distribution from the last iteration. At the end of the second iteration, the weights of all the apertures were reoptimized, including those of the first iteration. The above procedure was repeated until the plan could not be improved any further. The optimization technique was assessed by using three clinical cases (prostate, head and neck, and brain) with the results compared to that obtained using conventional VMAT in terms of dosimetric properties, treatment time, and total MU. Results: Marked dosimetric quality improvement was demonstrated in the SPORT plans for all three studied cases. For the prostate case, the volume of the 50% prescription dose was decreased by 22% for the rectum and 6% for the bladder. For the head and neck case, SPORT improved the mean dose for the left and right parotids by 15% each. The maximum dose was lowered from 72.7 to 71.7 Gy for the mandible, and from 30.7 to 27.3 Gy for the spinal cord. The mean dose for the pharynx and larynx was reduced by 8% and 6%, respectively. For the brain case, the doses to the eyes, chiasm, and inner ears were all improved. SPORT shortened the treatment time by ∼1 min for the prostate case, ∼0.5 min for brain case, and ∼0.2 min for the head and neck case. Conclusions: The dosimetric quality and delivery efficiency presented here indicate that SPORT is an intriguing alternative treatment modality. With the widespread adoption of digital linac, SPORT should lead to improved patient care in the future.

60 APPLIED LIFE SCIENCES↗

Wireless Fading Channel Models: From Classical to Stochastic Differential Equations

The wireless communications channel constitutes the basic physical link between the transmitter and the receiver antennas. Its modeling has been and continues to be a tantalizing issue, while being one of the most fundamental components based on which transmitters and receivers are designed and optimized. The ultimate performance limits of any communication system are determined by the channel it operates in. Realistic channel models are thus of utmost importance for system design and testing. In addition to exponential power path-loss, wireless channels suffer from stochastic short term fading (STF) due to multipath, and stochastic long term fading (LTF) due to shadowing depending on the geographical area. STF corresponds to severe signal envelope fluctuations, and occurs in densely built-up areas filled with lots of objects like buildings, vehicles, etc. On the other hand, LTF corresponds to less severe mean signal envelope fluctuations, and occurs in sparsely populated or suburban areas. In general, LTF and STF are considered as superimposed and may be treated separately. Ossanna was the pioneer to characterize the statistical properties of the signal received by a mobile user, in terms of interference of incident and reflected waves. His model was better suited for describing fading occurring mainly in suburban areas (LTF environments). It is described by the average power loss due to distance and power loss due to reflection of signals from surfaces, which when measured in dB's give rise to normal distributions, and this implies that the channel attenuation coefficient is log-normally distributed. Furthermore, in mobile communications, the LTF channel models are also characterized by their special correlation characteristics which have been reported. Clarke introduced the first comprehensive scattering model describing STF occurring mainly in urban areas. An easy way to simulate Clarke's model using a computer simulation is described. This model was later expanded to three-dimensions (3D) by Aulin. An indoor STF was introduced. Most of these STF models provide information on the frequency response of the channel, described by the Doppler power spectral density (DPSD). Aulin presented a methodology to find the Doppler power spectrum by computing the Fourier transform of the autocorrelation function of the channel impulse response with respect to time. A different approach, leading to the same Doppler power spectrum relation was presented by Gans. These STF models suggest various distributions for the received signal amplitude such as Rayleigh, Rician, or Nakagami. Models based on autoregressive and moving averages (AR) are proposed. However, these models assume that the channel state is completely observable, which in reality is not the case due to additive noise, and requires long observation intervals. First order Markov models for Raleigh fading have been proposed, and the usefulness of a finite-state Markov channel model is argued. Mobile-to-mobile (or ad hoc) wireless networks comprise nodes that freely and dynamically self-organize into arbitrary and/or temporary network topology without any fixed infrastructure support. They require direct communication between a mobile transmitter and a mobile receiver over a wireless medium. Such mobile-to-mobile communication systems differ from the conventional cellular systems, where one terminal, the base station, is stationary, and only the mobile station is moving. As a consequence, the statistical properties of mobile-to-mobile links are different from cellular ones. Copious ad hoc networking research exists on layers in the open system interconnection (OSI) model above the physical layer. However, neglecting the physical layer while modeling wireless environment is error prone and should be considered more carefully. The experimental results show that the factors at the physical layer not only affect the absolute performance of a protocol, but because their impact on different protocols is nonuniform, it can even change the relative ranking among protocols for the same scenario. The importance of the physical layer is demonstrated by evaluating the Medium Access Control (MAC) performance. Most of the research conducted on wireless channel modeling deals mainly with deterministic wireless channel models. In these models, the speeds of the nodes are assumed to be constant and the statistical characteristics of the received signal are assumed to be fixed with time. But in reality, the propagation environment varies continuously due to mobility of the nodes at variable speeds and movement of objects or scatter across transmitters and receivers resulting in appearance or disappearance of existing paths from one instant to the next. As a result, the current models that assume fixed statistics are unable to capture and track complex time variations in the propagation environment.

99 GENERAL AND MISCELLANEOUS↗

Revisiting the ODE Method for Recursive Algorithms: Fast Convergence Using Quasi Stochastic Approximation

Several decades ago, Profs. Sean Meyn and Lei Guo were postdoctoral fellows at ANU, where they shared interest in recursive algorithms. It seems fitting to celebrate Lei Guo's 60th birthday with a review of the ODE Method and its recent evolution. The method has been regarded as a technique for algorithm analysis. It is argued that this viewpoint is backwards: The original stochastic approximation method was surely motivated by an ODE, and tools for analysis came much later (based on establishing robustness of Euler approximations). The paper presents a brief survey of recent research in machine learning that shows the power of algorithm design in continuous time, following by careful approximation to obtain a practical recursive algorithm. While these methods are usually presented in a stochastic setting, this is not a prerequisite. In fact, recent theory shows that rates of convergence can be dramatically accelerated by applying techniques inspired by quasi Monte-Carlo. Subject to conditions, the optimal rate of convergence can be obtained by applying the averaging technique of Polyak and Ruppert. The conditions are not universal, but theory suggests alternatives to achieve acceleration. The theory is illustrated with applications to gradient-free optimization, and policy gradient algorithms for reinforcement learning.

learning and adaptive systems in artificial intell↗

Reactive power planning under high penetration of wind energy using Benders decomposition

This study addresses the optimal allocation of reactive power volt-ampere reactive (VAR) sources under the paradigm of high penetration of wind energy. Reactive power planning (RPP) in this particular condition involves a high level of uncertainty because of wind power characteristic. To properly model wind generation uncertainty, a multi-scenario framework optimal power flow that considers the voltage stability constraint under the worst wind scenario and transmission N 1 contingency is developed. The objective of RPP in this study is to minimise the total cost including the VAR investment cost and the expected generation cost. Therefore RPP under this condition is modelled as a two-stage stochastic programming problem to optimise the VAR location and size in one stage, then to minimise the fuel cost in the other stage, and eventually, to find the global optimal RPP results iteratively. Benders decomposition is used to solve this model with an upper level problem (master problem) for VAR allocation optimisation and a lower problem (sub-problem) for generation cost minimisation. Impact of the potential reactive power support from doubly-fed induction generator (DFIG) is also analysed. Lastly, case studies on the IEEE 14-bus and 118-bus systems are provided to verify the proposed method.

17 WIND ENERGY↗

Folding of small knotted proteins: Insights from a mean field coarse-grained model

A small but relevant number of proteins whose native structure is known features nontrivial topology, i.e., they are knotted. Understanding the process of folding from a swollen unknotted state to the biologically relevant native conformation is, for these proteins, particularly difficult, due to their rate-limiting topological entanglement. To shed some light into this conundrum, we introduced a structure-based coarse-grained model of the protein, where the information about the folded conformation is encoded in bonded angular interactions only, which do not favor the formation of native contacts. A stochastic search scheme in parameter space is employed to identify a set of interactions that maximizes the probability to attain the knotted state. The optimal knotting pathways of the two smallest knotted proteins, obtained through this approach, are consistent with the results derived by means of coarse-grained as well as full atomistic simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Integrated path planning and control through proximal policy optimization for a marine current turbine

This paper presents an integrated path planning and tracking control framework for a marine current turbine (MCT), where the MCT is treated as an energy-harvesting autonomous underwater vehicle (AUV). Considering the ocean (space of action) is continuous, the proposed framework employs two modules to address path planning and path tracking enabled by the proximal policy optimization (PPO) algorithm, which is a policy gradient deep reinforcement learning (RL) method. Further, to enable fully autonomous operation in a stochastic oceanic environment, the proposed path planning seeks a primary objective of maximizing the harvested energy; then, the path tracking module is designed to minimize the tracking error and avoid collisions with static and dynamic obstacles. Using field-collected acoustic Doppler current profiler (ADCP) data, the performance of the proposed framework is evaluated. Comparative studies with baseline algorithms in three different scenarios of path planning, path tracking without an obstacle, and path tracking with collision avoidance verify the effectiveness of our proposed approach.

16 TIDAL AND WAVE POWER↗

Stochastic minibatch approach to the ptychographic iterative engine

The ptychographic iterative engine (PIE) is a widely used algorithm that enables phase retrieval at nanometer-scale resolution over a wide range of imaging experiment configurations. By analyzing diffraction intensities from multiple scanning locations where a probing wavefield interacts with a sample, the algorithm solves a difficult optimization problem with constraints derived from the experimental geometry as well as sample properties. The effectiveness at which this optimization problem is solved is highly dependent on the ordering in which we use the measured diffraction intensities in the algorithm, and random ordering is widely used due to the limited ability to escape from stagnation in poor-quality local solutions. In this study, we introduce an extension to the PIE algorithm that uses ideas popularized in recent machine learning training methods, in this case minibatch stochastic gradient descent. Our results demonstrate that these new techniques significantly improve the convergence properties of the PIE numerical optimization problem.

47 OTHER INSTRUMENTATION↗